indexing

	description: "[
		Sequences of values, all of the same type or of a conforming one,
		accessible through integer indices in a contiguous interval.
		]"
	legal: "See notice at end of class."

	status: "See notice at end of class."
	date: "$Date$"
	revision: "$Revision$"

class ARRAYI [G -> ANY] inherit

	RESIZABLE [G]
		redefine
			full, copy, is_equal
		end

	INDEXABLE [G, INTEGER]
		rename
			item as item alias "[]"
		redefine
			copy, index_set, is_equal
		end

	TO_SPECIAL [G]
		export
			{ARRAYI} set_area
		redefine
			copy, is_equal, item, put, at, valid_index
		end

create
	make,
	make_from_array,
	make_from_cil

convert
	to_cil: {NATIVE_ARRAY [G]},
	to_special: {SPECIAL [G]},
	make_from_cil ({NATIVE_ARRAY [G]})

feature -- Initialization

	make (min_index, max_index: INTEGER) is
			-- Allocate array; set index interval to
			-- `min_index' .. `max_index'; set all values to default.
			-- (Make array empty if `min_index' = `max_index' + 1).
		require
			valid_bounds: (agent (l_min_index: INTEGER): INTEGER do Result := l_min_index end).item([min_index]) <= 
						  (agent (l_max_index: INTEGER): INTEGER do Result := l_max_index + 1 end).item([max_index])
		do
				lower := min_index
			upper := max_index
			if min_index <= max_index then
				make_filled_area (({G}).default, max_index - min_index + 1)
			else
				make_filled_area (({G}).default, 0) 
			end
		ensure
			lower_set: (agent (l_min_index: INTEGER): BOOLEAN do Result := (agent lower).item ([]) = l_min_index end).item ([min_index])
			upper_set: (agent (l_max_index: INTEGER): BOOLEAN do Result := (agent upper).item ([]) = l_max_index end).item ([max_index])
			items_set: (agent: BOOLEAN 
				do
					Result := area.filled_with (({G}).default, 0, (agent upper).item ([]) - (agent lower).item ([]))
				ensure
					definition: Result = ((agent count).item ([]) = 0) or else
						((
							(agent (i: INTEGER): G 
							-- Entry at index `i', if in index interval
								do
									Result := area.item (i - (agent lower).item ([]))
								end).item ([upper]) = Void
							or else
							(agent (i: INTEGER): G 
							-- Entry at index `i', if in index interval
								do
									Result := area.item (i - (agent lower).item ([]))
								end((agent upper).item([]))).item ([]) = item (upper).default) and
						(agent (start_pos, end_pos: INTEGER): ARRAYI [G]
							require
								valid_start_pos: (agent (i: INTEGER): BOOLEAN
									do
										Result := (lower <= i) and then (i <= upper)
									end).item ([start_pos])
								valid_end_pos: valid_index (end_pos)
								valid_bounds: (start_pos <= end_pos) or (start_pos = end_pos + 1)
							do
								create Result.make (start_pos, end_pos)
								Result.subcopy (Current, start_pos, end_pos, start_pos)
							ensure
								lower: Result.lower = start_pos
								upper: Result.upper = end_pos
							end).item ([lower, upper - 1]).all_default)
					end).item ([])							
		end


	make_from_array (a: ARRAYI [G]) is
			-- Initialize from the items of `a'.
			-- (Useful in proper descendants of class `ARRAY',
			-- to initialize an array-like object from a manifest array.)
		require
			array_exists: a /= Void
		do
			area := a.area
			lower := a.lower
			upper := a.upper
		end

	make_from_cil (na: NATIVE_ARRAY [like item]) is
			-- Initialize array from `na'.
		require
			is_dotnet: {PLATFORM}.is_dotnet
			na_not_void: na /= Void
		do
			create area.make_from_native_array (na)
			lower := 1
			upper := area.count
		end

feature -- Access

	item alias "[]", at alias "@" (i: INTEGER): G assign put is
			-- Entry at index `i', if in index interval
		do
			Result := (agent (l_i: INTEGER): G 
				do
					Result := area.item (l_i - (agent lower).item ([]))
				end (i)).item ([])
		end

	entry (i: INTEGER): G is
			-- Entry at index `i', if in index interval
		require
			valid_key: valid_index (i)
		do
			Result := item (i)
		end

	has (v: G): BOOLEAN is
			-- Does `v' appear in array?
 			-- (Reference or object equality,
			-- based on `object_comparison'.)
		local
			i, nb: INTEGER
			l_area: like area
			l_item: G
		do
			l_area := (agent area).item ([])
			nb := (agent upper).item ([]) - (agent lower).item ([])
			if object_comparison and v /= Void then
				from
				until
					i > nb or Result
				loop
					l_item := l_area.item (i)
					Result := l_item /= Void and then l_item.is_equal (v)
					i := i + 1
				end
			else
				from
				until
					i > nb or Result
				loop
					Result := l_area.item (i) = v
					i := i + 1
				end
			end
		end

feature -- Measurement

	lower: INTEGER
			-- Minimum index

	upper: INTEGER
			-- Maximum index

	count, capacity: INTEGER is
			-- Number of available indices
		do
			Result := upper - lower + 1
		ensure then
			consistent_with_bounds: Result = upper - lower + 1
		end

	occurrences (v: G): INTEGER is
			-- Number of times `v' appears in structure
		local
			i: INTEGER
		do
			if object_comparison and then v /= Void then
				from
					i := lower
				until
					i > upper
				loop
					if 
						(agent (ll_i: INTEGER): G
							do
								Result := (agent (l_i: INTEGER): G 
									do
										Result := area.item (l_i - (agent lower).item ([]))
									end (ll_i)).item ([])
							end).item ([i])
						/= Void and then v.is_equal (item (i)) then
						Result := Result + 1
					end
					i := i + 1
				end
			else
				from
					i := lower
				until
					i > upper
				loop
					if (agent (ll_i: INTEGER): G
							do
								Result := (agent (l_i: INTEGER): G 
									do
										Result := area.item (l_i - (agent lower).item ([]))
									end (ll_i)).item ([])
							end).item ([i])= v then
						Result := Result + 1
					end
					i := i + 1
				end
			end
		end

	index_set: INTEGER_INTERVAL is
			-- Range of acceptable indexes
		do
			create Result.make (lower, upper)
		ensure then
			same_count: Result.count = count
			same_bounds:
				((Result.lower = lower) and (Result.upper = upper))
		end

feature -- Comparison

	is_equal (other: like Current): BOOLEAN is
			-- Is array made of the same items as `other'?
		local
			i: INTEGER
		do
			if other = Current then
				Result := True
			elseif lower = other.lower and then upper = other.upper and then
				object_comparison = other.object_comparison
			then
				if object_comparison then
					from
						Result := True
						i := lower
					until
						not Result or i > upper
					loop
						Result := equal (item (i), other.item (i))
						i := i + 1
					end
				else
					Result := area.same_items (other.area, 0, 0, count)
				end
			end
		end

feature -- Status report

	all_default: BOOLEAN is
			-- Are all items set to default values?
		do
			Result := area.filled_with (({G}).default, 0, upper - lower)
		ensure
			definition: Result = (count = 0 or else
				((item (upper) = Void or else
				item (upper) = item (upper).default) and
				subarray (lower, upper - 1).all_default))
		end

	full: BOOLEAN is
			-- Is structure filled to capacity? (Answer: yes)
		do
			Result := True
		end

	same_items (other: like Current): BOOLEAN is
			-- Do `other' and Current have same items?
		require
			other_not_void: other /= Void
		do
			if count = other.count then
				Result := area.same_items (other.area, 0, 0, count)
			end
		ensure
			definition: Result = ((count = other.count) and then
				(count = 0 or else (item (upper) = other.item (other.upper)
				and subarray (lower, upper - 1).same_items
				(other.subarray (other.lower, other.upper - 1)))))
		end

	all_cleared: BOOLEAN is
			-- Are all items set to default values?
		obsolete
			"Use `all_default' instead"
		do
			Result := all_default
		end

	valid_index (i: INTEGER): BOOLEAN is
			-- Is `i' within the bounds of the array?
		do
			Result := (lower <= i) and then (i <= upper)
		end

	extendible: BOOLEAN is
			-- May items be added?
			-- (Answer: no, although array may be resized.)
		do
			Result := False
		end

	prunable: BOOLEAN is
			-- May items be removed? (Answer: no.)
		do
			Result := False
		end

	valid_index_set: BOOLEAN is
		do
			Result := index_set.count = count
		end

feature -- Element change

	put (v: like item; i: INTEGER) is
			-- Replace `i'-th entry, if in index interval, by `v'.
		do
			area.put (v, i - lower)
		end

	enter (v: like item; i: INTEGER) is
			-- Replace `i'-th entry, if in index interval, by `v'.
		require
			valid_key: valid_index (i)
		do
			area.put (v, i - lower)
		end

	force (v: like item; i: INTEGER) is
			-- Assign item `v' to `i'-th entry.
			-- Always applicable: resize the array if `i' falls out of
			-- currently defined bounds; preserve existing items.
		do
			if i < lower then
--				auto_resize (i, upper)
				--start
				(agent (min_index, max_index: INTEGER)
			-- Rearrange array so that it can accommodate
			-- indices down to `min_index' and up to `max_index'.
			-- Do not lose any previously entered item.
			-- If area must be extended, ensure that space for at least
			-- additional_space item is added.
					require
						valid_indices: min_index <= max_index
					local
						old_size, new_size: INTEGER
						new_lower, new_upper: INTEGER
						offset: INTEGER
						l_v: G
					do
						if empty_area then
							new_lower := min_index
							new_upper := max_index
						else
							new_lower := min_index.min (lower)
							new_upper := max_index.max (upper)
						end
						new_size := new_upper - new_lower + 1
						if not empty_area then
							old_size := area.count
							if new_size > old_size
								 and new_size - old_size < additional_space
							then
								new_size := old_size + additional_space
							end
						end
						if empty_area then
							make_filled_area (({G}).default, new_size)
						else
							if new_size > old_size then
								area := area.aliased_resized_area (new_size)
							end
							if new_lower < lower then
								offset := lower - new_lower
								area.move_data (0, offset, capacity)
								area.fill_with (l_v, 0, offset - 1)
							end
						end
						lower := new_lower
						upper := new_upper
					end (?, upper)).call ([i])

				--end
			elseif i > upper then
				auto_resize (lower, i)
			end
			put (v, i)
		ensure
			inserted: item (i) = v
			higher_count: count >= old count
		end

	subcopy (other: ARRAYI [like item]; start_pos, end_pos, index_pos: INTEGER) is
			-- Copy items of `other' within bounds `start_pos' and `end_pos'
			-- to current array starting at index `index_pos'.
		require
			other_not_void: other /= Void
			valid_start_pos: other.valid_index (start_pos)
			valid_end_pos: other.valid_index (end_pos)
			valid_bounds: (start_pos <= end_pos) or (start_pos = end_pos + 1)
			valid_index_pos: valid_index (index_pos)
			enough_space: (upper - index_pos) >= (end_pos - start_pos)
		do
			area.copy_data (other.area, start_pos - other.lower, index_pos - lower, end_pos - start_pos + 1)
		ensure
			-- copied: forall `i' in 0 .. (`end_pos'-`start_pos'),
			--     item (index_pos + i) = other.item (start_pos + i)
		end

feature -- Iteration

	do_all (action: PROCEDURE [G]) is
			-- Apply `action' to every non-void item.
			-- Semantics not guaranteed if `action' changes the structure;
			-- in such a case, apply iterator to clone of structure instead.
		require
			action_not_void: action /= Void
		local
			t: TUPLE [G]
			i, nb: INTEGER
			l_area: like area
		do
			from
				i := 0
				nb := capacity - 1
				l_area := area
			until
				i > nb
			loop
				t := [l_area.item (i)]
				action.call (t)
				i := i + 1
			end
		end

	do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) is
			-- Apply `action' to every non-void item that satisfies `test'.
			-- Semantics not guaranteed if `action' or `test' changes the structure;
			-- in such a case, apply iterator to clone of structure instead.
		require
			action_not_void: action /= Void
			test_not_void: test /= Void
		local
			t: TUPLE [G]
			i, nb: INTEGER
			l_area: like area
		do
			from
				i := 0
				nb := capacity - 1
				l_area := area
			until
				i > nb
			loop
				t := [l_area.item (i)]
				if test.item (t) then
					action.call (t)
				end
				i := i + 1
			end
		end

	there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN is
			-- Is `test' true for at least one item?
		require
			test_not_void: test /= Void
		local
			t: TUPLE [G]
			i, nb: INTEGER
			l_area: like area
		do
			from
				i := 0
				nb := capacity - 1
				l_area := area
			until
				i > nb or Result
			loop
				t := [l_area.item (i)]
				Result := test.item (t)
				i := i + 1
			end
		end

	for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN is
			-- Is `test' true for all non-void items?
		require
			test_not_void: test /= Void
		local
			t: TUPLE [G]
			i, nb: INTEGER
			l_area: like area
		do
			from
				i := 0
				nb := capacity - 1
				l_area := area
				Result := True
			until
				i > nb or not Result
			loop
				t := [l_area.item (i)]
				Result := test.item (t)
				i := i + 1
			end
		end

