+
Point of view
All features
expanded class NATIVE_ARRAY [E_]
Summary
top
This class gives access to the lowest level for arrays. As any low level array, you can get high performances with NATIVE_ARRAYs, but you loose most valid bounds checks (as you can do in plain C code for example).
Note: this class is the basic support for most of our high-level arrays-like classes: STRING, ARRAY, FAST_ARRAY as well as MUTABLE_BIG_INTEGER. Each class using some attribute of some NATIVE_ARRAY type needs an attribute named capacity with value set to the size of the actual NATIVE_ARRAY. Value has to be adjusted after each calloc/realloc/create_from.
Direct parents
Insert list: SAFE_EQUAL
Overview
top
Creation features
Features
Basic features:
{ANY}
{ANY}
Comparison:
{ANY}
Searching:
{ANY}
Removing:
{ANY}
Replacing:
{ANY}
  • replace_all (old_value: E_, new_value: E_, upper: INTEGER_32)
    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_, upper: INTEGER_32)
    Replace all occurrences of the element old_value by new_value using basic = for comparison.
Adding:
{ANY}
  • copy_at (at: INTEGER_32, src: NATIVE_ARRAY [E_], src_capacity: INTEGER_32)
    Copy range [0 .. src_capacity - 1] of src to range [at .. at + src_capacity - 1] of Current.
  • slice_copy (at: INTEGER_32, src: NATIVE_ARRAY [E_], src_min: INTEGER_32, src_max: INTEGER_32)
    Copy range [src_min .. src_max] of src to range [at .. at + src_max - src_min] of Current.
