+
Point of view
AVL_SET
class AVL_SET_NODE [E_ -> COMPARABLE]
Summary
Overview
creation features
exported features
Creation:
Rotations:
  • rotate_right: AVL_SET_NODE [E_ -> COMPARABLE]
    Proceeds to some reorganisation and returns the upper node.
  • rotate_left: AVL_SET_NODE [E_ -> COMPARABLE]
    Proceeds to some reorganisation and returns the upper node.
make (i: E_)
effective procedure
out_in_tagged_out_memory
effective procedure
left: AVL_SET_NODE [E_ -> COMPARABLE]
writable attribute
right: AVL_SET_NODE [E_ -> COMPARABLE]
writable attribute
item: E_
writable attribute
balance: INTEGER_32
writable attribute
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
height: INTEGER_32
effective function
map_in (map: COLLECTION[AVL_SET_NODE [E_ -> COMPARABLE]])
effective procedure
has (e: E_): BOOLEAN
effective function
Is element e in the tree?
fast_has (e: E_): BOOLEAN
effective function
Is element e in the tree?
at (e: E_): AVL_SET_NODE [E_ -> COMPARABLE]
effective function
Is element e in the tree?
set_item (i: E_)
effective procedure
set_left (l: AVL_SET_NODE [E_ -> COMPARABLE])
effective procedure
set_right (r: AVL_SET_NODE [E_ -> COMPARABLE])
effective procedure
set_balance (b: INTEGER_32)
effective procedure
rotate_right: AVL_SET_NODE [E_ -> COMPARABLE]
effective function
Proceeds to some reorganisation and returns the upper node.
rotate_left: AVL_SET_NODE [E_ -> COMPARABLE]
effective function
Proceeds to some reorganisation and returns the upper node.