partial class RO_SET_INCL{ELT} < $RO_SET{ELT} |
---|
$RO_SET{_} | $RO_BAG{_} | $CONTAINER{_} | $STR | $COPY | $FILTERS{_} | $ELT{_} | $ELT |
VSET{_} | SET_INCL{_} | SET{_} |
add( .. Included as add |
---|
array : ARRAY{ELT} .. Included as array |
---|
build( cursor : STR_CURSOR) : SAME .. Included as build |
---|
**** |
build(cursor : STR_CURSOR, start, finish : CHAR ) : SAME .. Included as build |
---|
concat( .. Included as concat |
---|
stub copy : SAME ; |
---|
count( .. Included as count |
---|
count_if( .. Included as count_if |
---|
create( .. Included as create |
---|
create( str : STR ) : SAME .. Included as create |
---|
**** |
create(str : STR, sep : CHAR ) : SAME .. Included as create |
---|
**** |
create( |
---|
stub create : SAME ; |
---|
stub delete( |
---|
delete_all( .. Included as delete_all |
---|
diff( .. Included as diff |
---|
elt_eq(first,second : ETP) : BOOL .. Included as elt_eq |
---|
**** | This is the standard 'less than' predicate used in sorting routines.
___The_using_class_must_specify_an_equality_predicate_routine. |
elt_hash(elem : $OB) : CARD .. Included as elt_hash |
---|
**** |
________This_routine_returns_a_hash_value_associated_with_an_element._This ___must_have_the_property_that_if_"elt_eq(first,second)"_then ___"elt_hash(first)=elt_hash(second)"._It_could_be_defined_always_to_return_0, ___but_many_routines_will_then_become_quadratic._This_uses_the_object_"id"_by ___default.___It_may_be_redefined_in_descendants. |
elt_lt(first,second : ETP) : BOOL .. Included as elt_lt |
---|
**** |
________This_routine_is_the_standard_predicate_'less_than'_for_use_in ___sorting.___By_default_the_object_identity_components_are_compared. ___It_may_be_redefined_in_descendants. |
elt_nil : ETP .. Included as elt_nil |
---|
**** |
________This_routine_returns_the_NIL_value.___If_the_element_class_is_a ___subclass_of_$NIL_then_it_returns_nil,_otherwise_void. |
equals( .. Included as equals |
---|
every( .. Included as every |
---|
exists( .. Included as exists |
---|
exists( .. Included as exists |
---|
stub insert( |
---|
inspect:STR .. Included as inspect |
---|
**** | This routine returns a string representation of the contents of self. K.Kodama |
intersection( .. Included as intersection |
---|
intersection( .. Included as intersection |
---|
is_elt_nil( elem : ETP) : BOOL .. Included as is_elt_nil |
---|
**** | This predicate returns true if and only if elem is NIL. |
is_empty : BOOL .. Included as is_empty |
---|
is_subset_of( .. Included as is_subset_of |
---|
n_unique : CARD .. Included as n_unique |
---|
not_every( .. Included as not_every |
---|
not_exists( .. Included as not_exists |
---|
size : CARD .. Included as size |
---|
str( lib : LIBCHARS ) : STR .. Included as str |
---|
str(lib : LIBCHARS, sep : CHAR ) : STR .. Included as str |
---|
str : STR .. Included as str |
---|
**** |
__This_routine_returns_a_string_representation_of_the_contents_of_self __in_the_default_repertoire_and_encoding. |
sym_diff( .. Included as sym_diff |
---|
union( .. Included as union |
---|
union( .. Included as union |
---|
stub elt! : ELT ; |
---|
filter!( .. Included as filter! |
---|
not_filter!( .. Included as not_filter! |
---|
unique! : ETP .. Included as unique! |
---|
const Default_Array_Size : CARD := 5 ; .. Included as Default_Array_Size |
---|
build(cursor : STR_CURSOR, sep : CHAR_CODE, start : CHAR, finish : CHAR ) : SAME .. Included as build |
---|