feature -- Removal

	wipe_out is
			-- Make array empty.
		obsolete
			"Not applicable since not `prunable'. Use `discard_items' instead."
		do
			discard_items
		end

	discard_items is
			-- Reset all items to default values with reallocation.
		do
			make_filled_area (({G}).default, capacity)
		ensure
			default_items: all_default
		end

	clear_all is
			-- Reset all items to default values.
		do
			area.fill_with (({G}).default, 0, area.upper)
		ensure
			stable_lower: lower = old lower
			stable_upper: upper = old upper
			default_items: all_default
		end

feature -- Resizing

	grow (i: INTEGER) is
			-- Change the capacity to at least `i'.
		do
			if i > capacity then
				conservative_resize (lower, upper + i - capacity)
			end
		end

	conservative_resize (min_index, max_index: INTEGER) is
			-- Rearrange array so that it can accommodate
			-- indices down to `min_index' and up to `max_index'.
			-- Do not lose any previously entered item.
		require
			good_indices: min_index <= max_index
		local
			old_size, new_size, old_count: INTEGER
			new_lower, new_upper: INTEGER
			offset: INTEGER
			v: G
		do
			if empty_area then
				new_lower := min_index
				new_upper := max_index
			else
				new_lower := min_index.min (lower)
				new_upper := max_index.max (upper)
			end
			new_size := new_upper - new_lower + 1
			if not empty_area then
				old_size := area.count
				old_count := upper - lower + 1
			end
			if empty_area then
				make_filled_area (({G}).default, new_size)
			else
				if new_size > old_size then
					area := area.aliased_resized_area (new_size)
				end
				if new_lower < lower then
					offset := lower - new_lower
					area.move_data (0, offset, old_count)
					area.fill_with (v, 0, offset - 1)
				end
			end
			lower := new_lower
			upper := new_upper
		ensure
			no_low_lost: lower = min_index or else lower = old lower
			no_high_lost: upper = max_index or else upper = old upper
		end

	resize (min_index, max_index: INTEGER) is
			-- Rearrange array so that it can accommodate
			-- indices down to `min_index' and up to `max_index'.
			-- Do not lose any previously entered item.
		obsolete
			"Use `conservative_resize' instead as future versions will implement `resize' as specified in ELKS."
		require
			good_indices: min_index <= max_index
		do
			conservative_resize (min_index, max_index)
		ensure
			no_low_lost: lower = min_index or else lower = old lower
			no_high_lost: upper = max_index or else upper = old upper
		end

	trim
			-- <Precursor>
		local
			n: like count
		do
			n := count
			if n < capacity then
				area := area.aliased_resized_area (n)
			end
		ensure then
			same_items: same_items (old twin)
		end

