Associative memory. Values of type V_ are stored using Keys of type K_.
Efficient implementation of DICTIONARY using an AVL balanced tree. AVL stands for the names of G. M. Adel'son-Velskii
and E. M. Landis, two Russian mathematicians who first came up with this method of keeping the tree balanced.
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).
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.