Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
deferred class
	EV_TREE_NODE_LIST

General
	cluster: interface
	description: "Base class for EV_TREE and EV_TREE_ITEM."

Ancestors
	EV_ITEM_LIST* [G -> EV_ITEM]

Queries
	after: BOOLEAN
	at alias "@" (i: INTEGER_32): [like item] EV_TREE_NODE
	before: BOOLEAN
	Changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	cursor: EV_DYNAMIC_LIST_CURSOR [EV_TREE_NODE]
	data: detachable ANY
	debug_output: STRING_32
	default_identifier_name: STRING_32
	exhausted: BOOLEAN
	extendible: BOOLEAN
	first: [like item] EV_TREE_NODE
	for_all (test: FUNCTION [EV_TREE_NODE, BOOLEAN]): BOOLEAN
	Full: BOOLEAN
	full_identifier_path: STRING_32
	has (v: [like item] EV_TREE_NODE): BOOLEAN
	has_identifier_name_set: BOOLEAN
	has_parent: BOOLEAN
	has_recursively (an_item: EV_TREE_NODE): BOOLEAN
	i_th alias "[]" (i: INTEGER_32): [like item] EV_TREE_NODE
	identifier_name: STRING_32
	index: INTEGER_32
	index_of (v: [like item] EV_TREE_NODE; i: INTEGER_32): INTEGER_32
	is_destroyed: BOOLEAN
	is_empty: BOOLEAN
	is_equal (other: [like Current] EV_TREE_NODE_LIST): BOOLEAN
	is_inserted (v: EV_TREE_NODE): BOOLEAN
	is_parent_recursive (a_list: [like item] EV_TREE_NODE): BOOLEAN
	isfirst: BOOLEAN
	islast: BOOLEAN
	item: EV_TREE_NODE
	item_for_iteration: EV_TREE_NODE
	last: [like item] EV_TREE_NODE
	linear_representation: LINEAR [EV_TREE_NODE]
	Lower: INTEGER_32
	new_cursor: INDEXABLE_ITERATION_CURSOR [EV_TREE_NODE]
	object_comparison: BOOLEAN
	occurrences (v: [like item] EV_TREE_NODE): INTEGER_32
	off: BOOLEAN
	parent: detachable EV_CONTAINABLE
	prunable: BOOLEAN
	readable: BOOLEAN
	replaceable: BOOLEAN
	retrieve_item_by_data (some_data: ANY; should_compare_objects: BOOLEAN): detachable EV_TREE_NODE
	retrieve_item_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): detachable EV_TREE_NODE
	retrieve_items_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE]
	retrieve_items_recursively_by_data (some_data: ANY; should_compare_objects: BOOLEAN): ARRAYED_LIST [EV_TREE_NODE]
	same (other: EV_ANY): BOOLEAN
	there_exists (test: FUNCTION [EV_TREE_NODE, 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 [[like item] EV_TREE_NODE])
	back
	compare_objects
	compare_references
	destroy
	dl_append (s: SEQUENCE [EV_TREE_NODE])
	dl_extend (v: [like item] EV_TREE_NODE)
	dl_force (v: [like item] EV_TREE_NODE)
	dl_prune (v: [like item] EV_TREE_NODE)
	dl_put_front (v: [like item] EV_TREE_NODE)
	dl_put_i_th (v: [like item] EV_TREE_NODE; i: INTEGER_32)
	dl_put_left (v: [like item] EV_TREE_NODE)
	dl_put_right (v: [like item] EV_TREE_NODE)
	dl_replace (v: [like item] EV_TREE_NODE)
	do_all (action: PROCEDURE [EV_TREE_NODE])
	do_if (action: PROCEDURE [EV_TREE_NODE]; test: FUNCTION [EV_TREE_NODE, BOOLEAN])
	extend (v: [like item] EV_TREE_NODE)
	fill (other: CONTAINER [EV_TREE_NODE])
	finish
	force (v: [like item] EV_TREE_NODE)
	forth
	go_i_th (i: INTEGER_32)
	go_to (p: CURSOR)
	merge_left (other: [like Current] EV_TREE_NODE_LIST)
	merge_right (other: [like Current] EV_TREE_NODE_LIST)
	move (i: INTEGER_32)
	prune (v: [like item] EV_TREE_NODE)
	prune_all (v: [like item] EV_TREE_NODE)
	put (v: [like item] EV_TREE_NODE)
	put_front (v: [like item] EV_TREE_NODE)
	put_i_th (v: [like item] EV_TREE_NODE; i: INTEGER_32)
	put_left (v: [like item] EV_TREE_NODE)
	put_right (v: [like item] EV_TREE_NODE)
	recursive_do_all (action: PROCEDURE [EV_TREE_NODE])
	remove
	remove_i_th (i: INTEGER_32)
	remove_left
	remove_right
	replace (v: [like item] EV_TREE_NODE)
	search (v: [like item] EV_TREE_NODE)
	sequence_put (v: [like item] EV_TREE_NODE)
	set_data (some_data: [like data] detachable ANY)
	set_identifier_name (a_name: READABLE_STRING_GENERAL)
	start
	swap (i: INTEGER_32)
	wipe_out



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

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