ARRAYED_COLLECTION | Common root for ARRAY[E] and FAST_ARRAY[E].
|
AVL_DICTIONARY_NODE | Auxiliary class to implement AVL_DICTIONARY[E].
|
AVL_HELPER |
|
AVL_NODE | Auxiliary class to implement AVL_SET[E].
This a classic implementation of an AVL tree (balanced tree first
designed by Adelson-Velskii and Landis, 1960)
|
AVL_SET_NODE | Auxiliary class to implement AVL_SET[E].
This a classic implementation of an AVL tree (balanced tree first
designed by Adelson-Velskii and Landis, 1960)
|
HASHED_DICTIONARY_NODE | Auxilliary class to implement HASHED_DICTIONARY[V,K->HASHABLE].
|
HASH_TABLE_SIZE | Some useful features to deal with prime INTEGER values in order to
select an appropriate size for some hash table (used for example
by the DICTIONARY class as well as by the SET class).
|
LINKED_COLLECTION | Common root of LINKED_LIST and TWO_WAY_LINKED_LIST.
|
LINKED_LIST_NODE | To implement LINKED_LIST[E].
|
TWO_WAY_LINKED_LIST_NODE | To implement TWO_WAY_LINKED_LIST[E].
|