Class ARRAY

-- Allocate array; set index interval to

-- `minindex' .. `maxindex'; set all values to default.

-- (Make array empty if `minindex' = `maxindex' + 1)

-- Make array with range [`minindex' .. `maxindex']. 

-- When `maxindex' = `minindex' - 1, the array is empty.

-- Allocate array; set index interval to 'minindex' .. 'maxindex';

-- set all values to default.

-- (Make array empty if 'minindex' > 'maxindex')

-- Initialize from the items of `a'.

-- (Useful in proper descendants of class `ARRAY',

-- to initialize an array-like object from a manifest array.)

-- Initialize from the items of 'arr'.

-- (Useful in proper descendants of class ARRAY,

-- to initialize an array-like object from a manifest array)

-- Perform actions on a freshly created object so that

-- the contents of `other' can be safely copied onto it.

-- Create an empty array with `capacity' initialized

-- at least to `needed_capacity' and `lower' set to `low'.

entry removed

-- Entry at index `i', if in index interval

-- Entry at index 'i', if in index interval

-- Entry at index 'i', if in index interval.

-- (Redefinable synonym for 'item' and 'infix "@"')

-- Does `v' appear in array?

-- (Reference or object equality,

-- based on `object_comparison'.)

-- Must search operations use `equal' rather than `='

-- for comparing references? (Default: no, use `='.)

-- May `object_comparison' be changed?

-- (Answer: yes by default.)

-- Look for `x' using basic `=' for comparison.

-- Also consider `has' to choose the most appropriate.

-- Give the index of the first occurrence of `element' using

-- `is_equal' for comparison.

-- Answer `upper + 1' when `element' is not inside.

-- Also consider `fast_index_of' to choose the most appropriate.

-- Give the index of the first occurrence of `element' using

-- basic `=' for comparison.

-- Answer `upper + 1' when `element' is not inside.

-- Also consider `index_of' to choose the most appropriate.

-- The very `first' item.

-- The `last' item.

-- Minimum index

-- Lower index bound.

-- Maximum index

-- Upper index bound.

-- Maximum index

-- Number of available indices

-- Number of elements actually stored in the collection.

-- Internal storage capacity in number of item.

-- Number of times `v' appears in structure

-- Number of occurrences of `element' using `equal' for comparison.

-- Also consider `fast_nb_occurences' to choose the most appropriate.

-- Number of occurrences of `element' using basic `=' for comparison.

-- Also consider `nb_occurences' to choose the most appropriate.

obsolete "Eiffel/S 1.3 compatibility"

-- Is array made of the same items as `other'?

-- Is array made of the same items as 'other' ?

-- (Redefined from GENERAL)

-- Ensure that future search operations will use `equal'

-- rather than `=' for comparing references.

-- Ensure that future search operations will use `='

-- rather than `equal' for comparing references.

-- Is collection empty?

obsolete "Eiffel/S 1.3 compatibility"

-- Is object in a consistent state so that `other'

-- may be copied onto it? (Default answer: yes).

-- Is structure filled to capacity? (Answer: yes)

-- Are all items set to default values?

-- Are all items set to the default value ?

obsolete "Eiffel/S 1.3 compatibility"

-- Is `i' within the bounds of the array?

-- True when `index' is valid (ie. inside actual 

-- bounds of the collection).

-- Is 'i' within the bounds of the array ?

-- Is `k' a valid key?

-- May items be added?

-- (Answer: no, although array may be resized.)

-- May items be removed? (Answer: no.)

-- May `capacity' be changed?

enter removed

-- Replace `i'-th entry, if in index interval, by `v'.

-- Replace 'i-th' entry, if in index interval, by 'v'

-- Replace 'i-th' entry, if in index interval, by 'v'.

-- (Redefinable synonym for 'put')

-- Assign item `v' to `i'-th entry.

-- Always applicable: resize the array if `i' falls out of

-- currently defined bounds; preserve existing items.

-- Put `element' at position `index'. Current is

-- resized if `index' is not inside current bounds.

-- New bounds are initialized with default values.

-- Assign item 'v' to 'i-th' entry.

-- Always applicable: resize the array if 'i' falls out of

-- currently defined bounds; preserve existing items

-- Copy items of `other' within bounds `start_pos' and `end_pos'

-- to current array starting at index `index_pos'.

-- Fill with as many items of `other' as possible.

-- The representations of `other' and current structure

-- need not be the same.

-- Add a new item in first position : `count' is increased by 

-- one and all other items are shifted right.

-- Add a new item at the end : `count' is increased by one.

-- Add a new `element' at rank `index' : `count' is increased 

-- by one and range [`index' .. `upper'] is shifted right

-- by one position.

obsolete "Eiffel/S 1.3 compatibility"

-- Swap item at index `i1' with item at index `i2'.

-- Set all items in range [`lower_index' .. `upper_index'] with `v'.

-- Replace all occurences of the element `old_value' by `new_value' 

-- using `equal' for comparison.

-- See also `fast_replace_all' to choose the apropriate one.

-- Replace all occurences of the element `old_value' by `new_value' 

-- using operator `=' for comparison.

-- See also `replace_all' to choose the apropriate one.

-- Make array empty.

obsolete "Eiffel/S 1.3 compatibility"

-- Reset all items to default values.

-- Set all items to default values.

-- The `count' is not affected (see also `clear').

obsolete "Eiffel/S 1.3 compatibility"

-- Remove all occurrences of `v'.

-- (Reference or object equality,

-- based on `object_comparison'.)

--|Default implementation, usually inefficient.

-- Remove the `first' element of the collection.

-- Remove the `last' item.

-- Remove the item at position `index'. Followings items

-- are shifted left by one position.

obsolete "Eiffel/S 1.3 compatibility"

-- Discard all items in order to make it `empty'.

-- See also `clear_all'.

-- Change the capacity to at least `i'.

-- Percentage by which structure will grow automatically

-- Minimal number of additional items

-- Proposed number of additional items

--| Result is a reasonable value, resulting from a space-time tradeoff.

-- Change the capacity to accommodate at least

-- `Growth_percentage' more items.

--| Trades space for time:

--| allocates fairly large chunks of memory but not very often.

-- Rearrange array so that it can accommodate

-- indices down to `minindex' and up to `maxindex'.

-- Do not lose any previously entered item.

-- Resize the array. No elements will be lost in the 

-- intersection of [old `lower' .. old `upper'] and 

-- [`minindex' .. `maxindex'].

-- New positions are initialized with appropriate 

-- default values.

-- Rearrange array so that it can accommodate

-- indices down to 'minindex' and up to 'maxindex'.

-- Do not lose any previously entered item

obsolete "Eiffel/S 1.3 compatibility"

-- Move range `lower_index' .. `upper_index' by `distance' 

-- positions. Negative distance moves towards lower indices.

-- Free places get default values.

obsolete "Eiffel/S 1.3 compatibility"

-- Address of actual sequence of values,

-- for passing to external (non-Eiffel) routines.

-- Address of actual sequence of values,

-- for passing to external (non-Eiffel) routines

-- Creates array from its external representation

-- Representation as a linear structure

-- Gives C access into the internal `storage' of the ARRAY.

-- Result is pointing the element at index `lower'.

-- 

-- NOTE: do not free/realloc the Result. Resizing of the array 

-- can makes this pointer invalid.

obsolete "Eiffel/S 1.3 compatibility"

-- Reinitialize by copying all the items of `other'.

-- (This is also used by `clone'.)

-- Reinitialize by copying all the items of 'other'.

-- (This is also used by 'clone'.)

-- (From GENERAL)

-- Array made of items of current array within

-- bounds `start_pos' and `end_pos'.

-- Create a new collection initialized with elements of

-- range `low'..`up'. Result has the same dynamic type 

-- as Current collection. The `lower' index of the new 

-- collection is the same as `lower' of Current.

-- Remove first occurrence of `v' if any.

-- (Precondition is false.)

-- Add `v' to structure.

-- (Precondition is false.)

-- New area of size `newsize' containing `n' items

-- from `oldarea'.

-- Old items are at position `s' in new area.

-- Rearrange array so that it can accommodate

-- indices down to `minindex' and up to `maxindex'.

-- Do not lose any previously entered item.

-- If area must be extended, ensure that space for at least

-- additional_space item is added.

-- Special data zone

-- Creates a special object for `n' entries.

-- Make `other' the new `area'

-- Copy elements of `source' within bounds `s'

-- and `e' to `target' starting at index `i'.

-- Reset all items to default value.

-- Eiffel/S 1.3 compatibility

-- Eiffel/S 1.3 compatibility

-- Empty the array, discard all items

-- Free the memory used by the Current COLLECTION (objects

-- pointed by the Current COLLECTION are not affected). 

-- Assume you don't use Current any more. 

obsolete "Since release -0.81, the Garbage Collector is %

%implemented. This feature will be soon removed."

-- Note: this feature is called to avoid calling `equal'

-- on expanded types (no automatic conversion to 

-- corresponding reference type).

-- Internal access to storage location.

-- Create a new array and initialize it

-- with items from `an_array'.

-- Does `v' appear in `an_array'?

-- Use `=?

-- Array made up of items from `an_array' within

-- bounds `start_pos' and `end_pos'

GYacc: 2

-- Copy items of `other' within bounds `start_pos' and `end_pos'

-- to `an_array' starting at index `index_pos'.

GLex: 1

GYacc: 0

-- Reset all items to default values.