当键本身是字典时,如何检查键是否存在于字典中(c#)

本文关键字:字典 是否 存在 于字典 检查 何检查 | 更新日期: 2023-09-27 18:15:01

我有一个字典[mapData]如下,检查键是[Dictionary< string, DateTime >]存在于[mapData],但它没有工作:

        var mapData = new Dictionary<Dictionary<string, DateTime>, List<Student>>();
        foreach (var st in listStudent)
        {
            // Create Key
            var dicKey = new Dictionary<string, DateTime>();
            dicKey.Add(st.Name, st.Birthday);
            // Get mapData
            if (!mapData.ContainsKey(dicKey))       // ===> Can not check key exists
            {
                mapData.Add(dicKey, new List<Student>());
            }
            mapData[dicKey].Add(st);
        }

我尝试了下面的扩展方法,但也不起作用:

        public static bool Contains<Tkey>(this Dictionary<Tkey, List<Student>> dic, Tkey key)
        {
            if (dic.ContainsKey(key))
                return true;
            return false;
        }

任何关于这些的提示都会有很大的帮助。

当键本身是字典时,如何检查键是否存在于字典中(c#)

这是因为您试图根据对象引用而不是键内容查找键。您的字典键是键+值(string + DateTime)引用的组合。

除非你重写和IEqualityComparer.

var objectA = new ObjectA();
var objectB = new ObjectA();

objectA != objectB除非你重写等号

编辑

这个示例来自MSDN https://msdn.microsoft.com/en-us/library/ms132151(v=vs.110).aspx

using System;
using System.Collections.Generic;
class Example
{
   static void Main()
   {
      BoxEqualityComparer boxEqC = new BoxEqualityComparer();
      var boxes = new Dictionary<Box, string>(boxEqC);
      var redBox = new Box(4, 3, 4);
      AddBox(boxes, redBox, "red");
      var blueBox = new Box(4, 3, 4);
      AddBox(boxes, blueBox, "blue");
      var greenBox = new Box(3, 4, 3);
      AddBox(boxes, greenBox, "green");
      Console.WriteLine();
      Console.WriteLine("The dictionary contains {0} Box objects.",
                        boxes.Count);
   }
   private static void AddBox(Dictionary<Box, String> dict, Box box, String name)
   {
      try {
         dict.Add(box, name);
      }
      catch (ArgumentException e) {
         Console.WriteLine("Unable to add {0}: {1}", box, e.Message);
      }
   }
}
public class Box
{
    public Box(int h,  int l, int w)
    {
        this.Height = h;
        this.Length = l;
        this.Width = w;
    }
    public int Height { get; set; }
    public int Length { get; set; }
    public int Width { get; set; }
    public override String ToString()
    {
       return String.Format("({0}, {1}, {2})", Height, Length, Width);
    }
}

class BoxEqualityComparer : IEqualityComparer<Box>
{
    public bool Equals(Box b1, Box b2)
    {
        if (b2 == null && b1 == null)
           return true;
        else if (b1 == null | b2 == null)
           return false;
        else if(b1.Height == b2.Height && b1.Length == b2.Length
                            && b1.Width == b2.Width)
            return true;
        else
            return false;
    }
    public int GetHashCode(Box bx)
    {
        int hCode = bx.Height ^ bx.Length ^ bx.Width;
        return hCode.GetHashCode();
    }
}
// The example displays the following output:
//    Unable to add (4, 3, 4): An item with the same key has already been added.
//
//    The dictionary contains 2 Box objects.

你不会想去那里的。复杂对象不应该是字典中的键。我建议将字典移到值处,并创建一个更像树的结构。

有一种可能使此工作,但我建议不要这样做,因为上面的原因:实现自定义IEqualityComparer,将字典中的键与另一个字典进行比较。