Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
class
	EG_NODE_ACTION [NODE_TYPE -> EG_NODE]

General
	cluster: events
	description: "Action sequence for node actions."
	create: default_create, make_filled

Ancestors
	EV_ACTION_SEQUENCE* [EVENT_DATA -> TUPLE create default_create end]

Action sequences
	new_filled_list (n: INTEGER_32): [like Current] EG_NODE_ACTION [NODE_TYPE]

Queries
	additional_space: INTEGER_32
	after: BOOLEAN
	all_default: BOOLEAN
	area: SPECIAL [PROCEDURE [NODE_TYPE]]
	area_v2: SPECIAL [PROCEDURE [NODE_TYPE]]
	array_at (i: INTEGER_32): PROCEDURE [NODE_TYPE]
	array_item (i: INTEGER_32): PROCEDURE [NODE_TYPE]
	array_valid_index (i: INTEGER_32): BOOLEAN
	at alias "@" (i: INTEGER_32): [like item] PROCEDURE [NODE_TYPE]
	before: BOOLEAN
	Blocked_state: INTEGER_32
	call_is_underway: BOOLEAN
	capacity: INTEGER_32
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	cursor: ARRAYED_LIST_CURSOR
	empty_actions: ARRAYED_LIST [PROCEDURE]
	ev_application: EV_APPLICATION
	ev_separate_application: separate EV_APPLICATION
	exhausted: BOOLEAN
	extendible: BOOLEAN
	first: [like item] PROCEDURE [NODE_TYPE]
	for_all (test: FUNCTION [PROCEDURE [NODE_TYPE], BOOLEAN]): BOOLEAN
	full: BOOLEAN
	Growth_percentage: INTEGER_32
	has (v: [like item] PROCEDURE [NODE_TYPE]): BOOLEAN
	has_kamikaze_action (an_action: [like item] PROCEDURE [NODE_TYPE]): BOOLEAN
	i_th alias "[]" (i: INTEGER_32): [like item] PROCEDURE [NODE_TYPE]
	index: INTEGER_32
	index_of (v: [like item] PROCEDURE [NODE_TYPE]; i: INTEGER_32): INTEGER_32
	is_empty: BOOLEAN
	is_equal (other: [like Current] EG_NODE_ACTION [NODE_TYPE]): BOOLEAN
	is_inserted (v: PROCEDURE [NODE_TYPE]): BOOLEAN
	isfirst: BOOLEAN
	islast: BOOLEAN
	item: PROCEDURE [NODE_TYPE]
	item_for_iteration: PROCEDURE [NODE_TYPE]
	last: [like first] PROCEDURE [NODE_TYPE]
	linear_representation: LINEAR [PROCEDURE [NODE_TYPE]]
	Lower: INTEGER_32
	Minimal_increase: INTEGER_32
	Mismatch_information: MISMATCH_INFORMATION
	name: detachable STRING_8
	new_cursor: ARRAYED_LIST_ITERATION_CURSOR [PROCEDURE [NODE_TYPE]]
	Normal_state: INTEGER_32
	not_empty_actions: ARRAYED_LIST [PROCEDURE]
	object_comparison: BOOLEAN
	occurrences (v: [like item] PROCEDURE [NODE_TYPE]): INTEGER_32
	off: BOOLEAN
	Paused_state: INTEGER_32
	prunable: BOOLEAN
	readable: BOOLEAN
	replaceable: BOOLEAN
	resizable: BOOLEAN
	Shared_environment: EV_ENVIRONMENT
	state: INTEGER_32
	there_exists (test: FUNCTION [PROCEDURE [NODE_TYPE], BOOLEAN]): BOOLEAN
	to_array: ARRAY [PROCEDURE [NODE_TYPE]]
	upper: INTEGER_32
	valid_cursor (p: CURSOR): BOOLEAN
	valid_cursor_index (i: INTEGER_32): BOOLEAN
	valid_index (i: INTEGER_32): BOOLEAN
	writable: BOOLEAN

Commands
	abort
	append (s: SEQUENCE [[like item] PROCEDURE [NODE_TYPE]])
	array_put (v: PROCEDURE [NODE_TYPE]; i: INTEGER_32)
	arrayed_list_make (n: INTEGER_32)
	automatic_grow
	back
	block
	call (event_data: detachable TUPLE [NODE_TYPE])
	compare_objects
	compare_references
	copy (other: [like Current] EG_NODE_ACTION [NODE_TYPE])
	correct_mismatch
	do_all (action: PROCEDURE [PROCEDURE [NODE_TYPE]])
	do_all_with_index (action: PROCEDURE [PROCEDURE [NODE_TYPE], INTEGER_32])
	do_if (action: PROCEDURE [PROCEDURE [NODE_TYPE]]; test: FUNCTION [PROCEDURE [NODE_TYPE], BOOLEAN])
	do_if_with_index (action: PROCEDURE [PROCEDURE [NODE_TYPE], INTEGER_32]; test: FUNCTION [PROCEDURE [NODE_TYPE], INTEGER_32, BOOLEAN])
	extend (v: [like item] PROCEDURE [NODE_TYPE])
	extend_kamikaze (an_item: [like item] PROCEDURE [NODE_TYPE])
	fill (other: CONTAINER [PROCEDURE [NODE_TYPE]])
	finish
	flush
	force (v: [like item] PROCEDURE [NODE_TYPE])
	force_extend (action: PROCEDURE)
	forth
	go_i_th (i: INTEGER_32)
	go_to (p: CURSOR)
	grow (i: INTEGER_32)
	make_filled (n: INTEGER_32)
	merge_left (other: [like Current] EG_NODE_ACTION [NODE_TYPE])
	merge_right (other: [like Current] EG_NODE_ACTION [NODE_TYPE])
	move (i: INTEGER_32)
	on_item_added_at (an_item: [like item] PROCEDURE [NODE_TYPE]; item_index: INTEGER_32)
	on_item_removed_at (an_item: [like item] PROCEDURE [NODE_TYPE]; item_index: INTEGER_32)
	pause
	prune (v: [like item] PROCEDURE [NODE_TYPE])
	prune_all (v: [like item] PROCEDURE [NODE_TYPE])
	prune_when_called (an_action: [like item] PROCEDURE [NODE_TYPE])
	put (v: [like item] PROCEDURE [NODE_TYPE])
	put_front (v: [like item] PROCEDURE [NODE_TYPE])
	put_i_th (v: [like i_th] PROCEDURE [NODE_TYPE]; i: INTEGER_32)
	put_left (v: [like item] PROCEDURE [NODE_TYPE])
	put_right (v: [like item] PROCEDURE [NODE_TYPE])
	remove
	remove_i_th (i: INTEGER_32)
	remove_left
	remove_right
	replace (v: [like item] PROCEDURE [NODE_TYPE])
	resize (new_capacity: INTEGER_32)
	resume
	search (v: [like item] PROCEDURE [NODE_TYPE])
	sequence_put (v: [like item] PROCEDURE [NODE_TYPE])
	start
	swap (i: INTEGER_32)
	trim
	update_for_added (start_index: INTEGER_32)
	wipe_out
	wrapper (a_node: NODE_TYPE; action: PROCEDURE)



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

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