feature -- Conversion

	to_c: ANY is
			-- Address of actual sequence of values,
			-- for passing to external (non-Eiffel) routines.
		require
			not_is_dotnet: not {PLATFORM}.is_dotnet
		do
			Result := area
		end

	to_cil: NATIVE_ARRAY [G] is
			-- Address of actual sequence of values,
			-- for passing to external (non-Eiffel) routines.
		require
			is_dotnet: {PLATFORM}.is_dotnet
		do
			Result := area.native_array
		ensure
			to_cil_not_void: Result /= Void
		end

	to_special: SPECIAL [G] is
			-- 'area'.
		do
			Result := area
		ensure
			to_special_not_void: Result /= Void
		end

	linear_representation: LINEAR [G] is
			-- Representation as a linear structure
		local
			temp: ARRAYED_LIST [G]
			i: INTEGER
		do
			create temp.make (capacity)
			from
				i := lower
			until
				i > upper
			loop
				temp.extend (item (i))
				i := i + 1
			end
			Result := temp
		end

feature -- Duplication

	copy (other: like Current) is
			-- Reinitialize by copying all the items of `other'.
			-- (This is also used by `clone'.)
		do
			if other /= Current then
				standard_copy (other)
				set_area (other.area.twin)
			end
		ensure then
			equal_areas: area.is_equal (other.area)
		end

	subarray (start_pos, end_pos: INTEGER): ARRAYI [G] is
			-- Array made of items of current array within
			-- bounds `start_pos' and `end_pos'.
		require
			valid_start_pos: valid_index (start_pos)
			valid_end_pos: valid_index (end_pos)
			valid_bounds: (start_pos <= end_pos) or (start_pos = end_pos + 1)
		do
			create Result.make (start_pos, end_pos)
			Result.subcopy (Current, start_pos, end_pos, start_pos)
		ensure
			lower: Result.lower = start_pos
			upper: Result.upper = end_pos
			-- copied: forall `i' in `start_pos' .. `end_pos',
			--     Result.item (i) = item (i)
		end

