Hashtable Constructor (IDictionary, Single, IHashCodeProvider, IComparer)
Copies the elements from the specified dictionary to a new Hashtable with the same initial capacity as the number of elements copied and using the specified load factor, the specified hash code provider and the specified comparer.
[Visual Basic] Public Sub New( _ ByVal d As IDictionary, _ ByVal loadFactor As Single, _ ByVal hcp As IHashCodeProvider, _ ByVal comparer As IComparer _ ) [C#] public Hashtable( IDictionary d, float loadFactor, IHashCodeProvider hcp, IComparer comparer ); [C++] public: Hashtable( IDictionary* d, float loadFactor, IHashCodeProvider* hcp, IComparer* comparer ); [JScript] public function Hashtable( d : IDictionary, loadFactor : float, hcp : IHashCodeProvider, comparer : IComparer );
- The IDictionary to copy to a new Hashtable.
- A number in the range from 0.1 through 1.0 indicating the maximum ratio of elements to buckets.
- The IHashCodeProvider that supplies the hash codes for all keys in the Hashtable.
A null reference (Nothing in Visual Basic) to use the default hash code provider, which is each key's implementation of Object.GetHashCode.
- The IComparer to use to determine whether two keys are equal.
A null reference (Nothing in Visual Basic) to use the default comparer, which is each key's implementation of Object.Equals.
|ArgumentNullException||d is a null reference (Nothing in Visual Basic).|
|ArgumentOutOfRangeException||loadFactor is less than 0.1.
loadFactor is greater than 1.0.
The initial capacity is set to the number of elements in the source dictionary. Capacity is automatically increased as required based on the load factor.
The load factor is the maximum ratio of elements to buckets. A smaller load factor means faster lookup at the cost of increased memory consumption. A load factor of 1.0 is the best balance between speed and size.
When the actual load factor reaches the load factor, the number of buckets is automatically increased to the smallest prime number that is larger than twice the current number of buckets.
The comparer determines whether two keys are equal. Every key in a Hashtable must be unique. The default comparer is the key's implementation of Object.Equals.The custom hash code provider and the custom comparer enable such scenarios as doing lookups with case-insensitive strings.
The elements of the new Hashtable are sorted in the same order in which the enumerator iterates through the IDictionary.
Platforms: Windows 98, Windows NT 4.0, Windows Millennium Edition, Windows 2000, Windows XP Home Edition, Windows XP Professional, Windows Server 2003 family