+
Point of view
All features
class AVL_SET [E_ -> COMPARABLE]
Summary
top
Direct parents
Inherit list: ABSTRACT_AVL_SET
Class invariant
top
Overview
top
Creation features
Features
{}
  • ordered (e1: E_, e2: E_): BOOLEAN
    True if [e1, e2] is a correctly ordered sequence; usually, e1 < e2
  • a_new_node: AVL_SET_NODE[E_]
{ANY}
{}
{}
Counting:
{ANY}
Adding and removing:
{ANY}
  • remove (e: E_)
    Remove item e from the set: the mathematical definition of removing from a set is followed.
  • fast_remove (e: E_)
    Same job as remove, but uses basic = for comparison.
Looking and searching:
{ANY}
To provide iterating facilities:
{ANY}
Mathematical operations:
{ANY}
Comparison:
{ANY}
{ANY}
  • copy (other: AVL_SET [E_ -> COMPARABLE])
    Copy 'other' into the current set
  • from_collection (model: TRAVERSABLE[E_])
    Add all items of model.
Implement manifest generic creation:
{}
{ANY}
Other features:
{ANY}
Agent-based features:
{ANY}
Printing:
{ANY}
{ANY}
{}
Counting:
{ANY}
Agent-based features:
{ANY}
{}
Indexing:
{ANY}
{ANY}
  • test (e1: E_, e2: E_): BOOLEAN
    In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
  • safe_equal (e1: E_, e2: E_): BOOLEAN
    In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
{ANY}
{}
Iterating internals:
{}
  • build_map
  • map: FAST_ARRAY[AVL_TREE_NODE[E_]]
    Elements in a row for iteration.
  • map_dirty: BOOLEAN
    True when the map needs to be built again for the iterators.
{}
{}
ordered (e1: E_, e2: E_): BOOLEAN
effective function
{}
top
True if [e1, e2] is a correctly ordered sequence; usually, e1 < e2
a_new_node: AVL_SET_NODE[E_]
effective function
{}
top
new_iterator: ITERATOR[E_]
effective function
{ANY}
top
add (e: E_)
effective procedure
{ANY}
top
Add new item e to the set.
fast_add (e: E_)
effective procedure
{ANY}
top
Same job as add, but uses basic = for comparison.
clear_count
effective procedure
{ANY}
top
Empty the current set (is_empty is True after that call).
clear_count_and_capacity
effective procedure
{ANY}
top
Empty the current set (is_empty is True after that call).
reference_at (e: E_): E_
effective function
{ANY}
top
Non Void when e is in the set.
item (index: INTEGER_32): E_
effective function
{ANY}
top
Item at the corresponding index i.
set_item (n: ABSTRACT_AVL_SET_NODE[E_])
effective procedure
{}
top
set_value (n: ABSTRACT_AVL_SET_NODE[E_])
effective procedure
{}
top
exchange_and_discard (n1: ABSTRACT_AVL_SET_NODE[E_], n2: ABSTRACT_AVL_SET_NODE[E_])
effective procedure
{}
top
make
effective procedure
{}
top
Creation of an empty SET.
is_empty: BOOLEAN
effective function
{ANY}
top
Is the set empty?
remove (e: E_)
deferred procedure
{ANY}
top
Remove item e from the set: the mathematical definition of removing from a set is followed.
fast_remove (e: E_)
deferred procedure
{ANY}
top
Same job as remove, but uses basic = for comparison.
has (e: E_): BOOLEAN
deferred function
{ANY}
top
Is element e in the set?
fast_has (e: E_): BOOLEAN
deferred function
{ANY}
top
Is element e actually stored in the set?
lower: INTEGER_32
is 1
constant attribute
{ANY}
top
Minimum index.
upper: INTEGER_32
effective function
{ANY}
top
Maximum index.
first: E_
effective function
{ANY}
top
The very first item.
last: E_
effective function
{ANY}
top
The last item.
union (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the union of the Current set with other.
fast_union (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the union of the Current set with other.
infix "+" (other: AVL_SET [E_ -> COMPARABLE]): AVL_SET [E_ -> COMPARABLE]
effective function
{ANY}
top
Return the union of the Current set with other.
intersection (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the intersection of the Current set with other.
fast_intersection (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the intersection of the Current set with other.
infix "^" (other: AVL_SET [E_ -> COMPARABLE]): AVL_SET [E_ -> COMPARABLE]
effective function
{ANY}
top
Return the intersection of the Current set with other.
minus (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the set Current - other.
fast_minus (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Make the set Current - other.
infix "-" (other: AVL_SET [E_ -> COMPARABLE]): AVL_SET [E_ -> COMPARABLE]
effective function
{ANY}
top
Return the set Current - other.
is_subset_of (other: AVL_SET [E_ -> COMPARABLE]): BOOLEAN
effective function
{ANY}
top
Is the Current set a subset of other?
is_disjoint_from (other: AVL_SET [E_ -> COMPARABLE]): BOOLEAN
effective function
{ANY}
top
Is the Current set disjoint from other ?
is_equal (other: AVL_SET [E_ -> COMPARABLE]): BOOLEAN
effective function
{ANY}
top
Is the Current set equal to other?
copy (other: AVL_SET [E_ -> COMPARABLE])
effective procedure
{ANY}
top
Copy 'other' into the current set
from_collection (model: TRAVERSABLE[E_])
effective procedure
{ANY}
top
Add all items of model.
manifest_make (needed_capacity: INTEGER_32)
effective procedure
{}
top
Manifest creation of a SET.
manifest_put (index: INTEGER_32, element: E_)
effective procedure
{}
top
manifest_semicolon_check: BOOLEAN
is False
constant attribute
{}
top
enumerate: ENUMERATE[E_]
effective function
{ANY}
top
get_new_iterator: ITERATOR[E_]
frozen
effective function
{ANY}
top
for_each (action: PROCEDURE[TUPLE[TUPLE 1[E_]]])
effective procedure
{ANY}
top
Apply action to every item of Current.
for_all (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
top
Do all items satisfy test?
exists (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
top
Does at least one item satisfy test?
aggregate (action: FUNCTION[TUPLE[TUPLE 2[E_, E_], E_]], initial: E_): E_
effective function
{ANY}
top
Aggregate all the elements starting from the initial value.
out_in_tagged_out_memory
effective procedure
{ANY}
top
Append terse printable representation of current object in tagged_out_memory.
generation: INTEGER_32
writable attribute
{ANY}
top
next_generation
effective procedure
{}
top
count: INTEGER_32
deferred function
{ANY}
top
Number of available items in the hoard.
do_all (action: ROUTINE[TUPLE[TUPLE 1[E_]]])
frozen
effective procedure
{ANY}
top
Apply action to every item of Current.
_inline_agent1 (a: ROUTINE[TUPLE[TUPLE 1[E_]]], e: E_)
frozen
effective procedure
{}
top
valid_index (i: INTEGER_32): BOOLEAN
effective function
{ANY}
top
True when i is valid (i.e., inside actual bounds).
test (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
top
In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
safe_equal (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
top
In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
debug_string: STRING
effective function
{ANY}
top
root: AVL_TREE_NODE[E_]
writable attribute
{}
top
rebalance: BOOLEAN
writable attribute
{}
top
item_memory: E_
writable attribute
{}
top
set_value_and_key (n: AVL_TREE_NODE[E_])
deferred procedure
{}
top
fast_do_insert (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
do_insert (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
left_grown (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
right_grown (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
fast_do_remove (n: AVL_TREE_NODE[E_], e: E_): AVL_TREE_NODE[E_]
effective function
{}
top
do_remove (n: AVL_TREE_NODE[E_], e: E_): AVL_TREE_NODE[E_]
effective function
{}
top
remove_right (n1: AVL_TREE_NODE[E_], n2: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
left_shrunk (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
right_shrunk (n: AVL_TREE_NODE[E_]): AVL_TREE_NODE[E_]
effective function
{}
top
clear_nodes (node: AVL_TREE_NODE[E_])
effective procedure
{}
top
node_height (node: AVL_TREE_NODE[E_]): INTEGER_32
effective function
{}
top
build_map
effective procedure
{}
top
map: FAST_ARRAY[AVL_TREE_NODE[E_]]
writable attribute
{}
top
Elements in a row for iteration.
map_dirty: BOOLEAN
writable attribute
{}
top
True when the map needs to be built again for the iterators.
new_node: AVL_TREE_NODE[E_]
effective function
{}
top
discard_node (n: AVL_TREE_NODE[E_])
effective procedure
{}
top
lost_nodes: RECYCLING_POOL[AVL_TREE_NODE[E_]]
effective function
{}
top
lost_nodes_memory: RECYCLING_POOL[AVL_TREE_NODE[E_]]
writable attribute
{}
top
once function
{}
top
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