+
Point of view
All features
class QUEUE [E_]
Summary
A Queue of elements of type E_.
Direct parents
Insert list: ANY, RING_ARRAY
Class invariant
Overview
Creation features
{ANY}
  • make
    Create an empty array.
  • with_capacity (needed_capacity: INTEGER_32)
    Create an empty array with capacity initialized at least to needed_capacity
{ANY}
Features
{}
{}
{ANY}
Modification:
{ANY}
Implementation of deferred:
{ANY}
{}
{ANY}
{RING_ARRAY}
Garbage collector tuning (very low-level):
{}
  • mark_native_arrays
    For performance reasons, the unused area of storage is always left as it is when some elements are removed.
Implement manifest generic creation (very low-level):
{}
Accessing:
{ANY}
Writing:
{ANY}
Adding:
{ANY}
Removing:
{ANY}
Looking and Searching:
{ANY}
Looking and comparison:
{ANY}
Other features:
{ANY}
Implement manifest generic creation:
{}
{ANY}
Other features:
{ANY}
Agent-based features:
{ANY}
Printing:
{ANY}
{ANY}
{}
Agent-based features:
{ANY}
{}
Indexing:
{ANY}
Accessing:
{ANY}
{ARRAYED_COLLECTION, ARRAYED_COLLECTION_HANDLER}
{ANY}
{ARRAYED_COLLECTION}
{}
make
effective procedure
{}
Create an empty array.
with_capacity (needed_capacity: INTEGER_32)
effective procedure
{}
Create an empty array with capacity initialized at least to needed_capacity
new_iterator: ITERATOR[E_]
effective function
{}
default_create
effective procedure
{}
Default creation method.
lower: INTEGER_32
writable attribute
{ANY}
Lower index bound
resize (min_index: INTEGER_32, max_index: INTEGER_32)
effective procedure
{ANY}
Resize to bounds min_index and max_index.
reindex (new_lower: INTEGER_32)
effective procedure
{ANY}
Change indexing to take in account the expected new_lower index.
count: INTEGER_32
effective function
{ANY}
Number of available items in the hoard.
is_empty: BOOLEAN
effective function
{ANY}
Is the hoard empty ?
See also count.
subarray (min: INTEGER_32, max: INTEGER_32): QUEUE [E_]
effective function
{ANY}
New collection consisting of items at indexes in [min .. max].
item (i: INTEGER_32): E_
effective function
{ANY}
Item at the corresponding index i.
put (element: E_, i: INTEGER_32)
effective procedure
{ANY}
Make element the item at index i.
force (element: E_, index: INTEGER_32)
effective procedure
{ANY}
Make element the item at index, enlarging the collection if necessary (new bounds except index are initialized with default values).
copy (other: QUEUE [E_])
effective procedure
{ANY}
Reinitialize by copying all the items of other.
set_all_with (v: E_)
effective procedure
{ANY}
Set all items with value v.
remove_first
effective procedure
{ANY}
Remove the first element of the collection.
remove_head (n: INTEGER_32)
effective procedure
{ANY}
Remove the n elements of the collection.
remove (index: INTEGER_32)
effective procedure
{ANY}
Remove the item at position index.
clear_count
effective procedure
{ANY}
Discard all items (is_empty is True after that call).
clear_count_and_capacity
effective procedure
{ANY}
Discard all items (is_empty is True after that call).
add_first (element: E_)
effective procedure
{ANY}
Add a new item in first position : count is increased by one and all other items are shifted right.
add_last (element: E_)
effective procedure
{ANY}
Add a new item at the end : count is increased by one.
from_collection (model: TRAVERSABLE[E_])
effective procedure
{ANY}
Initialize the current object with the contents of model.
all_default: BOOLEAN
effective function
{ANY}
Do all items have their type's default value?
occurrences (element: E_): INTEGER_32
effective function
{ANY}
Number of occurrences of element using is_equal for comparison.
fast_occurrences (element: E_): INTEGER_32
effective function
{ANY}
Number of occurrences of element using basic = for comparison.
first_index_of (element: E_): INTEGER_32
effective function
{ANY}
Give the index of the first occurrence of element using is_equal for comparison.
index_of (element: E_, start_index: INTEGER_32): INTEGER_32
effective function
{ANY}
Using is_equal for comparison, gives the index of the first occurrence of element at or after start_index.
reverse_index_of (element: E_, start_index: INTEGER_32): INTEGER_32
effective function
{ANY}
Using is_equal for comparison, gives the index of the first occurrence of element at or before start_index.
fast_first_index_of (element: E_): INTEGER_32
effective function
{ANY}
Give the index of the first occurrence of element using basic = for comparison.
fast_index_of (element: E_, start_index: INTEGER_32): INTEGER_32
effective function
{ANY}
Using basic = for comparison, gives the index of the first occurrence of element at or after start_index.
fast_reverse_index_of (element: E_, start_index: INTEGER_32): INTEGER_32
effective function
{ANY}
Using basic = comparison, gives the index of the first occurrence of element at or before start_index.
fast_is_equal (other: QUEUE [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower, upper, and items?
is_equal (other: QUEUE [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower, upper, and items?
slice (min: INTEGER_32, max: INTEGER_32): QUEUE [E_]
effective function
{ANY}
New collection consisting of items at indexes in [min..max].
first: E_
effective function
{ANY}
The very first item.
make_space_for_one
effective procedure
{}
Make sure storage is big enough to hold at least one more element.
clear_slice (min: INTEGER_32, max: INTEGER_32)
effective procedure
{}
squeeze_bubble (min: INTEGER_32, max: INTEGER_32, pos: INTEGER_32, length: INTEGER_32)
effective procedure
{}
unwrap
effective procedure
{}
to_external: POINTER
effective function
{ANY}
Gives C access into the internal storage of the ARRAY.
is_wrapped: BOOLEAN
effective function
{ANY}
storage_lower: INTEGER_32
writable attribute
Index of first in storage This would always be 0 for regular arrays.
storage_upper: INTEGER_32
effective function
Index of last in storage
storage_index (i: INTEGER_32): INTEGER_32
effective function
Index in storage corresponding to index i in Current
in_storage (index: INTEGER_32): BOOLEAN
effective function
wrap_point: INTEGER_32
effective function
Index in Current (seen as a COLLECTION) such that for any valid_indexes i and j, if i < wrap_point and j >= wrap_point then storage_index(i) > storage_index(j)
This can happen because of the circular nature of the array.
slices_are_equal (other: QUEUE [E_], wp: INTEGER_32, owp: INTEGER_32): BOOLEAN
effective function
slices_are_equal_map (other: QUEUE [E_], wp: INTEGER_32, owp: INTEGER_32): BOOLEAN
effective function
mark_native_arrays
effective procedure
{}
For performance reasons, the unused area of storage is always left as it is when some elements are removed.
manifest_make (needed_capacity: INTEGER_32, initial_lower: INTEGER_32)
effective procedure
{}
Manifest creation of a RING_ARRAY lower set to initial_lower.
manifest_put (index: INTEGER_32, element: E_)
effective procedure
{}
infix "@" (i: INTEGER_32): E_
frozen
effective function
{ANY}
The infix notation which is actually just a synonym for item.
swap (i1: INTEGER_32, i2: INTEGER_32)
effective procedure
{ANY}
Swap item at index i1 with item at index i2.
set_slice_with (v: ANY, lower_index: INTEGER_32, upper_index: INTEGER_32)
effective procedure
{ANY}
Set all items in range [lower_index .. upper_index] with v.
clear_all
effective procedure
{ANY}
Set every item to its default value.
add (element: ANY, index: INTEGER_32)
deferred procedure
{ANY}
Add a new element at rank index : count is increased by one and range [index .. upper] is shifted right by one position.
append_collection (other: COLLECTION[E_])
effective procedure
{ANY}
Append other to Current.
append_traversable (other: TRAVERSABLE[E_])
effective procedure
{ANY}
Append other to Current.
remove_last
deferred procedure
{ANY}
Remove the last item.
remove_tail (n: INTEGER_32)
deferred procedure
{ANY}
Remove the last n item(s).
has (x: ANY): BOOLEAN
effective function
{ANY}
Look for x using is_equal for comparison.
fast_has (x: ANY): BOOLEAN
effective function
{ANY}
Look for x using basic = for comparison.
last_index_of (element: ANY): INTEGER_32
effective function
{ANY}
Using is_equal for comparison, gives the index of the last occurrence of element at or before upper.
fast_last_index_of (element: ANY): INTEGER_32
effective function
{ANY}
Using basic = for comparison, gives the index of the last occurrence of element at or before upper.
is_equal_map (other: QUEUE [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower, upper, and items?
same_items (other: COLLECTION[E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same items?
replace_all (old_value: ANY, new_value: ANY)
deferred procedure
{ANY}
Replace all occurrences of the element old_value by new_value using is_equal for comparison.
fast_replace_all (old_value: ANY, new_value: ANY)
deferred procedure
{ANY}
Replace all occurrences of the element old_value by new_value using basic = for comparison.
move (lower_index: INTEGER_32, upper_index: INTEGER_32, distance: INTEGER_32)
effective procedure
{ANY}
Move range lower_index ..
reverse
deferred procedure
{ANY}
Reverse the order of the elements.
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
{}
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
{}
upper: INTEGER_32
deferred function
{ANY}
Maximum index.
valid_index (i: INTEGER_32): BOOLEAN
effective function
{ANY}
True when i is valid (i.e., inside actual bounds).
last: E_
deferred function
{ANY}
The last item.
storage: NATIVE_ARRAY[E_]
writable attribute
Internal access to storage location.
from_external (a_storage: POINTER, a_capacity: INTEGER_32)
effective procedure
capacity: INTEGER_32
writable attribute
{ANY}
Internal storage capacity in number of item.
set_upper (new_upper: INTEGER_32)
effective procedure
mark_item (native_array: NATIVE_ARRAY[E_], index: INTEGER_32)
{}
To be used _only_ inside the definition of mark_native_arrays.