home
wiki
classes/clusters list
class information
+
Point of view
ANY
ANY
AVL_TREE
AVL_TREE_NODE
INTERNALS_HANDLER
All features
deferred class AVL_TREE_NODE [E_ ->
COMPARABLE
]
Summary
top
Auxiliary class to implement
AVL_SET
.
This a classic implementation of an AVL tree (balanced tree first designed by Adelson-Velskii and Landis (hence A.V.L.), 1960)
Direct parents
insert list:
AVL_CONSTANTS
Known children
inherit list:
AVL_DICTIONARY_NODE
,
AVL_SET_NODE
Overview
top
exported features
out_in_tagged_out_memory
out_in_tagged_out_memory
effective procedure
top
ensure
not_cleared:
tagged_out_memory.count >= old tagged_out_memory.count
append_only:
old tagged_out_memory.twin.is_equal(tagged_out_memory.substring(1, old tagged_out_memory.count))