Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class LINKED_AUTOMATON [S -> STATE] General cluster: lex description: "General finite state automata, implemented as lists" create: make Ancestors LINKED_LIST [G] Queries after: BOOLEAN at alias "@" (i: INTEGER_32): [like item] S before: BOOLEAN changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: LINKED_LIST_CURSOR [S] exhausted: BOOLEAN extendible: BOOLEAN first: [like item] S for_all (test: FUNCTION [S, BOOLEAN]): BOOLEAN Full: BOOLEAN has (v: [like item] S): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] S index: INTEGER_32 index_of (v: [like item] S; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] LINKED_AUTOMATON [S]): BOOLEAN is_inserted (v: S): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: S item_for_iteration: S last: [like item] S linear_representation: LINEAR [S] Lower: INTEGER_32 new_cursor: LINKED_LIST_ITERATION_CURSOR [S] object_comparison: BOOLEAN occurrences (v: [like item] S): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN sequential_has (v: [like item] S): BOOLEAN sequential_index_of (v: [like item] S; i: INTEGER_32): INTEGER_32 sequential_occurrences (v: [like item] S): INTEGER_32 there_exists (test: FUNCTION [S, 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 [S]) back chain_wipe_out compare_objects compare_references copy (other: [like Current] LINKED_AUTOMATON [S]) do_all (action: PROCEDURE [S]) do_if (action: PROCEDURE [S]; test: FUNCTION [S, BOOLEAN]) extend (v: [like item] S) fill (other: CONTAINER [S]) finish force (v: [like item] S) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) merge_left (other: [like Current] LINKED_AUTOMATON [S]) merge_right (other: [like Current] LINKED_AUTOMATON [S]) move (i: INTEGER_32) prune (v: [like item] S) prune_all (v: [like item] S) put (v: [like item] S) put_front (v: [like item] S) put_i_th (v: [like item] S; i: INTEGER_32) put_left (v: [like item] S) put_right (v: [like item] S) remove remove_i_th (i: INTEGER_32) remove_left remove_right replace (v: [like item] S) search (v: [like item] S) sequence_put (v: [like item] S) set_final (state, f: INTEGER_32) 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