Automatic generation produced by ISE Eiffel
class MULTI_ARRAY_LIST [G] General cluster: elks description: "Lists implemented as sequences of arrays, the last of which may be non-full. No limit on size (a new array is allocated if list outgrows its initial allocation)." create: make Ancestors DYNAMIC_LIST* [G] Queries after: BOOLEAN at alias "@" (i: INTEGER_32): [like item] G before: BOOLEAN block_size: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: MULTAR_LIST_CURSOR [G] exhausted: BOOLEAN extendible: BOOLEAN first: [like item] G first_element: BI_LINKABLE [ARRAYED_LIST [G]] for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN full: BOOLEAN has (v: [like item] G): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] G index: INTEGER_32 index_of (v: [like item] G; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] MULTI_ARRAY_LIST [G]): BOOLEAN is_inserted (v: G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G item_for_iteration: G last: [like item] G last_element: BI_LINKABLE [ARRAYED_LIST [G]] linear_representation: LINEAR [G] Lower: INTEGER_32 new_cursor: INDEXABLE_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) back compare_objects compare_references do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: [like item] G) fill (other: CONTAINER [G]) finish force (v: [like item] G) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) merge_left (other: [like Current] MULTI_ARRAY_LIST [G]) merge_right (other: [like Current] MULTI_ARRAY_LIST [G]) move (i: INTEGER_32) prune (v: [like item] G) prune_all (v: [like item] G) put (v: [like item] G) put_front (v: [like item] G) put_i_th (v: [like item] G; i: INTEGER_32) put_left (v: [like item] G) put_right (v: [like item] G) remove remove_i_th (i: INTEGER_32) remove_left remove_right replace (v: [like item] G) search (v: [like item] G) sequence_put (v: [like item] G) start swap (i: INTEGER_32) wipe_out Constraints writable definition readable definition extendible definition -- Generated by Eiffel Studio --
For more details: eiffel.org