Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 
indexing
	description: "Lists with fixed maximum numbers of items, implemented by arrays"
	status: "See notice at end of class"
	names: fixed, sequence
	representation: array
	access: index, cursor, membership
	contents: generic
	date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $"
	revision: "$Revision: 51435 $"

class interface
	FIXED_LIST [G]

create 
	make,
	make_filled

feature -- Initialization

	make (n: INTEGER)
			-- Create an empty list.
		ensure
			is_before: before
			new_count: count = 0

	make_filled (n: INTEGER)
			-- Create a list with n void elements.
		ensure
			is_before: before
			new_count: count = n
	
feature -- Access

	index: INTEGER
			-- Current position in the list

	item: G
			-- Current item

	first: G
			-- Item at first position

	last: like first
			-- Item at last position

	cursor: CURSOR
			-- Current cursor position
	
feature -- Measurement

	count: INTEGER
	
feature -- Status report

	extendible: BOOLEAN
			-- May new items be added?

	prunable: BOOLEAN
			-- May items be removed?

	full: BOOLEAN
			-- Is the list full?

	valid_cursor (p: CURSOR): BOOLEAN
			-- Is p a valid cursor?
	
feature -- Cursor movement

	move (i: INTEGER)
			-- Move cursor i positions.

	start
			-- Move cursor to first position.

	finish
			-- Move cursor to last position.

	forth
			-- Move cursor to next position, if any.

	back
			-- Move cursor to previous position, if any.

	go_i_th (i: INTEGER)
			-- Move cursor to i-th position.

	go_to (p: CURSOR)
			-- Move cursor to element remembered in p.
	
feature -- Element change

	put (v: like first)
			-- Replace current item by v.
			-- (Synonym for replace)
		require else
			True

	replace (v: like first)
			-- Replace current item by v.

	extend (v: like item)
			-- Add v to end.
			-- Move index to the current item.

	remove
			-- Remove current item.
			-- Move cursor to right neighbor
			-- (or after if no right neighbor)
	
feature -- Transformation

	swap (i: INTEGER)
			-- Exchange item at i-th position with item
			-- at cursor position.
	
feature -- Duplication

	duplicate (n: INTEGER): like Current
			-- Copy of sub-list beginning at cursor position
			-- and having min (n, count - index + 1) items
	
invariant

	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 FIXED_LIST


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

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