INDEX CLUSTER FEATURES SHORT FRAMES NO FRAMES

indexing

description: "Unbounded stacks implemented as linked lists"
title: "EiffelBase: library of reusable components for Eiffel. ", "Based on EiffelBase library for ISE Eiffel, ", "used with permission. "
project: "EiffelBase Library"
copyright: "(c) 1986-1997 Interactive Software Engineering Inc. ", "Modifications and extensions: ", "(c) 1997 Object Tools ", "All rights reserved. Duplication and distribution prohibited", "May be used only with Visual Eiffel under terms of user ", "license "
key: linked_stack, dispenser, linked_list
cluster: eiffelbase
class LINKED_STACK [G]
inherit

STACK [G]
undefine
replace
select
item,
put,
remove
end

LINKED_LIST [G]
rename
item as ll_item,
remove as ll_remove,
put as ll_put
export
{NONE}
all
{ANY}
count,
extendible,
make,
readable,
wipe_out,
writable
undefine
append,
fill,
linear_representation,
prune_all,
readable,
writable
redefine
duplicate,
extend,
force
end
creation

make
feature -- Access

item: G
-- Item at the first position
feature -- Element change

force (v: G)
-- Push `v' onto top.

extend (v: G)
-- Push `v' onto top.

put (v: G)
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
positive_argument: n > 0
end -- class LINKED_STACK

INDEX CLUSTER FEATURES SHORT FRAMES NO FRAMES