1. | Compares the efficiency of the hash map implementation with the tree map | |  |
2. | Implement GetHashCode method and store it in a hashtable | |  |
3. | Add value to Hashtable and loop through the value key pairs | |  |
4. | Enumerating a hash table collection | |  |
5. | illustrates the use of a Hashtable | |  |
6. | illustrates the use of the Hashtable methods | |  |
7. | Demonstrate Hashtable | |  |
8. | Get IDictionaryEnumerator enumerator from Hashtable | | |
9. | Properties based on Hashtable | | |
|
10. | DictionaryEntry Structure Defines a dictionary key/value pair that can be set or retrieved. | | |
11. | Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object. | | |
12. | Hashtable.Clear Method removes all elements from the Hashtable. | | |
13. | Hashtable.Contains Method determines whether the Hashtable contains a specific key. | | |
14. | Hashtable.CopyTo Method copies the Hashtable elements to a one-dimensional Array instance at the specified index. | | |
15. | Hashtable.GetEnumerator Method returns an IDictionaryEnumerator that iterates through the Hashtable. | | |
16. | Hashtable.IsSynchronized Property gets a value indicating whether access to the Hashtable is synchronized (thread safe). | | |
17. | Hashtable.Remove Method removes the element with the specified key from the Hashtable. | | |
18. | IComparer Interface exposes a method that compares two objects. | | |