class BT_NODE{ KEY < $IS_LT{KEY}, ELT } < |
---|
$BT_NODE{_,_,_} | AREF{_} |
attr size : CARD ; |
---|
attr size : CARD ; |
---|
const Max_Size : CARD := 4 ; |
---|
const Min_Size : CARD := Max_Size / 2 ; |
---|
aclear .. Included as aclear |
---|
acopy(src : SAME) .. Included as acopy |
---|
acopy(beg : CARD, src : SAME) .. Included as acopy |
---|
acopy(beg, num : CARD, src : SAME) .. Included as acopy |
---|
acopy(beg, num, srcbeg : CARD, src : SAME) .. Included as acopy |
---|
aget(index : CARD) : ELT .. Included as aget |
---|
aget(index : INT) : ELT .. Included as aget |
---|
array_ptr : REFERENCE .. Included as array_ptr |
---|
asize : CARD .. Included as asize |
---|
create(cnt : CARD) : SAME .. Included as create |
---|
**** | This routine returns a new array with cnt elements. |
create( .. Included as create |
---|
create : SAME |
---|
find( .. Included as find |
---|
find_pred( .. Included as find_pred |
---|
is_eq( .. Included as is_eq |
---|
join_left( .. Included as join_left |
---|
join_right( .. Included as join_right |
---|
left_free( .. Included as left_free |
---|
left_spare( .. Included as left_spare |
---|
node_delete( .. Included as node_delete |
---|
node_insert( .. Included as node_insert |
---|
pull_left( .. Included as pull_left |
---|
pull_right( .. Included as pull_right |
---|
push_left( .. Included as push_left |
---|
push_right( .. Included as push_right |
---|
right_free( .. Included as right_free |
---|
right_spare( .. Included as right_spare |
---|
set_item( .. Included as set_item |
---|
set_node( .. Included as set_node |
---|
split( .. Included as split |
---|
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! : ELT .. Included as elt! |
---|
ind! : KEY .. Included as ind! |
---|
pair! : TUP{KEY,ELT} .. Included as pair! |
---|
aset(index : CARD, val : ELT) .. Included as aset |
---|
aset(index : INT, val:ELT) .. Included as aset |
---|
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. |