Automatic generation produced by ISE Eiffel
note description: "Unbounded stacks implemented as linked lists" library: "Free implementation of ELKS library" legal: "See notice at end of class." status: "See notice at end of class." names: linked_stack, dispenser, linked_list representation: linked access: fixed, lifo, membership contents: generic date: "$Date: 2012-05-23 21:13:10 -0700 (Wed, 23 May 2012) $" revision: "$Revision: 91981 $" 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) -- Push `v' onto top. 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_32): 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 note copyright: "Copyright (c) 1984-2012, Eiffel Software and others" license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)" source: "[ Eiffel Software 5949 Hollister Ave., Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Website http://www.eiffel.com Customer support http://support.eiffel.com ]" end -- class LINKED_STACK -- Generated by ISE Eiffel --
For more details: www.eiffel.com