Other:
{ANY}
Interfacing with other languages:
{ANY}
Implement manifest generic creation.
{}
{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.
element_sizeof: INTEGER_32
{ANY}
top
The size in number of bytes for type E_.
calloc (nb_elements: INTEGER_32): NATIVE_ARRAY [E_]
{ANY}
top
Allocate a new array of nb_elements of type E_.
item (index: INTEGER_32): E_
{ANY}
top
To read an item.
put (element: E_, index: INTEGER_32)
{ANY}
top
To write an item.
realloc (old_nb_elts: INTEGER_32, new_nb_elts: INTEGER_32): NATIVE_ARRAY [E_]
effective function
{ANY}
top
Assume Current is a valid NATIVE_ARRAY in range [0 .. old_nb_elts-1].
memcmp (other: NATIVE_ARRAY [E_], capacity: INTEGER_32): BOOLEAN
effective function
{ANY}
top
True if all elements in range [0 .. capacity-1] are identical using is_equal.
slice_memcmp (at: INTEGER_32, other: NATIVE_ARRAY [E_], other_lower: INTEGER_32, other_upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
True if all elements in range [0 .. other_upper - other_lower] are identical to the elements in range [other_lower .. other_upper] of other using is_equal.
fast_memcmp (other: NATIVE_ARRAY [E_], capacity: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Same jobs as memcmp but uses infix "=" instead of is_equal.
slice_fast_memcmp (at: INTEGER_32, other: NATIVE_ARRAY [E_], other_lower: INTEGER_32, other_upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Same jobs as slice_memcmp but uses infix "=" instead of is_equal.
deep_memcmp (other: NATIVE_ARRAY [E_], capacity: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Same jobs as memcmp but uses is_deep_equal instead of is_equal.
slice_deep_memcmp (at: INTEGER_32, other: NATIVE_ARRAY [E_], other_lower: INTEGER_32, other_upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Same jobs as slice_memcmp but uses is_deep_equal instead of is_equal.
first_index_of (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using is_equal for comparison, gives the index of the first occurrence of element at or after 0.
index_of (element: E_, start_index: INTEGER_32, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using is_equal for comparison, gives the index of the first occurrence of element at or after start_index.
reverse_index_of (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using is_equal for comparison, gives the index of the first occurrence of element at or before upper.
fast_index_of (element: E_, start_index: INTEGER_32, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using basic = for comparison, gives the index of the first occurrence of element at or after start_index.
fast_reverse_index_of (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using basic = for comparison, gives the index of the first occurrence of element at or before upper.
fast_first_index_of (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Using basic = for comparison, gives the index of the first occurrence of element at or after 0.
has (element: E_, upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Look for element using is_equal for comparison.
slice_has (element: E_, lower: INTEGER_32, upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Look for element using is_equal for comparison.
fast_has (element: E_, upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Look for element using basic = for comparison.
slice_fast_has (element: E_, lower: INTEGER_32, upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Look for element using is_equal for comparison.
remove_first (upper: INTEGER_32)
effective procedure
{ANY}
top
Assume upper is a valid index.
remove (index: INTEGER_32, upper: INTEGER_32)
effective procedure
{ANY}
top
Assume upper is a valid index.
replace_all (old_value: E_, new_value: E_, upper: INTEGER_32)
effective procedure
{ANY}
top
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_, upper: INTEGER_32)
effective procedure
{ANY}
top
Replace all occurrences of the element old_value by new_value using basic = for comparison.
copy_at (at: INTEGER_32, src: NATIVE_ARRAY [E_], src_capacity: INTEGER_32)
effective procedure
{ANY}
top
Copy range [0 .. src_capacity - 1] of src to range [at .. at + src_capacity - 1] of Current.
slice_copy (at: INTEGER_32, src: NATIVE_ARRAY [E_], src_min: INTEGER_32, src_max: INTEGER_32)
{ANY}
top
Copy range [src_min .. src_max] of src to range [at .. at + src_max - src_min] of Current.
set_all_with (v: E_, upper: INTEGER_32)
effective procedure
{ANY}
top
Set all elements in range [0 .. upper] with value v.
set_slice_with (v: E_, lower: INTEGER_32, upper: INTEGER_32)
effective procedure
{ANY}
top
Set all elements in range [lower .. upper] with value v.
clear_all (upper: INTEGER_32)
effective procedure
{ANY}
top
Set all elements in range [0 .. upper] with the default value.
clear (lower: INTEGER_32, upper: INTEGER_32)
effective procedure
{ANY}
top
Set all elements in range [lower .. upper] with the default value.
copy_from (model: NATIVE_ARRAY [E_], upper: INTEGER_32)
effective procedure
{ANY}
top
Assume upper is a valid index both in Current and model.
copy_slice_from (model: NATIVE_ARRAY [E_], lower: INTEGER_32, upper: INTEGER_32)
effective procedure
{ANY}
top
Assume upper is a valid index both in Current and model.
deep_twin_from (capacity: INTEGER_32): NATIVE_ARRAY [E_]
effective function
{ANY}
top
To implement deep_twin.
move (lower: INTEGER_32, upper: INTEGER_32, offset: INTEGER_32)
effective procedure
{ANY}
top
Move range [lower .. upper] by offset positions.
occurrences (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Number of occurrences of element in range [0 .. upper] using is_equal for comparison.
slice_occurrences (element: E_, lower: INTEGER_32, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Number of occurrences of element in range [lower .. upper] using is_equal for comparison.
fast_occurrences (element: E_, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Number of occurrences of element in range [0 .. upper] using basic "=" for comparison.
slice_fast_occurrences (element: E_, lower: INTEGER_32, upper: INTEGER_32): INTEGER_32
effective function
{ANY}
top
Number of occurrences of element in range [lower .. upper] using basic "=" for comparison.
all_default (upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Do all items in range [0 .. upper] have their type's default value?
slice_default (lower: INTEGER_32, upper: INTEGER_32): BOOLEAN
effective function
{ANY}
top
Do all items in range [lower .. upper] have their type's default value?
to_external: POINTER
effective function
{ANY}
top
Gives access to the C pointer on the area of storage.
from_pointer (pointer: POINTER): NATIVE_ARRAY [E_]
{ANY}
top
Convert pointer into Current type.
is_not_null: BOOLEAN
effective function
{ANY}
top
is_null: BOOLEAN
effective function
{ANY}
top
manifest_make (needed_capacity: INTEGER_32)
effective procedure
{}
top
Manifest creation (see also calloc and realloc for creation).
manifest_put (index: INTEGER_32, element: E_)
effective procedure
{}
top
manifest_semicolon_check: BOOLEAN
is False
constant attribute
{}
top
test (e1: E_, e2: E_): BOOLEAN
effective function
{ANY}
top
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}
top
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.