class PHashTable |
The hash table class is the basis for implementing the PSet and PDictionary classes.
![]() | Construction |
![]() | Overrides from class PObject |
![]() | Overrides from class PContainer |
![]() | New functions for class |
Common functions for collections
Common functions for containers
Run Time Type functions
I/O functions
Miscellaneous functions
Comparison functions
The hash table class is the basis for implementing the PSet and PDictionary classes.The hash table allows for very fast searches for an object based on a "hash function". This function yields an index into an array which is directly looked up to locate the object. When two key values have the same hash function value, then a linear search of a linked list is made to locate the object. Thus the efficiency of the hash table is highly dependent on the quality of the hash function for the data being used as keys.
The ordinal position in the hash table is determined by the hash values of the keys and the order of insertion.
The last key/data pair is remembered by the class so that subseqent access is very fast.
This function is primarily used by the descendent template classes, or macro, with the appropriate type conversion.
The ordinal position in the hash table is determined by the hash values of the keys and the order of insertion.
The last key/data pair is remembered by the class so that subseqent access is very fast.
This function is primarily used by the descendent template classes, or macro, with the appropriate type conversion.
Alphabetic index HTML hierarchy of classes or Java