Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
class
	TWO_WAY_LIST [G]

General
	cluster: elks
	description: "Sequential, two-way linked lists"
	create: make, make_from_iterable, make_sublist

Ancestors
	LINKED_LIST [G]

Queries
	after: BOOLEAN
	at alias "@" (i: INTEGER_32): [like item] G
	before: BOOLEAN
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	cursor: TWO_WAY_LIST_CURSOR [G]
	exhausted: BOOLEAN
	extendible: BOOLEAN
	first: [like item] G
	first_element: [detachable like new_cell] detachable BI_LINKABLE [G]
	for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN
	Full: BOOLEAN
	has (v: [like item] G): BOOLEAN
	i_th alias "[]" (i: INTEGER_32): [like item] G
	index: INTEGER_32
	index_of (v: [like item] G; i: INTEGER_32): INTEGER_32
	is_empty: BOOLEAN
	is_equal (other: [like Current] TWO_WAY_LIST [G]): BOOLEAN
	is_inserted (v: G): BOOLEAN
	isfirst: BOOLEAN
	islast: BOOLEAN
	item: G
	item_for_iteration: G
	last: [like item] G
	last_element: [like first_element] detachable BI_LINKABLE [G]
	linear_representation: LINEAR [G]
	Lower: INTEGER_32
	new_cursor: TWO_WAY_LIST_ITERATION_CURSOR [G]
	object_comparison: BOOLEAN
	occurrences (v: [like item] G): INTEGER_32
	off: BOOLEAN
	prunable: BOOLEAN
	readable: BOOLEAN
	replaceable: BOOLEAN
	sublist: [detachable like Current] detachable TWO_WAY_LIST [G]
	there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN
	valid_cursor (p: CURSOR): BOOLEAN
	valid_cursor_index (i: INTEGER_32): BOOLEAN
	valid_index (i: INTEGER_32): BOOLEAN
	writable: BOOLEAN

Commands
	append (s: SEQUENCE [G])
	back
	compare_objects
	compare_references
	copy (other: [like Current] TWO_WAY_LIST [G])
	do_all (action: PROCEDURE [G])
	do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN])
	extend (v: [like item] G)
	fill (other: CONTAINER [G])
	finish
	force (v: [like item] G)
	forth
	go_i_th (i: INTEGER_32)
	go_to (p: CURSOR)
	merge_left (other: [like Current] TWO_WAY_LIST [G])
	merge_right (other: [like Current] TWO_WAY_LIST [G])
	move (i: INTEGER_32)
	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_32)
	put_left (v: [like item] G)
	put_right (v: [like item] G)
	remove
	remove_i_th (i: INTEGER_32)
	remove_left
	remove_right
	remove_sublist
	replace (v: [like item] G)
	search (v: [like item] G)
	sequence_put (v: [like item] G)
	split (n: INTEGER_32)
	start
	swap (i: INTEGER_32)
	wipe_out

Constraints
	non empty list has two endpoints
	empty list has no endpoints
	first element constraint
	last element constraint



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

-- Generated by Eiffel Studio --
For more details: eiffel.org