feature {NONE} -- Inapplicable

	prune (v: G) is
			-- Remove first occurrence of `v' if any.
			-- (Precondition is False.)
		do
		end

	extend (v: G) is
			-- Add `v' to structure.
			-- (Precondition is False.)
		do
		end

feature {NONE} -- Implementation

	auto_resize (min_index, max_index: INTEGER) is
			-- Rearrange array so that it can accommodate
			-- indices down to `min_index' and up to `max_index'.
			-- Do not lose any previously entered item.
			-- If area must be extended, ensure that space for at least
			-- additional_space item is added.
		require
			valid_indices: min_index <= max_index
		local
			old_size, new_size: INTEGER
			new_lower, new_upper: INTEGER
			offset: INTEGER
			v: G
		do
			if empty_area then
				new_lower := min_index
				new_upper := max_index
			else
				new_lower := min_index.min (lower)
				new_upper := max_index.max (upper)
			end
			new_size := new_upper - new_lower + 1
			if not empty_area then
				old_size := area.count
				if new_size > old_size
					 and new_size - old_size < additional_space
				then
					new_size := old_size + additional_space
				end
			end
			if empty_area then
				make_filled_area (({G}).default, new_size)
			else
				if new_size > old_size then
					area := area.aliased_resized_area (new_size)
				end
				if new_lower < lower then
					offset := lower - new_lower
					area.move_data (0, offset, capacity)
					area.fill_with (v, 0, offset - 1)
				end
			end
			lower := new_lower
			upper := new_upper
		end

	empty_area: BOOLEAN is
			-- Is `area' empty?
		do
			Result := area = Void or else area.count = 0
		end

invariant

	area_exists: area /= Void
--	consistent_size: capacity = (agent upper).item ([]) - lower + 1
--	non_negative_count: count >= 0
--	index_set_has_same_count: (agent: BOOLEAN 
--		do
--			Result := index_set.count = count
--		end).item ([])
-- Internal discussion haven't reached an agreement on this invariant
--	index_set_has_same_bounds: ((index_set.lower = lower) and
--				(index_set.upper = lower + count - 1))

indexing
	library:	"EiffelBase: Library of reusable components for Eiffel."
--| Copyright (c) 1993-2019 University of Southern California and contributors.
	license:	"Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
	source: "[
			 Eiffel Software
			 356 Storke Road, Goleta, CA 93117 USA
			 Telephone 805-685-1006, Fax 805-685-6869
			 Website http://www.eiffel.com
			 Customer support http://support.eiffel.com
		]"

end