Point of view

ANY

Summary

Class invariant

- capacity >= count

Overview

Approximation of the actual internal storage capacity.

Return the value associated to key __k__.

Return the value associated to key __k__ using basic __=__ for comparison.

Return Void or the value associated with key __k__.

Same work as reference_at, but basic __=__ is used for comparison.

To add a new entry __k__ with its associated value __v__.

Number of occurrences using is_equal for comparison.

Number of occurrences using basic __=__ for comparison.

Retrieve the key used for value __v__ using is_equal for comparison.

Retrieve the key used for value __v__ using __=__ for comparison.

Discard all items (is_empty is True after that call).

Item at the corresponding index __i__.

Retrieve the internal key object which correspond to the existing
entry __k__ (the one memorized into the __Current__ dictionary).

Reinitialize by copying all associations of __other__.

The infix notation which is actually a synonym for at.

Remove entry __k__ (which may exist or not before this call).

Minimum index.

Maximum index.

Append in __buffer__, all available keys (this may be useful to
speed up the traversal).

Append in __buffer__, all available items (this may be useful to
speed up the traversal).

Do both dictionaries have the same set of associations?

Do both dictionaries have the same set of associations?

Apply __action__ to every [V_, K_] associations of __Current__.

Do all [V_, K_] associations satisfy __test__?

Does at least one [V_, K_] association satisfy __test__?

True when __i__ is valid (i.e., inside actual bounds).

Number of available indices.

V_are stored using Keys of typeK_.DICTIONARYusing 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.