blocks|key|347673|text|不在Fx+<3.5中..显然，您可以使用IList对象的字典来实现。但是你也有封装的问题/责任。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|347674|如果您使用的是.NET+3.5，请使用Lookup类。|offset|length|347675|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/bb460184.aspx^0|0|J|6|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|O|8|@]|9|@$D|P|E|Q|1|R]]|A|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]]]

Not in the Fx &lt; 3.5.. You can implement one, obviously, with a Dictionary of IList objects. But then you have the encapsulation issue/responsibility.

If you're using .NET 3.5, use the <a href="http://msdn.microsoft.com/en-us/library/bb460184.aspx" rel="nofollow noreferrer">Lookup</a> class.

blocks|key|3341090|text|根据定义，字典包含唯一键。上面的示例实际上是一种二维键控数组，这是我使用过很多次的结构。为什么要有重复的密钥呢？如果您这样做了，那么字典将如何唯一地寻址其成员呢？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3341091|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

By definition, a Dictionary contains unique keys. Your example above is effectively a sort of two-dimensional keyed array, a structure I've used many times. Why would you want to have duplicate keys? If you did, how would the Dictionary uniquely address its members?

blocks|key|349189|text|.NET+2.0：PowerCollections包含OrderedMultiDictionary。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|349190|entityMap|0|LINK|mutability|MUTABLE|url|http://www.codeplex.com/PowerCollections/Release/ProjectReleases.aspx?ReleaseId=6863^0|R|M|9|G|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@$9|Q|A|R|1|S]]|E|$]]|$1|F|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]]]

.NET 2.0: <a href="http://www.codeplex.com/PowerCollections/Release/ProjectReleases.aspx?ReleaseId=6863" rel="noreferrer">PowerCollections</a> contains the <code>OrderedMultiDictionary</code>.

blocks|key|352832|text|如果你使用的是.NET+3.5，那么Lookup可能就是你想要的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|352833|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/bb460184.aspx^0|I|6|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

If you're using .NET 3.5 then <a href="http://msdn.microsoft.com/en-us/library/bb460184.aspx" rel="noreferrer">Lookup</a> is probably what you're after.

blocks|key|3128299|text|我遇到了同样的问题..我需要一个允许重复密钥的sortedList。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3128300|var+sortList+=+new+SortedList<string,+IDictionary<string,+object>>();|code-block|syntax|javascript|3128301|但这不管用..所以我用了|3128302|var+list+=+new+List<KeyValuePair<string,+IDictionary<string,+object>>>();|3128303|将新数据添加到其中作为..|3128304|list.Add(new+KeyValuePair<string,+IDictionary<string,+object>>>(value,+Dictionary));|3128305|使用linq，我毫不费力地对其进行了排序。|3128306|试试List<KeyValuePair<TKey,+List<TValue>>>();|offset|length|style|CODE|3128307|entityMap^0|0|0|0|0|0|0|0|2|15|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|10|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|12|8|@]|9|@]|A|$]]|$1|M|3|N|5|D|7|13|8|@]|9|@]|A|$E|F]]|$1|O|3|P|5|6|7|14|8|@]|9|@]|A|$]]|$1|Q|3|R|5|6|7|15|8|@$S|16|T|17|U|V]]|9|@]|A|$]]|$1|W|3|-4|5|6|7|18|8|@]|9|@]|A|$]]]|X|$]]

I came across with same issue.. I needed a sortedList which can allow Duplicate Keys.. 

<pre><code>var sortList = new SortedList&lt;string, IDictionary&lt;string, object&gt;&gt;();
</code></pre>

but this didnt work.. so i used 

<pre><code>var list = new List&lt;KeyValuePair&lt;string, IDictionary&lt;string, object&gt;&gt;&gt;();
</code></pre>

add new data to it as ..

<pre><code>list.Add(new KeyValuePair&lt;string, IDictionary&lt;string, object&gt;&gt;&gt;(value, Dictionary));
</code></pre>

with linq i sorted it with no problem..

Try <code>List&lt;KeyValuePair&lt;TKey, List&lt;TValue&gt;&gt;&gt;();</code>

