Automatic generation produced by ISE Eiffel
indexing description: "Sequential, two-way linked lists" status: "See notice at end of class" names: two_way_list, sequence representation: 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 TWO_WAY_LIST [G] create make_sublist, make feature -- Access first_element: BI_LINKABLE [G] -- Head of list -- (Anchor redefinition) last_element: like first_element -- Tail of the list sublist: like Current -- Result produced by last split feature -- Status report islast: BOOLEAN -- Is cursor at last position? feature -- Cursor movement forth -- Move cursor to next position, if any. back -- Move cursor to previous position, if any. finish -- Move cursor to last position. -- (Go before if empty) ensure then not_after: not after move (i: INTEGER) -- Move cursor i positions. The cursor -- may end up off if the offset is to big. feature -- Element change put_front (v: like item) -- Add v to beginning. -- Do not move cursor. extend (v: like item) -- Add v to end. -- Do not move cursor. put_left (v: like item) -- Add v to the left of cursor position. -- Do not move cursor. put_right (v: like item) -- Add v to the right of cursor position. -- Do not move cursor. merge_left (other: like Current) -- Merge other into current structure before cursor -- position. Do not move cursor. Empty other. merge_right (other: like Current) -- Merge other into current structure after cursor -- position. Do not move cursor. Empty other. feature -- Removal remove -- Remove current item. -- Move cursor to right neighbor -- (or after if no right neighbor). remove_left -- Remove item to the left of cursor position. -- Do not move cursor. remove_right -- Remove item to the right of cursor position. -- Do not move cursor. wipe_out -- Remove all items. split (n: INTEGER) -- Remove from current list -- min (n, count - index - 1) items -- starting at cursor position. -- Move cursor right one position. -- Make extracted sublist accessible -- through attribute sublist. require not_off: not off valid_sublist: n >= 0 remove_sublist invariant non_empty_list_has_two_endpoints: not is_empty implies (first_element /= void and last_element /= void) first_element_constraint: first_element /= void implies first_element.left = void last_element_constraint: last_element /= void implies last_element.right = void 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 TWO_WAY_LIST -- Generated by ISE Eiffel --
For more details: www.eiffel.com