indexing
	description: "Stacks (Last-In, First-Out) implemented with linked cells"
	library: "Gobo Eiffel Structure Library"
	author: "Eric Bezault <ericb@gobo.demon.co.uk>"
	copyright: "Copyright (c) 1997, Eric Bezault"

class interface
	DS_LINKED_STACK [G]

create 

	make
			-- (from DS_LINKED_LIST)
		ensure -- from DS_LINKED_LIST
			empty: is_empty

	make_equal
			-- (from DS_LINKED_LIST)
		ensure -- from DS_LINKED_LIST
			empty: is_empty

feature -- Access

	item: G
			-- First item in list
			-- (from DS_LINKED_LIST)
		require -- from DS_LINEAR
			not_empty: not is_empty
		require -- from DS_EXTENDIBLE
			not_empty: not is_empty
		ensure -- from DS_LINEAR
			has_first: has (Result)

	searcher: DS_LINKED_LIST_SEARCHER [G]
			-- Stack searcher
	
feature -- Measurement

	count: INTEGER
			-- Number of items in list
			-- (from DS_LINKED_LIST)

	occurrences (v: G): INTEGER
			-- Number of times v appears in structure
			-- (Use searcher's comparison criterion.)
			-- (from DS_SEARCHABLE)
		ensure -- from DS_SEARCHABLE
			positive: Result >= 0;
			has: has (v) implies Result >= 1
	
feature -- Comparison

	is_equal (other: like Current): BOOLEAN
			-- Is list equal to other?
			-- (from DS_LINKED_LIST)
		require -- from GENERAL
			other_not_void: other /= void
		ensure -- from GENERAL
			symmetric: Result implies other.is_equal (Current);
			consistent: standard_is_equal (other) implies Result
		ensure then -- from DS_CONTAINER
			same_count: Result implies count = other.count
	
feature -- Status report

	extendible (nb: INTEGER): BOOLEAN
			-- May list be extended with nb items?
			-- (from DS_LINKED_LIST)
		require -- from DS_EXTENDIBLE
			positive_n: n >= 0

	has (v: G): BOOLEAN
			-- Does structure incluse v?
			-- (Use searcher's comparison criterion.)
			-- (from DS_SEARCHABLE)
		ensure -- from DS_SEARCHABLE
			not_empty: Result implies not is_empty

	is_empty: BOOLEAN
			-- Is structure empty?
			-- (from DS_CONTAINER)
	
feature -- Element change

	append (other: DS_LINEAR [G])
			-- Add items of other to beginning of list.
			-- Was declared in DS_LINKED_LIST as synonym of extend_first and append_first.
			-- (from DS_LINKED_LIST)
		require -- from DS_EXTENDIBLE
			other_not_void: other /= void
		ensure -- from DS_EXTENDIBLE
			new_count: count = old count + other.count

	extend (other: DS_LINEAR [G])
			-- Add items of other to beginning of list.
			-- Was declared in DS_LINKED_LIST as synonym of extend_first and append_first.
			-- (from DS_LINKED_LIST)
		require -- from DS_EXTENDIBLE
			other_not_void: other /= void;
			extendible: extendible (other.count)
		ensure -- from DS_EXTENDIBLE
			new_count: count = old count + other.count

	force (v: G)
			-- Add v to beginning of list.
			-- Was declared in DS_LINKED_LIST as synonym of put_first and force_first.
			-- (from DS_LINKED_LIST)
		ensure then -- from DS_DYNAMIC
			inserted: item = v
		ensure then -- from DS_INDEXABLE
			inserted: item = v
		ensure -- from DS_EXTENDIBLE
			one_more: count = old count + 1
		ensure then -- from DS_STACK
			pushed: item = v

	put (v: G)
			-- Add v to beginning of list.
			-- Was declared in DS_LINKED_LIST as synonym of put_first and force_first.
			-- (from DS_LINKED_LIST)
		require -- DS_DYNAMIC
			precursor: True
		require -- from DS_EXTENDIBLE
			extendible: extendible (1)
		ensure then -- from DS_DYNAMIC
			inserted: item = v
		ensure then -- from DS_INDEXABLE
			inserted: item = v
		ensure -- from DS_EXTENDIBLE
			one_more: count = old count + 1
		ensure then -- from DS_STACK
			pushed: item = v

	replace (v: G)
			-- Replace top item by v.
		require -- from DS_STACK
			not_empty: not is_empty
		ensure -- from DS_STACK
			same_count: count = old count;
			replaced: item = v
	
feature -- Removal

	keep (n: INTEGER)
			-- Keep n last items in list.
			-- (from DS_LINKED_LIST)
		require -- from DS_DYNAMIC
			valid_n: 0 <= n and n <= count
		require -- from DS_INDEXABLE
			valid_n: 0 <= n and n <= count
		ensure -- from DS_DYNAMIC
			new_count: count = n
		ensure -- from DS_INDEXABLE
			new_count: count = n

	prune (n: INTEGER)
			-- Remove n first items from list.
			-- (from DS_LINKED_LIST)
		require -- from DS_EXTENDIBLE
			valid_n: 0 <= n and n <= count
		ensure -- from DS_EXTENDIBLE
			new_count: count = old count - n

	remove
			-- Remove item at beginning of list.
			-- (from DS_LINKED_LIST)
		require -- from DS_EXTENDIBLE
			not_empty: not is_empty
		ensure -- from DS_EXTENDIBLE
			one_less: count = old count - 1

	wipe_out
			-- Remove all items from list.
			-- (from DS_LINKED_LIST)
		ensure -- from DS_CONTAINER
			wipe_out: is_empty
	
feature -- Duplication

	copy (other: like Current)
			-- Copy other to list.
			-- (from DS_LINKED_LIST)
		require -- from GENERAL
			other_not_void: other /= void;
			type_identity: same_type (other)
		ensure -- from GENERAL
			is_equal: is_equal (other)
	
feature -- Setting

	set_searcher (a_searcher: like searcher)
			-- Set searcher to a_searcher.
			-- (from DS_SEARCHABLE)
		require -- from DS_SEARCHABLE
			a_searcher_not_void: a_searcher /= void
		ensure -- from DS_SEARCHABLE
			searcher_set: searcher = a_searcher
	
invariant

		-- from GENERAL
	reflexive_equality: standard_is_equal (Current);
	reflexive_conformance: conforms_to (Current);
		-- from DS_CONTAINER
	positive_count: count >= 0;
	empty_definition: is_empty = (count = 0);
		-- from DS_SEARCHABLE
	searcher_not_void: searcher /= void;

end -- class DS_LINKED_STACK