C# equivalents of STL containers?

I've got a lot of experience in C++, just looking at C# now. The basics seem easy enough, but what I've not yet found are good analogs to STL containers in C++.

I'm just wondering what the C# equivalents to certain C++ containers are:

std::vector -- Probably System.Collections.Arraylist?
std::list
std::map -- Probably System.Collections.Hashtable?
std::set -- I suppose one could use System.Collections.Hashtable and discard the value.
std::multimap
std::multiset

Roll everything up into List<> and Dictionary<> and that's how it is in C#. You also have sorted versions of those containers too, but I assume the idea is not to worry about such "trivial" matters as the difference between a vector and a linked list. ;)

Generally it's System.Collections and System.Collections.Generic in C#2.

But if you want my opinion, what .Net offers is a joke. Java has got a far more complete and interesting container collection.

There is no linked list. There's AFAICR no tree map (which is what std::map effectively is). I can't remember anything about a set.


Prelude, your new avatar is irritating.

Agreed Prelude. Switch back ;)

>Agreed Prelude. Switch back
Okay, but how far back? How about number 1? :D

Nice :D

Quote:

---

Originally Posted by CornedBee

There is no linked list.

---

Erm, LinkedList<>?

I generally use the following to replicate similar data structures from the STL.
std::vector - List<T>
std::list - LinkedList<T>
std::map - Dictionary<Tkey, Tvalue>
std::set - Dictionary<Tkey, Tvalue> (with null values)
std::multimap - Dictionary<Tkey, List<Tvalue>>
std::multiset - Dictionary<Tkey, int> (with int keeping count of the number of Tkeys)

>Erm, LinkedList<>?
I took a look and I was mistaken. It seems that 2.0 has List<>, Stack<>, Queue<>, Dictionary<>, SortedList<>, SortedDictionary<>, and LinkedList<>. That's a much better selection that I thought before and maps more closely to the STL if you want to do a comparison.

>I generally use the following to replicate similar data structures from the STL.
I generally tailor my solutions to .NET rather than try to apply relations that might not be present. Then again, I also write my own data structures about half the time, so I might not be the best person to listen to.

Actually piano, having played with C# and reading a lot of documentation pages once I was given a kick in the right direction, it seems SortedDictionary<> is closest to std::set and std::map in that it sorts by key (often nice) and it seems to internally use a balanced tree structure (judging by the big-O of the insertion/access/etc. times). Dictionary<> uses a hashtable which is a useful tool also.

Nice idea though on the multiset/multimap!

Wow...I didn't know about the SortedDictionary class. Sweet.