+
Point of view
All features
deferred class SET [E_]
Summary
Definition of a mathematical set of objects. All common operations on mathematical sets are available.
Well known implementations are HASHED_SET and AVL_SET.
Direct parents
Inherit list: TRAVERSABLE
Insert list: SAFE_EQUAL
Known children
Inherit list: ABSTRACT_AVL_SET, ABSTRACT_HASHED_SET
Overview
Features
Counting:
{ANY}
{ANY}
Add new item e to the set.
Same job as add, but uses basic = for comparison.
• 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.
• clear_count
Empty the current set (is_empty is True after that call).
• clear_count_and_capacity
Empty the current set (is_empty is True after that call).
Looking and searching:
{ANY}
To provide iterating facilities:
{ANY}
Mathematical operations:
{ANY}
• union (other: SET [E_])
Make the union of the Current set with other.
• fast_union (other: SET [E_])
Make the union of the Current set with other.
• infix "+" (other: SET [E_]): SET [E_]
Return the union of the Current set with other.
• intersection (other: SET [E_])
Make the intersection of the Current set with other.
• fast_intersection (other: SET [E_])
Make the intersection of the Current set with other.
• infix "^" (other: SET [E_]): SET [E_]
Return the intersection of the Current set with other.
• minus (other: SET [E_])
Make the set Current - other.
• fast_minus (other: SET [E_])
Make the set Current - other.
• infix "-" (other: SET [E_]): SET [E_]
Return the set Current - other.
Comparison:
{ANY}
{ANY}
• copy (other: SET [E_])
Copy 'other' into the current set
• from_collection (model: TRAVERSABLE[E_])
{}
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.
is_empty: BOOLEAN
effective function
{ANY}
Is the set empty?
deferred procedure
{ANY}
Add new item e to the set.
deferred procedure
{ANY}
Same job as add, but uses basic = for comparison.
remove (e: E_)
deferred procedure
{ANY}
Remove item e from the set: the mathematical definition of removing from a set is followed.
fast_remove (e: E_)
deferred procedure
{ANY}
Same job as remove, but uses basic = for comparison.
clear_count
deferred procedure
{ANY}
Empty the current set (is_empty is True after that call).
clear_count_and_capacity
deferred procedure
{ANY}
Empty the current set (is_empty is True after that call).
has (e: E_): BOOLEAN
deferred function
{ANY}
Is element e in the set?
fast_has (e: E_): BOOLEAN
deferred function
{ANY}
Is element e actually stored in the set?
reference_at (e: E_): E_
deferred function
{ANY}
Non Void when e is in the set.
lower: INTEGER_32
is 1
constant attribute
{ANY}
Minimum index.
upper: INTEGER_32
effective function
{ANY}
Maximum index.
item (index: INTEGER_32): E_
deferred function
{ANY}
Item at the corresponding index i.
first: E_
effective function
{ANY}
The very first item.
last: E_
effective function
{ANY}
The last item.
new_iterator: ITERATOR[E_]
effective function
{ANY}
union (other: SET [E_])
effective procedure
{ANY}
Make the union of the Current set with other.
fast_union (other: SET [E_])
effective procedure
{ANY}
Make the union of the Current set with other.
infix "+" (other: SET [E_]): SET [E_]
effective function
{ANY}
Return the union of the Current set with other.
intersection (other: SET [E_])
effective procedure
{ANY}
Make the intersection of the Current set with other.
fast_intersection (other: SET [E_])
effective procedure
{ANY}
Make the intersection of the Current set with other.
infix "^" (other: SET [E_]): SET [E_]
effective function
{ANY}
Return the intersection of the Current set with other.
minus (other: SET [E_])
effective procedure
{ANY}
Make the set Current - other.
fast_minus (other: SET [E_])
effective procedure
{ANY}
Make the set Current - other.
infix "-" (other: SET [E_]): SET [E_]
effective function
{ANY}
Return the set Current - other.
is_subset_of (other: SET [E_]): BOOLEAN
effective function
{ANY}
Is the Current set a subset of other?
is_disjoint_from (other: SET [E_]): BOOLEAN
effective function
{ANY}
Is the Current set disjoint from other ?
is_equal (other: SET [E_]): BOOLEAN
effective function
{ANY}
Is the Current set equal to other?
copy (other: SET [E_])
effective procedure
{ANY}
Copy 'other' into the current set
from_collection (model: TRAVERSABLE[E_])
effective procedure
{ANY}
make
deferred procedure
{}
Creation of an empty SET.
manifest_make (needed_capacity: INTEGER_32)
effective procedure
{}
Manifest creation of a SET.
manifest_put (index: INTEGER_32, element: E_)
effective procedure
{}
manifest_semicolon_check: BOOLEAN
is False
constant attribute
{}
enumerate: ENUMERATE[E_]
effective function
{ANY}
get_new_iterator: ITERATOR[E_]
frozen
effective function
{ANY}
for_each (action: PROCEDURE[TUPLE[TUPLE 1[E_]]])
effective procedure
{ANY}
Apply action to every item of Current.
for_all (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
Do all items satisfy test?
exists (test: FUNCTION[TUPLE[TUPLE 1[E_]]]): BOOLEAN
effective function
{ANY}
Does at least one item satisfy test?
aggregate (action: FUNCTION[TUPLE[TUPLE 2[E_, E_], E_]], initial: E_): E_
effective function
{ANY}
Aggregate all the elements starting from the initial value.
out_in_tagged_out_memory
effective procedure
{ANY}
Append terse printable representation of current object in tagged_out_memory.
generation: INTEGER_32
writable attribute
{ANY}
next_generation
effective procedure
{}
count: INTEGER_32
deferred function
{ANY}
Number of available items in the hoard.
do_all (action: ROUTINE[TUPLE[TUPLE 1[E_]]])
frozen
effective procedure
{ANY}
Apply action to every item of Current.
_inline_agent1 (a: ROUTINE[TUPLE[TUPLE 1[E_]]], e: E_)
frozen
effective procedure
{}
valid_index (i: INTEGER_32): BOOLEAN
effective function
{ANY}
True when i is valid (i.e., inside actual bounds).
test (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
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}
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.