Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
class
	FIXED_AUTOMATON [S -> detachable STATE]

General
	cluster: lex
	description: "General finite-state automata, implemented by arrays"
	create: make

Ancestors
	ARRAY [G]

Queries
	additional_space: INTEGER_32
	all_default: BOOLEAN
	area: SPECIAL [S]
	at alias "@" (i: INTEGER_32): S
	capacity: INTEGER_32
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	entry (i: INTEGER_32): S
	extendible: BOOLEAN
	filled_with (v: S): BOOLEAN
	for_all (test: FUNCTION [ANY, TUPLE [S], BOOLEAN]): BOOLEAN
	full: BOOLEAN
	Growth_percentage: INTEGER_32
	has (v: S): BOOLEAN
	index_set: INTEGER_INTERVAL
	is_empty: BOOLEAN
	is_equal (other: [attached like Current] attached FIXED_AUTOMATON [S]): BOOLEAN
	is_inserted (v: S): BOOLEAN
	item alias "[]" (i: INTEGER_32): S
	last_position: INTEGER_32
	linear_representation: LINEAR [S]
	lower: INTEGER_32
	Minimal_increase: INTEGER_32
	new_cursor: INDEXABLE_ITERATION_CURSOR [S]
	object_comparison: BOOLEAN
	occurrences (v: S): INTEGER_32
	prunable: BOOLEAN
	resizable: BOOLEAN
	same_items (other: [attached like Current] attached FIXED_AUTOMATON [S]): BOOLEAN
	subarray (start_pos, end_pos: INTEGER_32): ARRAY [S]
	there_exists (test: FUNCTION [ANY, TUPLE [S], BOOLEAN]): BOOLEAN
	to_c: ANY
	to_cil: NATIVE_ARRAY [S]
	to_special: SPECIAL [S]
	upper: INTEGER_32
	valid_index (i: INTEGER_32): BOOLEAN
	valid_index_set: BOOLEAN

Commands
	add_right (s: S)
	automatic_grow
	clear_all
	compare_objects
	compare_references
	conservative_resize_with_default (a_default_value: S; min_index, max_index: INTEGER_32)
	copy (other: [attached like Current] attached FIXED_AUTOMATON [S])
	discard_items
	do_all (action: PROCEDURE [ANY, TUPLE [S]])
	do_all_with_index (action: PROCEDURE [ANY, TUPLE [S, INTEGER_32]])
	do_if (action: PROCEDURE [ANY, TUPLE [S]]; test: FUNCTION [ANY, TUPLE [S], BOOLEAN])
	do_if_with_index (action: PROCEDURE [ANY, TUPLE [S, INTEGER_32]]; test: FUNCTION [ANY, TUPLE [S, INTEGER_32], BOOLEAN])
	enter (v: [like item] S; i: INTEGER_32)
	fill (other: CONTAINER [S])
	fill_with (v: S)
	force (v: [like item] S; i: INTEGER_32)
	grow (i: INTEGER_32)
	keep_head (n: INTEGER_32)
	keep_tail (n: INTEGER_32)
	make (i, s: INTEGER_32)
	make_empty
	make_filled (a_default_value: S; min_index, max_index: INTEGER_32)
	make_from_array (a: ARRAY [S])
	make_from_cil (na: NATIVE_ARRAY [[like item] S])
	make_from_special (a: SPECIAL [S])
	prune_all (v: S)
	put (v: [like item] S; i: INTEGER_32)
	rebase (a_lower: [like lower] INTEGER_32)
	remove_head (n: INTEGER_32)
	remove_tail (n: INTEGER_32)
	set_final (state, f: INTEGER_32)
	subcopy (other: ARRAY [[like item] S]; start_pos, end_pos, index_pos: INTEGER_32)
	trim



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

-- Generated by Eiffel Studio --
For more details: docs.eiffel.com