Automatic generation produced by ISE Eiffel
indexing description: "Unbounded stacks implemented as linked lists" status: "See notice at end of class" names: linked_stack, dispenser, linked_list representation: linked access: fixed, lifo, membership contents: generic date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" class interface LINKED_STACK [G] create make feature -- Access item: G -- Item at the first position feature -- Element change force (v: like item) -- Push v onto top. extend (v: like item) -- Push v onto top. put (v: like item) feature -- Removal remove -- Remove item on top. feature -- Conversion linear_representation: ARRAYED_LIST [G] -- Representation as a linear structure -- (order is reverse of original order of insertion) feature -- Duplication duplicate (n: INTEGER): like Current -- New stack containing the n latest items inserted -- in current stack. -- If n is greater than count, identical to current stack. require else positive_argument: n > 0 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 LINKED_STACK -- Generated by ISE Eiffel --
For more details: www.eiffel.com