class FLIST{ETP} < $FLISTS{ETP} |
---|
**** |
________This_class_implements_array_based_lists_of_elements_with_mutable ___semantics_-_by_inclusion_of_FLIST_IMPL. |
$FLISTS{_} | $LISTS{_} | $ARR{_} | $RO_ARR{_} | $CONTAINER{_} | $STR | $COPY | $FILTERS{_} | $ELT{_} | $ELT |
aget(index : CARD) : ETP .. Included as aget |
---|
append(list : SAME) : SAME .. Included as append |
---|
array : ARRAY{ETP} .. Included as array |
---|
array_ptr : REFERENCE .. Included as array_ptr |
---|
aset(index : CARD,val : ETP) .. Included as aset |
---|
build( cursor : STR_CURSOR) : SAME .. Included as build |
---|
**** |
build(cursor : STR_CURSOR, start, finish : CHAR ) : SAME .. Included as build |
---|
clear .. Included as clear |
---|
concat(list : SAME) : SAME .. Included as concat |
---|
contains(elem : ETP) : BOOL .. Included as contains |
---|
**** |
________This_predicate_returns_true_if_and_only_if_at_least_one_element_of ___self_is_equal_to_the_given_argument. |
copy : SAME .. Included as copy |
---|
count(elem : ETP) : CARD .. Included as count |
---|
**** |
________This_routine_returns_the_number_of_elements_of_the_list_which_are ___equal_to_elem. |
count_if( .. Included as count_if |
---|
create(arr : ARRAY{ETP}) : SAME .. Included as create |
---|
**** |
________This_creation_routine_produces_a_new_list_containing_the_elements_of_arr. This is useful when using array notation for specifying elements. |
create(cnt : CARD) : SAME .. Included as create |
---|
create( str : STR ) : SAME .. Included as create |
---|
**** |
create(str : STR, sep : CHAR ) : SAME .. Included as create |
---|
**** |
create : SAME .. Included as create |
---|
**** |
________This_is_the_variant_of_create_which_creates_a_'default'_size_list! |
create_empty_sized(cnt : CARD) : SAME .. Included as create_empty_sized |
---|
**** |
________This_routine_creates_a_sized_array_all_of_whose_elements_are_set ___to_the_value_elt_nil. |
create_from(container : $ELT{ETP}) : SAME .. Included as create_from |
---|
delete(index : CARD) .. Included as delete |
---|
delete(index : CARD) : SAME .. Included as delete |
---|
delete_elt(elem : ETP) .. Included as delete_elt |
---|
delete_elt(elem : ETP) : SAME .. Included as delete_elt |
---|
delete_elt_ordered(elem : ETP) .. Included as delete_elt_ordered |
---|
delete_elt_ordered(elem : ETP) : SAME .. Included as delete_elt_ordered |
---|
delete_ordered(index : CARD) .. Included as delete_ordered |
---|
delete_ordered(index : CARD) : SAME .. Included as delete_ordered |
---|
difference(list : SAME) : SAME .. Included as difference |
---|
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(other : $RO_ARR{ETP}) : BOOL .. Included as equals |
---|
**** |
________This_predicate_returns_true_if_and_only_if_all_of_the_elements_of ___other_have_the_same_value_as_the_corresponding_elements_of_self. |
every( .. Included as every |
---|
exists( .. Included as exists |
---|
exists( .. Included as exists |
---|
fill(elem : ETP) .. Included as fill |
---|
has_ind(index : CARD) : BOOL .. Included as has_ind |
---|
**** |
________This_predicate_returns_true_if_and_only_if_index_is_a_valid_index_for_the_list. |
index_of(elem : ETP) : CARD .. Included as index_of |
---|
inds : ARRAY{CARD} .. Included as inds |
---|
insert_after(index : CARD,val : ETP) : SAME .. Included as insert_after |
---|
insert_all_after(index : CARD,val : $CONTAINER{ETP}) : SAME .. Included as insert_all_after |
---|
insert_all_before(index : CARD,val : $CONTAINER{ETP}) : SAME .. Included as insert_all_before |
---|
insert_before(index : CARD,val : ETP) : SAME .. Included as insert_before |
---|
inspect:STR .. Included as inspect |
---|
**** | This routine returns a string representation of the contents of self. K.Kodama |
intersect(list : SAME) : SAME .. Included as intersect |
---|
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 |
---|
**** |
________This_predicate_returns_true_if_and_only_if_the_list_size_is_zero. |
is_full : BOOL .. Included as is_full |
---|
**** |
________This_predicate_returns_true_if_and_only_if_the_current_buffer_has ___no_more_free_space. |
not_every( .. Included as not_every |
---|
not_exists( .. Included as not_exists |
---|
acopy(beg, num, srcbeg : CARD, src : SAME) .. Included as oct_acopy |
---|
acopy(beg, num : CARD, src : SAME) .. Included as oct_acopy |
---|
acopy(beg : CARD, src : SAME) .. Included as oct_acopy |
---|
acopy(src : SAME) .. Included as oct_acopy |
---|
pop : ETP .. Included as pop |
---|
push(elem : ETP) : SAME .. Included as push |
---|
reset .. Included as reset |
---|
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. |
sublist(beg,num : CARD) : SAME .. Included as sublist |
---|
sym_difference(list : SAME) : SAME .. Included as sym_difference |
---|
to_reverse .. Included as to_reverse |
---|
top : ETP .. Included as top |
---|
union(list : SAME) : SAME .. Included as union |
---|
elt!(once beg : CARD) : ETP .. Included as elt! |
---|
elt!(once beg,once num : CARD) : ETP .. Included as elt! |
---|
elt!(once beg,once num : CARD,once step : INT) : ETP .. Included as elt! |
---|
elt! : ETP .. Included as elt! |
---|
filter!( .. Included as filter! |
---|
ind! : CARD .. Included as ind! |
---|
not_filter!( .. Included as not_filter! |
---|
set!(elem : ETP) .. Included as set! |
---|
unique! : ETP .. Included as unique! |
---|
const Default_Array_Size : CARD := 5 ; .. Included as Default_Array_Size |
---|
const Min_Size : CARD := 5 ; .. Included as Min_Size |
---|
aclear .. Included as aclear |
---|
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! |
---|
aget(index : CARD) : ELT .. Included as aref_aget |
---|
aget(index : INT) : ELT .. Included as aref_aget |
---|
aset(index : CARD, val : ELT) .. Included as aref_aset |
---|
aset(index : INT, val:ELT) .. Included as aref_aset |
---|
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! |
---|
asize : CARD .. Included as asize |
---|
build(cursor : STR_CURSOR, sep : CHAR_CODE, start : CHAR, finish : CHAR ) : SAME .. Included as build |
---|
expand_to_size(new_size : CARD) : SAME .. Included as expand_to_size |
---|
**** |
________This_private_routine_expands_the_list_space_so_that_the_result_has ___space_for_new_size_elements.__The_element_values_from_self_are_copied, ___loc_is_set_and_the_resulting_list_returned. |
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! |
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. |
is_legal_elts_arg(beg,num : CARD,step : INT) : BOOL .. Included as is_legal_elts_arg |
---|
**** |
________This_predicate_returns_true_if_and_only_if_the_three_parameters_form ___a_legal_value_for_use_in_the_following_iter. |
attr loc : CARD ; .. Included as loc |
---|
**** | index to insert next element. |
attr loc : CARD ; .. Included as loc |
---|
**** | index to insert next element. |
push_downward(from : CARD,by : CARD) .. Included as push_downward |
---|
push_if_new(elem : ETP) : SAME .. Included as push_if_new |
---|
valid_after_ind(index : CARD) : BOOL .. Included as valid_after_ind |
---|
**** |
________This_predicate_is_a_private_synonym_for_has_ind. |
valid_before_ind(index : CARD) : BOOL .. Included as valid_before_ind |
---|
**** |
________This_predicate_returns_true_if_and_only_if_the_given_index_is_within ___the_list_or_only_one_past_the_end_of_the_list. |