Automatic generation produced by ISE Eiffel
indexing 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). ]" status: "See notice at end of class" names: list, sequence representation: array, linked access: index, cursor, membership contents: generic date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" class interface MULTI_ARRAY_LIST [G] create make feature -- Initialization make (b: INTEGER) -- Create an empty list, setting block_size to b feature -- Access item: G -- Item at cursor position first: like item -- Item at first position last: like item -- Item at last position has (v: like item): BOOLEAN -- Does list include v? -- (Reference or object equality, -- based on object_comparison.) index: INTEGER -- Current cursor index cursor: CURSOR -- Current cursor position first_element: BI_LINKABLE [ARRAYED_LIST [G]] -- First array_sequence element of the list last_element: BI_LINKABLE [ARRAYED_LIST [G]] -- Last array_sequence element of the list block_size: INTEGER feature -- Measurement count: INTEGER -- Number of items feature -- Status report full: BOOLEAN valid_cursor (p: CURSOR): BOOLEAN -- Can the cursor be moved to position p? feature -- Cursor movement start -- Move cursor to first position. -- (No effect if empty) finish -- Move cursor to last position. -- (No effect if empty) forth -- Move cursor to next position, if any. back -- Move cursor to previous position, if any. move (i: INTEGER) -- Move cursor i positions. The cursor -- may end up off if the offset is too big. go_to (p: CURSOR) -- Move cursor to position p search (v: like item) -- Move cursor to first position (at or after current -- cursor position) where item and v are equal. -- (Reference or object equality, -- based on object_comparison.) feature -- Element change replace (v: like item) -- Replace current item by v. extend (v: like item) -- Add v to end. put_front (v: like item) -- Add v at the beginning. -- Do not move cursor. put_left (v: like item) -- Add v to the left of current position. -- Do not move cursor. put_right (v: like item) -- Add v to the left of current position. -- Do not move cursor. feature -- Removal wipe_out -- Remove all items. remove -- Remove current item remove_left remove_right prune_all (v: like item) feature -- Duplication duplicate (n: INTEGER): like Current -- Copy of sub-list beginning at cursor position -- and having min (n, count - index + 1) items invariant writable_definition: writable = not off readable_definition: readable = not off extendible_definition: extendible indexing library: "[ EiffelBase: Library of reusable components for Eiffel. ]" status: "[ Copyright 1986-2001 Interactive Software Engineering (ISE). For ISE customers the original versions are an ISE product covered by the ISE Eiffel license and support agreements. ]" license: "[ EiffelBase may now be used by anyone as FREE SOFTWARE to develop any product, public-domain or commercial, without payment to ISE, under the terms of the ISE Free Eiffel Library License (IFELL) at http://eiffel.com/products/base/license.html. ]" source: "[ Interactive Software Engineering Inc. ISE Building 360 Storke Road, Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Electronic mail <info@eiffel.com> Customer support http://support.eiffel.com ]" info: "[ For latest info see award-winning pages: http://eiffel.com ]" end -- class MULTI_ARRAY_LIST -- Generated by ISE Eiffel --
For more details: www.eiffel.com