Actually, this feature is only useful
when the type of values (the type V_) is a reference type, to avoid using has just
followed by at to get the corresponding value.
Actually, this feature is useful only
when the type of values (the type V_) is a reference type, to avoid using has just
followed by at to get the corresponding value.
The key_buckets storage area is the primary hash table of capacity elements.
To search some
key, the first access is done in key_buckets using the remainder of the division of the key
hash_code by capacity. In order to try to avoid clashes, capacity is always a prime
number (selected using HASHED_CAPACITY).
The val_buckets storage area is the primary hash table of capacity elements.
To search some
value, the first access is done in val_buckets using the remainder of the division of the value
hash_code by capacity. In order to try to avoid clashes, capacity is always a prime
number (selected using HASHED_CAPACITY).
Approximation of the actual internal storage capacity.
The capacity will grow automatically
when needed (i.e. capacity is not a limit for the number of values stored). Also note that
the capacity value may not be always accurate depending of the implementation (anyway, this
capacity value is at least equals to count).