+
Point of view
All features
deferred class ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
Summary
top
Auxiliary class to implement AVL_DICTIONARY.
Direct parents
Inherit list: ANY_AVL_DICTIONARY_NODE, AVL_TREE_NODE
Known children
Inherit list: AVL_DICTIONARY_NODE, EXT_AVL_DICTIONARY_NODE
Overview
top
Features
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
{ABSTRACT_AVL_DICTIONARY_NODE}
{ABSTRACT_AVL_DICTIONARY}
{RECYCLING_POOL}
  • recycle
    Do whatever needs to be done to free resources or recycle other objects when recycling this one
{ANY}
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
Rotations:
{AVL_TREE}
  • rotate_right: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
    Proceeds to some reorganisation and returns the upper node.
  • rotate_left: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
    Proceeds to some reorganisation and returns the upper node.
{}
  • ordered (e1: E_, e2: E_): BOOLEAN
    True if [e1, e2] is a correctly ordered sequence; usually, e1 < e2
{}
safe_equal_value: SAFE_EQUAL[V_]
writable attribute
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
value: V_
writable attribute
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
set_value (v: V_)
effective procedure
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
ensure
fast_at (k: ANY): ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
effective function
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
Is element e in the tree?
occurrences (v: V_): INTEGER_32
effective function
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
fast_occurrences (v: V_): INTEGER_32
effective function
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
key_at (v: V_): K_
effective function
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
fast_key_at (v: V_): K_
effective function
{ABSTRACT_AVL_DICTIONARY, ABSTRACT_AVL_DICTIONARY_NODE, ITERATOR_ON_AVL_DICTIONARY_ITEMS, ITERATOR_ON_AVL_DICTIONARY}
top
occurrences_ (v: V_, cnt: INTEGER_32): INTEGER_32
effective function
{ABSTRACT_AVL_DICTIONARY_NODE}
top
ensure
  • Result >= cnt
fast_occurrences_ (v: V_, cnt: INTEGER_32): INTEGER_32
effective function
{ABSTRACT_AVL_DICTIONARY_NODE}
top
ensure
  • Result >= cnt
set (v: V_, k: ANY)
effective procedure
{ABSTRACT_AVL_DICTIONARY}
top
ensure
recycle
effective procedure
{RECYCLING_POOL}
top
Do whatever needs to be done to free resources or recycle other objects when recycling this one
out_in_tagged_out_memory
effective procedure
{ANY}
top
require
    • locked: tagged_out_locked
    • locked: tagged_out_locked
ensure
  • still_locked: tagged_out_locked
  • 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))
safe_equal: SAFE_EQUAL[E_]
writable attribute
{ANY}
top
left: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
writable attribute
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
right: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
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[ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
require
  • map /= Void
ensure
  • map.count = old map.count + count
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?
ensure
  • Result implies count > 0
at (e: E_): ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
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
require ensure
set_left (l: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
require ensure
set_right (r: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_])
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
require ensure
set_balance (b: INTEGER_32)
effective procedure
{AVL_TREE_NODE, AVL_TREE, AVL_TREE_ITERATOR}
top
ensure
rotate_right: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
effective function
{AVL_TREE}
top
Proceeds to some reorganisation and returns the upper node.
ensure
  • Result /= Void
rotate_left: ABSTRACT_AVL_DICTIONARY_NODE [V_, K_]
effective function
{AVL_TREE}
top
Proceeds to some reorganisation and returns the upper node.
ensure
  • Result /= Void
ordered (e1: E_, e2: E_): BOOLEAN
deferred function
{}
top
True if [e1, e2] is a correctly ordered sequence; usually, e1 < e2
require
  • e1 /= Void
  • e2 /= Void
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