Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 
deferred class
	INTERACTIVE_LIST [G]

General
	cluster: base.event
	description: 
		"Sequential, one-way linked lists that call add/remove features
		when an item is removed or added."
	keywords: "event, linked, list"

Ancestors
	LINKED_LIST [G]

Queries
	infix "@" (i: INTEGER): [like item] G
	after: BOOLEAN
	before: BOOLEAN
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER
	cursor: CURSOR
	duplicate (n: INTEGER): [like Current] INTERACTIVE_LIST [G]
	exhausted: BOOLEAN
	Extendible: BOOLEAN
	first: [like item] G
	for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	Full: BOOLEAN
	has (v: [like item] G): BOOLEAN
	i_th (i: INTEGER): [like item] G
	index: INTEGER
	index_of (v: [like item] G; i: INTEGER): INTEGER
	index_set: INTEGER_INTERVAL
	is_empty: BOOLEAN
	is_equal (other: [like Current] INTERACTIVE_LIST [G]): BOOLEAN
	is_inserted (v: G): BOOLEAN
	isfirst: BOOLEAN
	islast: BOOLEAN
	item: G
	last: [like item] G
	linear_representation: LINEAR [G]
	object_comparison: BOOLEAN
	occurrences (v: [like item] G): INTEGER
	off: BOOLEAN
	prunable: BOOLEAN
	readable: BOOLEAN
	sequential_occurrences (v: G): INTEGER
	there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	valid_cursor (p: CURSOR): BOOLEAN
	valid_cursor_index (i: INTEGER): BOOLEAN
	valid_index (i: INTEGER): BOOLEAN
	writable: BOOLEAN

Commands
	append (s: SEQUENCE [G])
	back
	compare_objects
	compare_references
	copy (other: [like Current] INTERACTIVE_LIST [G])
	do_all (action: PROCEDURE [ANY, TUPLE [G]])
	do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN])
	extend (v: [like item] G)
	fill (other: CONTAINER [G])
	finish
	force (v: [like item] G)
	forth
	go_i_th (i: INTEGER)
	go_to (p: CURSOR)
	make
	merge_left (other: [like Current] INTERACTIVE_LIST [G])
	merge_right (other: [like Current] INTERACTIVE_LIST [G])
	move (i: INTEGER)
	on_item_added (an_item: G)
	on_item_removed (an_item: G)
	prune (v: [like item] G)
	prune_all (v: [like item] G)
	put (v: [like item] G)
	put_front (v: [like item] G)
	put_i_th (v: [like item] G; i: INTEGER)
	put_left (v: [like item] G)
	put_right (v: [like item] G)
	remove
	remove_left
	remove_right
	replace (v: [like item] G)
	search (v: [like item] G)
	start
	swap (i: INTEGER)
	wipe_out

Constraints
	consistency count equal to count



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

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