+
Point of view
All features
deferred class COLLECTION3 [E_]
Summary
Abstract definition of a 3 dimensional collection of elements of type E_.
The Liberty Eiffel standard library provides two implementations of COLLECTION3: ARRAY3 and FIXED_ARRAY3. All implementations have exactly the same behavior. Switching from one implementation to another only change the memory used and the execution time.
Direct parents
Insert list: SAFE_EQUAL
Known children
Inherit list: ARRAY3, FAST_ARRAY3
Overview
Features
Indexing:
{ANY}
Reading:
{ANY}
Writing:
{ANY}
Index validity:
{ANY}
Counting:
{ANY}
{ANY}
Creating or initializing:
{ANY}
  • from_collection3 (model: COLLECTION3[E_])
    Uses model to initialize Current.
  • from_model (model: COLLECTION[COLLECTION[COLLECTION[E_]]])
    The model is used to fill line by line Current.
Looking and comparison:
{ANY}
Printing:
{ANY}
Miscellaneous features:
{ANY}
{ANY}
  • test (e1: E_, e2: E_): BOOLEAN
    In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
  • safe_equal (e1: E_, e2: E_): BOOLEAN
    In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
lower1: INTEGER_32
deferred function
{ANY}
Lower index bound for dimension 1.
lower2: INTEGER_32
deferred function
{ANY}
Lower index bound for dimension 2.
lower3: INTEGER_32
deferred function
{ANY}
Lower index bound for dimension 3.
line_minimum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of lower1.
column_minimum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of lower2.
depth_minimum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of lower3.
upper1: INTEGER_32
deferred function
{ANY}
Upper index bound for dimension 1.
upper2: INTEGER_32
deferred function
{ANY}
Upper index bound for dimension 2.
upper3: INTEGER_32
deferred function
{ANY}
Upper index bound for dimension 3.
line_maximum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of upper1.
column_maximum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of upper2.
depth_maximum: INTEGER_32
frozen
effective function
{ANY}
Equivalent of upper3.
item (line: INTEGER_32, column: INTEGER_32, depth: INTEGER_32): E_
deferred function
{ANY}
put (element: E_, line: INTEGER_32, column: INTEGER_32, depth: INTEGER_32) assign item
deferred procedure
{ANY}
force (element: E_, line: INTEGER_32, column: INTEGER_32, depth: INTEGER_32)
deferred procedure
{ANY}
Put element at position (line,column,depth).
valid_line (line: INTEGER_32): BOOLEAN
frozen
effective function
{ANY}
valid_index1 (line: INTEGER_32): BOOLEAN
effective function
{ANY}
valid_column (column: INTEGER_32): BOOLEAN
frozen
effective function
{ANY}
valid_index2 (column: INTEGER_32): BOOLEAN
effective function
{ANY}
valid_depth (depth: INTEGER_32): BOOLEAN
frozen
effective function
{ANY}
valid_index3 (depth: INTEGER_32): BOOLEAN
effective function
{ANY}
valid_index (line: INTEGER_32, column: INTEGER_32, depth: INTEGER_32): BOOLEAN
frozen
effective function
{ANY}
count1: INTEGER_32
deferred function
{ANY}
Size of the first dimension.
line_count: INTEGER_32
frozen
effective function
{ANY}
Equivalent of count1.
count2: INTEGER_32
deferred function
{ANY}
Size of the second dimension.
column_count: INTEGER_32
frozen
effective function
{ANY}
count3: INTEGER_32
deferred function
{ANY}
Size of the third dimension.
depth_count: INTEGER_32
frozen
effective function
{ANY}
count: INTEGER_32
deferred function
{ANY}
Total number of elements.
swap (line1: INTEGER_32, column1: INTEGER_32, depth1: INTEGER_32, line2: INTEGER_32, column2: INTEGER_32, depth2: INTEGER_32)
deferred procedure
{ANY}
Swap the element at index (line1,column1,depth1) with the element at index (line2,column2,depth2).
set_all_with (v: E_)
deferred procedure
{ANY}
Set all item with value v.
clear_all
frozen
effective procedure
{ANY}
Set all items to default values.
from_collection3 (model: COLLECTION3[E_])
deferred procedure
{ANY}
Uses model to initialize Current.
from_model (model: COLLECTION[COLLECTION[COLLECTION[E_]]])
deferred procedure
{ANY}
The model is used to fill line by line Current.
all_default: BOOLEAN
deferred function
{ANY}
Do all items have their type's default value?
fast_is_equal (other: COLLECTION3 [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower1, lower2, lower3, upper1, upper2 and upper3, and items?
is_equal (other: COLLECTION3 [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower1, lower2, lower3, upper1, upper2 and upper3, and items?
is_equal_map (other: COLLECTION3 [E_]): BOOLEAN
effective function
{ANY}
Do both collections have the same lower, upper, and items?
fill_tagged_out_memory
frozen
effective procedure
{ANY}
Append a viewable information in tagged_out_memory in order to affect the behavior of out, tagged_out, etc.
occurrences (elt: E_): INTEGER_32
deferred function
{ANY}
Number of occurrences using is_equal.
fast_occurrences (elt: E_): INTEGER_32
deferred function
{ANY}
Number of occurrences using =.
has (x: E_): BOOLEAN
deferred function
{ANY}
Search if a element x is in the array using is_equal.
fast_has (x: E_): BOOLEAN
deferred function
{ANY}
Search if a element x is in the array using =.
replace_all (old_value: E_, new_value: E_)
deferred procedure
{ANY}
Replace all occurrences of the element old_value by new_value using is_equal for comparison.
fast_replace_all (old_value: E_, new_value: E_)
deferred procedure
{ANY}
Replace all occurrences of the element old_value by new_value using operator = for comparison.
sub_collection3 (line_min: INTEGER_32, line_max: INTEGER_32, column_min: INTEGER_32, column_max: INTEGER_32, depth_min: INTEGER_32, depth_max: INTEGER_32): COLLECTION3 [E_]
deferred function
{ANY}
Create a new object using selected area of Current.
set_area (element: E_, line_min: INTEGER_32, line_max: INTEGER_32, column_min: INTEGER_32, column_max: INTEGER_32, depth_min: INTEGER_32, depth_max: INTEGER_32)
effective procedure
{ANY}
Set all the elements of the selected area rectangle with element.
test (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.
safe_equal (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
In order to avoid run-time type errors, feature safe_equal calls is_equal only when e1 and e2 have exactly the same dynamic type.