Detecting duplicates or collisions in a hashtable or dictionary

I am studying the .NET Hashtable class and would like to experiment with various aspects ...

  • How many collisions (repetitions) occur in a given dataset
  • Is the hash table extension safe for multi-threaded access?
  • What is the current load factor of my hash table?

How can I experiment or study the information above regarding a given hash table or dictionary

+3
source share
1 answer

Stream security is Hashtablelisted on MSDN . This is thread safe if only one thread writes to Hashtable, and this should include an extension.

, Reflector:

loadFactor, , .

. Hashtable, . , , , Reflector Hashtable, . , , .

+2

All Articles