+
Point of view
All features
class EXT_AVL_SET_NODE [E_]
Summary
top
Auxiliary class to implement EXT_AVL_SET.
This a classic implementation of an AVL tree (balanced tree first designed by Adelson-Velskii and Landis, 1960)
Direct parents
Inherit list: ABSTRACT_AVL_SET_NODE
Class invariant
top
Overview
top
Creation features
{EXT_AVL_SET}
Features
{}
{ABSTRACT_AVL_SET}
{ANY}
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
Rotations:
{AVL_TREE}
  • rotate_right: EXT_AVL_SET_NODE [E_]
    Proceeds to some reorganisation and returns the upper node.
  • rotate_left: EXT_AVL_SET_NODE [E_]
    Proceeds to some reorganisation and returns the upper node.
{RECYCLING_POOL}
  • recycle
    Do whatever needs to be done to free resources or recycle other objects when recycling this one
{}
order: FUNCTION[TUPLE[TUPLE 2[E_, E_]]]
writable attribute
{}
top
ordered (e1: E_, e2: E_): BOOLEAN
effective function
{}
top
True if [e1, e2] is a correctly ordered sequence; usually, e1 < e2
make (a_order: FUNCTION[TUPLE[TUPLE 2[E_, E_]]])
effective procedure
{}
top
set (i: ANY)
effective procedure
{ABSTRACT_AVL_SET}
top
out_in_tagged_out_memory
effective procedure
{ANY}
top
safe_equal: SAFE_EQUAL[E_]
writable attribute
{ANY}
top
left: EXT_AVL_SET_NODE [E_]
writable attribute
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
right: EXT_AVL_SET_NODE [E_]
writable attribute
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
item: E_
writable attribute
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
balance: INTEGER_32
writable attribute
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
Balance factor; either balanced (the tree is balanced), imbalanced_left (the left branch is the longer) or imbalanced_right (the right branch is the longer)
count: INTEGER_32
effective function
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
height: INTEGER_32
effective function
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
map_in (map: COLLECTION[EXT_AVL_SET_NODE [E_]])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
has (e: E_): BOOLEAN
effective function
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
Is element e in the tree?
fast_has (e: E_): BOOLEAN
effective function
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
Is element e in the tree?
at (e: E_): EXT_AVL_SET_NODE [E_]
effective function
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
Is element e in the tree?
set_item (i: E_)
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
set_left (l: EXT_AVL_SET_NODE [E_])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
set_right (r: EXT_AVL_SET_NODE [E_])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
set_balance (b: INTEGER_32)
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
rotate_right: EXT_AVL_SET_NODE [E_]
effective function
{AVL_TREE}
top
Proceeds to some reorganisation and returns the upper node.
rotate_left: EXT_AVL_SET_NODE [E_]
effective function
{AVL_TREE}
top
Proceeds to some reorganisation and returns the upper node.
recycle
effective procedure
{RECYCLING_POOL}
top
Do whatever needs to be done to free resources or recycle other objects when recycling this one
balanced: INTEGER_32
is 0
constant attribute
{}
top
imbalanced_left: INTEGER_32
is -1
constant attribute
{}
top
imbalanced_right: INTEGER_32
is 1
constant attribute
{}
top