How to use hashtable?

Question

Possible Duplicate:
When to use a HashTable

Why we use Hashtable in csharp? What is the need of it?

[Wikipedia](http://en.wikipedia.org/wiki/Hashtable): *In many situations, hash tables turn out to be more efficient than search trees or any other table lookup structure. For this reason, they are widely used in many kinds of computer software, particularly for associative arrays, database indexing, caches, and sets.* — Felix Kling, Mar 13 '11 at 15:51

Pleun · Answer 1 · 2011-03-13T20:24:37.927

2

Probably you don't want to use the HashTable (non generic) at all, but rather use the

Dictionary<TKey, TValue>

or the

HashSet<T>

if you only need keys

edited Mar 13 '11 at 20:24

answered Mar 13 '11 at 20:06

Pleun

8,856
2
30
50

1

Beep... Why? At least you should have suggested the Dictionary as a (nearly always) better substitute for the Hashtable. The HashSet is something different (but connected to) – xanatos Mar 13 '11 at 20:14

score 1 · Answer 2 · edited May 23 '17 at 12:04

1

When to use a HashTable

edited May 23 '17 at 12:04

Community

1
1

answered Mar 13 '11 at 15:50

joelt

2,672
2
24
32

score 0 · Answer 3 · answered Mar 13 '11 at 15:53

One easy answer would be "performance" using hashtables to store data makes it possible to find and access the data much faster than iteraing over all objects in a list. Wikipedia has a great (large) article about hash tables in general, which gives a good description about it.

How to use hashtable?

3 Answers3