Automatic generation produced by ISE Eiffel

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

General
	cluster: base.structures.cursor_tree
	description: "Cursor trees in linked representation"
	create: make_root, make

Ancestors
	RECURSIVE_CURSOR_TREE [G]

Queries
	above: BOOLEAN
	after: BOOLEAN
	arity: INTEGER
	before: BOOLEAN
	below: BOOLEAN
	breadth: INTEGER
	changeable_comparison_criterion: BOOLEAN
	child_item (i: INTEGER): G
	child_tree (i: INTEGER): [like Current] LINKED_CURSOR_TREE [G]
	count: INTEGER
	cursor: CURSOR
	depth: INTEGER
	exhausted: BOOLEAN
	extendible: BOOLEAN
	for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	Full: BOOLEAN
	has (v: G): BOOLEAN
	index_of (v: [like item] G; i: INTEGER): INTEGER
	is_empty: BOOLEAN
	is_inserted (v: G): BOOLEAN
	is_leaf: BOOLEAN
	is_root: BOOLEAN
	isfirst: BOOLEAN
	islast: BOOLEAN
	item: G
	level: INTEGER
	linear_for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	linear_representation: LINEAR [G]
	linear_there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	object_comparison: BOOLEAN
	occurrences (v: G): INTEGER
	off: BOOLEAN
	parent_item: G
	parent_tree: [like Current] LINKED_CURSOR_TREE [G]
	Prunable: BOOLEAN
	readable: BOOLEAN
	subtree: [like Current] LINKED_CURSOR_TREE [G]
	there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	valid_cursor (p: CURSOR): BOOLEAN
	valid_cursor_index (i: INTEGER): BOOLEAN
	writable: BOOLEAN

Commands
	back
	breadth_forth
	compare_objects
	compare_references
	container_fill (other: CONTAINER [G])
	do_all (action: PROCEDURE [ANY, TUPLE [G]])
	do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN])
	down (i: INTEGER)
	extend (v: G)
	fill (other: CURSOR_TREE [G])
	fill_from_active (other: CURSOR_TREE [G])
	forth
	go_last_child
	go_to (p: CURSOR)
	level_back
	level_forth
	linear_do_all (action: PROCEDURE [ANY, TUPLE [G]])
	linear_do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN])
	make
	make_root (v: G)
	merge_left (other: CURSOR_TREE [G])
	merge_right (other: CURSOR_TREE [G])
	postorder_forth
	postorder_start
	preorder_forth
	put (v: G)
	put_child (v: G)
	put_left (v: G)
	put_right (v: G)
	put_root (v: G)
	remove
	replace (v: G)
	search (v: [like item] G)
	start
	start_on_level (l: INTEGER)
	up
	wipe_out



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

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