The last user's external index in range [1 .. count] (see item and valid_index for example)
may be saved in cache_user otherwise -1 to indicate that the cache is not active.
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 with the very best performances.
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).
The last user's external index in range [1 .. count] (see item and valid_index for example)
may be saved in cache_user otherwise -1 to indicate that the cache is not active.
Internal storage capacity of the dictionary is initialized using
the Default_size value. Then, tuning of needed storage capacity is performed automatically
according to usage. If you are really sure that your dictionary is always really bigger than
Default_size, you may consider to use with_capacity to save some execution time.
May be used to save some execution time if one is sure that storage size will rapidly become
really bigger than Default_size.
When first remove occurs, storage size may naturally become smaller than medium_size.
Afterall, tuning of storage size is done automatically according to usage.