blocks|key|349206|text|您仍然可以使用SortedList，并尝试通过将值和Guid组合到一个类中来创建一个惟一的键。在这种情况下，您必须为新密钥实现IComparer<NewKey>，如下所示：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|349207|class+MyKey
{
++++public+Guid+Guid+{+get;+set;+}
++++public+float+Value+{+get;+set;+}
}

class+MyComparer+:+IComparer<MyKey>
{

++++public+int+Compare(MyKey+x,+MyKey+y)
++++{
++++++++if+(x+==+null+%7C%7C+y+==+null)
++++++++++++throw+new+InvalidOperationException("both+of+parameters+must+be+not+null");
++++++++if+(x.Value+<+y.Value)+return+-1;
++++++++if+(x.Value+>+y.Value)+return+1;
++++++++return+0;
++++}
}|code-block|syntax|javascript|349208|然后|349209|var+mySortedList+=+new+SortedList<MyKey,+MyValue>(new+MyComparer());|349210|entityMap^0|1R|H|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@$9|R|A|S|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|T|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|U|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|V|8|@]|D|@]|E|$I|J]]|$1|O|3|-4|5|6|7|W|8|@]|D|@]|E|$]]]|P|$]]

You still can use SortedList and try to make a unique key by combining your value and a Guid into a class. In this case, you must implement the <code>IComparer&lt;NewKey&gt;</code> for your new key, something like:

<pre><code>class MyKey
{
 public Guid Guid { get; set; }
 public float Value { get; set; }
}

class MyComparer : IComparer&lt;MyKey&gt;
{

 public int Compare(MyKey x, MyKey y)
 {
 if (x == null || y == null)
 throw new InvalidOperationException("both of parameters must be not null");
 if (x.Value &lt; y.Value) return -1;
 if (x.Value &gt; y.Value) return 1;
 return 0;
 }
}
</code></pre>

and then

<pre><code>var mySortedList = new SortedList&lt;MyKey, MyValue&gt;(new MyComparer());
</code></pre>

blocks|key|350184|text|这是行不通的。一旦比较器返回0，它就会抛出"duplicate“异常。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|350185|您不需要类封装或任何东西，只需创建一个不返回0(等于)结果的比较器即可。以下是int类型密钥的示例|offset|length|style|CODE|350186|class+MyComparer+:+IComparer<int>
{

++public+int+Compare(int+x,+int+y)
++{
++++if+(x+<+y)
++++++return+-1;
++++else+return+1;
++}
}|code-block|syntax|javascript|350187|entityMap^0|0|13|3|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@$D|Q|E|R|F|G]]|9|@]|A|$]]|$1|H|3|I|5|J|7|S|8|@]|9|@]|A|$K|L]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

That does not work. As soon as you return 0 from the comparer, it will throw "duplicate" exception.

You don't need classes encapsulation or anything, just make a comparer that does not return 0 (equal) result. Here is an example for <code>int</code> type of key

<pre><code>class MyComparer : IComparer&lt;int&gt;
{

 public int Compare(int x, int y)
 {
 if (x &lt; y)
 return -1;
 else return 1;
 }
}
</code></pre>

<blockquote>
 Possible Duplicate: 
 <a href="https://stackoverflow.com/questions/5716423/c-sharp-sortable-collection-which-allows-duplicate-keys">C# Sortable collection which allows duplicate keys</a> 
</blockquote>



Basically I'd like to make a Dictionary work with duplicate keys without going into custom comparer implementations. There is an idea of:

<pre><code> Dictionary&lt;key, List&lt;value&gt;&gt;
</code></pre>

but it still has some overhead. I wish Dictionary had "AllowDuplicates".

Is there an alternative to Dictionary/SortedList that allows duplicates?

可能重复：基本上，我想让Dictionary使用重复的键，而不是进入自定义的比较器实现。有一种想法是： Dictionary<key, List<value>>但它仍然有一些开销。我希望字典有"AllowDuplicates“。

问除了Dictionary/SortedList之外，有没有一种允许重复的方法？
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问除了Dictionary/SortedList之外，有没有一种允许重复的方法？EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问除了Dictionary/SortedList之外，有没有一种允许重复的方法？
EN