Hashtable
Description
The Hashtable class implements an object that is a collection of Key-Value pairs based on hash code of the key.
Comment
The Hashtable class object consists of segments that contain collection elements. A segment is a virtual subgroup of elements inside the object that enables the user to simplify and speed up search and extracting of the elements in comparison with the most of collections. Each segment is connected with numeric hash code that is created with the help of built-in hash function and based on the element key.
Class object properties inherited from IDictionary
|
Property name |
Brief description |
|
Item |
The Item property determines value of glossary element. |
|
Keys |
The Keys property returns the collection of dictionary keys. |
|
Values |
The Values property returns the collection of dictionary element values. |
Class object properties inherited from ICollection
|
Property name |
Brief description |
|
Count |
The Count property returns the number of array elements. |
Class object methods inherited from IHashtable
|
Method name |
Brief description |
|
Clone |
The Clone method creates a copy of hash table. |
|
ContainsKey |
The ContainsKey method checks if there is an element with the specified key. |
|
ContainsValue |
The ContainsValue method checks if there is an element with the specified value. |
Class object methods inherited from IDictionary
|
Method name |
Brief description |
|
Add |
The Add method adds an element to glossary. |
|
Clear |
The Clear method clears the glossary. |
|
Contains |
The Contains method checks if the element with the Key key exists. |
|
Remove |
The Remove method removes element with the Key key. |
Class object methods inherited from ICollection
|
Method name |
Brief description |
|
CopyTo |
The CopyTo method copies the collection into an array. |
See also:
Collections Assembly Classes