This dictionary is sorted in the order in which the keys are added.
Access time is not good at all: O(n)
Warning: this class which is still there in 2.3 may be removed in the next release. Avoid
using it. Actually, if your K_ type is HASHABLE, you may consider to use
HASHED_DICTIONARY or AVL_DICTIONARY if your class is COMPARABLE.
Also note that any class can be made HASHABLE with just a little bit of imagination (if
you really have no idea, convert the key of type K_ to its POINTER equivalent).
If there is as yet no key k in the dictionary,
enter it with item v. Otherwise overwrite the item associated with key k.
As the put procedure actually uses is_equal, you may consider to use fast_put for expanded
objects as well while trying to get the very best performances.
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).