note description: "Routines that ought to be in class ARRAY" library: "Gobo Eiffel Kernel Library" copyright: "Copyright (c) 1999-2018, Eric Bezault and others" license: "MIT License" date: "$Date: 2019-02-07 22:54:15 +0000 (Thu, 07 Feb 2019) $" revision: "$Revision: 102807 $" class KL_ARRAY_ROUTINES [G] inherit KL_IMPORTED_ANY_ROUTINES create default_create feature -- Initialization make_from_array (an_array: ARRAY [G]; min_index: INTEGER_32): ARRAY [G] -- Create a new array and initialize it -- with items from an_array. require an_array_not_void: an_array /= Void do Result := subarray (an_array, an_array.lower, an_array.upper, min_index) ensure instance_free: class array_not_void: Result /= Void lower_set: Result.lower = min_index count_set: Result.count = an_array.count same_items: across Result.lower |..| Result.upper as i all {KL_TYPE [G]}.same_objects (Result.item (i.item), an_array.item (i.item + an_array.lower - min_index)) end end make_empty_with_lower (min_index: INTEGER_32): ARRAY [G] -- Create an empty array with min_index as lower bound. local l_array: KL_ARRAY [G] do if min_index = 1 then create Result.make_empty else create l_array.make_empty l_array.new_rebase (min_index) create Result.make_from_array (l_array) end ensure instance_free: class array_not_void: Result /= Void lower_set: Result.lower = min_index is_empty: Result.is_empty end feature -- Status report has (an_array: ARRAY [G]; v: G): BOOLEAN -- Does v appear in an_array (use '=' for item comparison). -- Reasons why we don't use ARRAY.has directly: -- * has is not in ELKS ARRAY 2000. -- * ISE may change this behavior with compare_objects. require an_array_not_void: an_array /= Void local i, nb: INTEGER_32 do from i := an_array.lower nb := an_array.upper until i > nb loop if an_array.item (i) = v then Result := True i := nb + 1 else i := i + 1 end end ensure instance_free: class end has_void (a_array: ARRAY [G]): BOOLEAN -- Does 'Void' appear in an_array (use '=' for item comparison). -- Reason why we don't use has (Void) directly: -- * the actual generic parameter may be attached and -- 'Void' would not conform to it. require a_array_not_void: a_array /= Void local i, nb: INTEGER_32 do if attached {ARRAY [detachable G]} a_array as l_array then from i := l_array.lower nb := l_array.upper until i > nb loop if l_array.item (i) = Void then Result := True i := nb + 1 else i := i + 1 end end end ensure instance_free: class end feature -- Access subarray (an_array: ARRAY [G]; start_pos, end_pos, min_index: INTEGER_32): ARRAY [G] -- Array made up of items from an_array within -- bounds start_pos and end_pos -- Reasons why we don't use ARRAY.subarray directly: -- * ELKS ARRAY 2000 returns an 'ARRAY [G]' -- whereas ISE 5.4/5.5 return a 'like Current'. -- * ISE 5.4/5.5 does not allow subarrays of empty array, -- and does not work with empty subarrays. -- * This routine has an extra argument min_index compared -- to the one provided by ELKS and the various compilers. require an_array_not_void: an_array /= Void start_pos_large_enough: start_pos >= an_array.lower end_pos_small_enough: end_pos <= an_array.upper valid_bounds: start_pos <= end_pos + 1 do if end_pos < start_pos then Result := make_empty_with_lower (min_index) else create Result.make_filled (an_array.item (start_pos), min_index, min_index + end_pos - start_pos) subcopy (Result, an_array, start_pos, end_pos, min_index) end ensure instance_free: class array_not_void: Result /= Void lower_set: Result.lower = min_index count_set: Result.count = end_pos - start_pos + 1 same_items: across Result.lower |..| Result.upper as i all {KL_TYPE [G]}.same_objects (Result.item (i.item), an_array.item (i.item + start_pos - min_index)) end end feature -- Duplication cloned_array (an_array: ARRAY [G]): ARRAY [G] -- Clone of an_array require an_array_not_void: an_array /= Void do Result := an_array.twin ensure instance_free: class cloned_not_void: Result /= Void same_type: Any_.same_types (Result, an_array) is_equal: Result.is_equal (an_array) end feature -- Element change subcopy (an_array: ARRAY [G]; other: ARRAY [G]; start_pos, end_pos, index_pos: INTEGER_32) -- Copy items of other within bounds start_pos and end_pos -- to an_array starting at index index_pos. -- Reasons why we don't use ARRAY.subcopy directly: -- * subcopy is not in ELKS ARRAY 2000. require an_array_not_void: an_array /= Void other_not_void: other /= Void not_same: an_array /= other start_pos_large_enough: start_pos >= other.lower end_pos_small_enough: end_pos <= other.upper valid_bounds: start_pos <= end_pos + 1 index_pos_large_enough: index_pos >= an_array.lower enough_space: (an_array.upper - index_pos) >= (end_pos - start_pos) do if start_pos <= end_pos then an_array.subcopy (other, start_pos, end_pos, index_pos) end ensure instance_free: class copied: across 0 |..| (end_pos - start_pos) as i all {KL_TYPE [G]}.same_objects (an_array.item (index_pos + i.item), other.item (start_pos + i.item)) end end feature -- Resizing resize (an_array: ARRAY [G]; min_index, max_index: INTEGER_32) -- 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 an_array_not_void: an_array /= Void valid_min_index: min_index <= an_array.lower valid_max_index: max_index >= an_array.upper has_default: ({G}).has_default do resize_with_default (an_array, ({G}).default, min_index, max_index) ensure instance_free: class lower_set: an_array.lower = min_index upper_set: an_array.upper = max_index end resize_with_default (an_array: ARRAY [G]; a_default_value: G; min_index, max_index: INTEGER_32) -- 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 an_array_not_void: an_array /= Void valid_min_index: min_index <= an_array.lower valid_max_index: max_index >= an_array.upper do if min_index <= max_index then an_array.conservative_resize_with_default (a_default_value, min_index, max_index) end ensure instance_free: class lower_set: an_array.lower = min_index upper_set: an_array.upper = max_index end end -- class KL_ARRAY_ROUTINES
Generated by ISE EiffelStudio