Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 
indexing
	description: "Unbounded queues, implemented by resizable arrays"
	status: "See notice at end of class"
	names: dispenser, array
	representation: array
	access: fixed, fifo, membership
	size: fixed
	contents: generic
	date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $"
	revision: "$Revision: 51435 $"

class interface
	ARRAYED_QUEUE [G]

create 
	make

feature -- Initialization

	make (n: INTEGER)
			-- Create queue for at most n items.
		require
			non_negative_argument: n >= 0
		ensure
			capacity_expected: capacity = n
	
feature -- Access

	item: G
			-- Oldest item.

	has (v: like item): BOOLEAN
			-- Does queue include v?
			-- (Reference or object equality,
			-- based on object_comparison.)
	
feature -- Measurement

	count: INTEGER
			-- Number of items.

	index_set: INTEGER_INTERVAL
			-- Range of acceptable indexes
		ensure then
			count_definition: Result.count = count
	
feature -- Status report

	is_empty: BOOLEAN
			-- Is the structure empty?
			-- Was declared in ARRAYED_QUEUE as synonym of off.

	off: BOOLEAN
			-- Is the structure empty?
			-- Was declared in ARRAYED_QUEUE as synonym of is_empty.

	full: BOOLEAN
			-- Is structure filled to capacity?
			-- (Answer: no.)

	extendible: BOOLEAN
			-- May items be added? (Answer: yes.)

	prunable: BOOLEAN
			-- May items be removed? (Answer: yes.)
	
feature -- Element change

	extend (v: G)
			-- Add v as newest item.
			-- Was declared in ARRAYED_QUEUE as synonym of put and force.

	put (v: G)
			-- Add v as newest item.
			-- Was declared in ARRAYED_QUEUE as synonym of extend and force.

	force (v: G)
			-- Add v as newest item.
			-- Was declared in ARRAYED_QUEUE as synonym of extend and put.

	replace (v: like item)
			-- Replace oldest item by v.
	
feature -- Removal

	remove
			-- Remove oldest item.

	wipe_out
			-- Remove all items.
	
feature -- Conversion

	linear_representation: ARRAYED_LIST [G]
			-- Representation as a linear structure
			-- (in the original insertion order)
	
invariant

	not_full: not full
	extendible: extendible
	prunable: prunable
	empty_means_storage_empty: is_empty implies all_default

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 ARRAYED_QUEUE


Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 

-- Generated by ISE Eiffel --
For more details: www.eiffel.com