在.net 2.0中存储非唯一对？

Question

I have to store a pair of strings that are non-unique, so I could have something like:

"A", "B" "A","C"

I can't use a Dictionary or HashTable because I don't have a unique key. I thought about a couple options:

List<List<string>,List<string>> = new List<List<string>,List<string>>(); //Too long?

Create a class or struct (what is better?) to hold my pairs and then store that in list, so

class pairs
{

}

List<pairs> values = new List<pairs>();

I also just need to be able to enumerate through the pairs, so I don't need care about querying, sorting, comparing. Because of this, is it best to use the least specific type, such as Enumerable?

Answer 1

You should be able to use a List<KeyValuePair<string, string>> .

KeyValuePair<TKey, TValue> structs by themselves don't require unique keys, even if you collect them in a single list.

If you think KVPs don't ring well semantically with what you want, just go with a custom type. It shouldn't matter whether your custom type is a class or struct.

Answer 2

What about just a List<string[]> ?

var list = new List<string[]>();

list.Add(new [] { "A", "B"});

foreach(var pair in list)
{
   Console.WriteLine(pair[0] + pair[1]);
}

Answer 3

你可以使用List<KeyValuePair<string,string>> ，但是为了避免键的语义（因为你说它不是唯一的），我会使用List<Tuple<string,string>> ，这实际上是相同但具有不同的语义。