class FSET{T} < $COPY


Ancestors
$COPY AREF{_}



Public


Readable Attributes
attr use_map : BOOL ;
**** True if using space as a map

Features
aclear .. Included as aclear
acopy(beg, num, srcbeg : CARD, src : SAME) .. Included as acopy
acopy(beg, num : CARD, src : SAME) .. Included as acopy
acopy(beg : CARD, src : SAME) .. Included as acopy
acopy(src : SAME) .. Included as acopy
aget(index : CARD) : ELT .. Included as aget
aget(index : INT) : ELT .. Included as aget
array : ARRAY{ETP} .. Included as array
array_ptr : REFERENCE .. Included as array_ptr
aset(index : CARD, val : ELT) .. Included as aset
aset(index : INT, val:ELT) .. Included as aset
asize : CARD .. Included as asize
build( cursor : STR_CURSOR) : SAME .. Included as build
****
build(cursor : STR_CURSOR, start, finish : CHAR ) : SAME .. Included as build
changed_map( .. Included as changed_map
clear : SAME .. Included as clear
contains( .. Included as contains
copy : SAME .. Included as copy
count( .. Included as count
count_if( .. Included as count_if
create( .. Included as create
create( .. Included as create
create( str : STR ) : SAME .. Included as create
****
create(str : STR, sep : CHAR ) : SAME .. Included as create
****
create : SAME
create_from( .. Included as create_from
delete( .. Included as delete
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
first_elt : T .. Included as first_elt
get( .. Included as get
insert( .. Included as insert
inspect:STR .. Included as inspect
**** This routine returns a string representation of the contents of self. K.Kodama
intersection( .. Included as intersection
intersects( .. Included as intersects
is_disjoint_from( .. Included as is_disjoint_from
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( .. Included as is_subset
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
test( .. Included as test
to_diff( .. Included as to_diff
to_intersection( .. Included as to_intersection
to_sym_diff( .. Included as to_sym_diff
to_union( .. Included as to_union
union( .. Included as union

Iters
aelt!(once beg : CARD) : ELT .. Included as aelt!
aelt!(once beg, once num : CARD) : ELT .. Included as aelt!
aelt!(once beg,once num : CARD,once step : INT) : ELT .. Included as aelt!
aelt! : ELT .. Included as aelt!
aind! : CARD .. Included as aind!
aset!(val : ELT) .. Included as aset!
aset!(once beg : CARD,val : ELT) .. Included as aset!
aset!(once beg, once num : CARD, val : ELT) .. Included as aset!
aset!(once beg, once num : CARD, once step : INT,val : ELT) .. Included as aset!
elt! : T .. Included as elt!
filter!( .. Included as filter!
ind!:CARD
not_filter!( .. Included as not_filter!
unique! : ETP .. Included as unique!


Private

const Default_Array_Size : CARD := 5 ; .. Included as Default_Array_Size
const Max_Gap : CARD := (Over_Run / 3).next_exp2 * 2 + 1 ;
const Min_Elements : CARD := (Over_Run / 3).next_exp2 + 1 ;
const Over_Run : CARD := 50 ;
allocate( .. Included as allocate
build(cursor : STR_CURSOR, sep : CHAR_CODE, start : CHAR, finish : CHAR ) : SAME .. Included as build
const default_initial_size : CARD := 5 ;
****
delete_list( .. Included as delete_list
delete_map( .. Included as delete_map
double_size : SAME .. Included as double_size
for_all(first, second : SAME) : BOOL .. Included as for_all
****
__This_private_predicate_returns_true_if_and_only_if_all_elements_of
___first_and_second_are_the_same!
get_list( .. Included as get_list
get_map( .. Included as get_map
grow_if_necessary : SAME .. Included as grow_if_necessary
halve_size : SAME .. Included as halve_size
attr hsize : CARD ;
**** Number of stored entries
attr hsize : CARD ;
**** Number of stored entries
insert_hash( .. Included as insert_hash
insert_list( .. Included as insert_list
is_legal_aelts_arg(beg, num : CARD, step : INT) : BOOL .. Included as is_legal_aelts_arg
**** This predicate returns true if and only if the arguments are legal
___values_for_aelt_and_aset_iters_below.
const load_ratio : CARD := 4;
**** Allow at most 1/load_ratio full
not_too_many( .. Included as not_too_many
set_initial_structure .. Included as set_initial_structure
should_shrink : BOOL .. Included as should_shrink
switch_structure( .. Included as switch_structure
const switch_structures : BOOL := true ;
test_list( .. Included as test_list
test_map( .. Included as test_map
attr use_map : BOOL ;
**** True if using space as a map
const use_map_initially : BOOL := false ;

The Sather Home Page