class AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
Summary
Overview
creation features
features
Creation:
  • make (v: V_, k: K_)
Rotations:
  • rotate_right: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
    Proceeds to some reorganisation and returns the upper node.
  • rotate_left: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
    Proceeds to some reorganisation and returns the upper node.
value: V_
writable attribute
set_value (v: V_)
effective procedure
fast_at (k: K_): AVL_DICTIONARY_NODE[V_, K_]
effective function
Is element e in the tree?
occurrences (v: V_): INTEGER_32
effective function
fast_occurrences (v: V_): INTEGER_32
effective function
key_at (v: V_): K_
effective function
fast_key_at (v: V_): K_
effective function
occurrences_ (v: V_, cnt: INTEGER_32): INTEGER_32
effective function
fast_occurrences_ (v: V_, cnt: INTEGER_32): INTEGER_32
effective function
make (v: V_, k: K_)
effective procedure
out_in_tagged_out_memory
effective procedure
left: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
writable attribute
right: AVL_DICTIONARY_NODE [V_, K_ -> 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_DICTIONARY_NODE [V_, K_ -> 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_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
effective function
Is element e in the tree?
set_item (i: E_)
effective procedure
set_left (l: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE])
effective procedure
set_right (r: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE])
effective procedure
set_balance (b: INTEGER_32)
effective procedure
rotate_right: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
effective function
Proceeds to some reorganisation and returns the upper node.
rotate_left: AVL_DICTIONARY_NODE [V_, K_ -> COMPARABLE]
effective function
Proceeds to some reorganisation and returns the upper node.
balanced: INTEGER_32
constant attribute
imbalanced_left: INTEGER_32
constant attribute
imbalanced_right: INTEGER_32
constant attribute