.NET HashTable Vs Dictionary – Can the Dictionary be as fast?

by

System.Collections.Generic.Dictionary<TKey, TValue> and System.Collections.Hashtable classes both maintain a hash table data structure internally. None of them guarantee preserving the order of items.

Leaving boxing/unboxing issues aside, most of the time, they should have very similar performance.

The primary structural difference between them is that Dictionary relies on chaining (maintaining a list of items for each hash table bucket) to resolve collisions whereas Hashtable uses rehashing for collision resolution (when a collision occurs, tries another hash function to map the key to a bucket).

There is little benefit to use Hashtable class if you are targeting for .NET Framework 2.0+. It’s effectively rendered obsolete by Dictionary<TKey, TValue>.

More Related Contents:

  1. Does C# have a way of giving me an immutable Dictionary?
  2. Serialize Class containing Dictionary member
  3. Why is a Dictionary “not ordered”?
  4. Duplicate keys in .NET dictionaries?
  5. C# dictionary – one key, many values
  6. How to check if IEnumerable is null or empty?
  7. Hashtable with MultiDimensional Key in C#
  8. What .NET collection provides the fastest search
  9. Is there an IDictionary implementation that, on missing key, returns the default value instead of throwing?
  10. The opposite of Intersect()
  11. Two-way / bidirectional Dictionary in C#?
  12. .NET ObservableDictionary
  13. Multi Value Dictionary?
  14. C# Sortable collection which allows duplicate keys
  15. A dictionary object that uses ranges of values for keys
  16. Does the Enumerator of a Dictionary return key value pairs in the order they were added?
  17. Enum to Dictionary in C#
  18. Initial capacity of collection types, e.g. Dictionary, List
  19. How to get around lack of covariance with IReadOnlyDictionary?
  20. Enum to Dictionary in C#
  21. Reverse Sorted Dictionary in .NET
  22. Remove Item in Dictionary based on Value
  23. C# List – Removing items while looping / iterating [duplicate]
  24. Returning ‘IList’ vs ‘ICollection’ vs ‘Collection’
  25. How to sort a dictionary by key
  26. Is it possible to create some IGrouping object
  27. Accessing a Dictionary.Keys Key through a numeric index
  28. What benefits does dictionary initializers add over collection initializers?
  29. How to get random values from array in C# [duplicate]
  30. Hashtable to Dictionary syncroot .

Leave a Comment