Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class FIXED_DFA General cluster: lex description: "Deterministic finite automata" create: make Ancestors DFA* FIXED_AUTOMATON [S -> detachable STATE] Queries additional_space: INTEGER_32 all_default: BOOLEAN area: SPECIAL [detachable STATE_OF_DFA] at alias "@" (i: INTEGER_32): detachable STATE_OF_DFA capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 entry (i: INTEGER_32): detachable STATE_OF_DFA extendible: BOOLEAN filled_with (v: detachable STATE_OF_DFA): BOOLEAN find_successor (source, input_doc: INTEGER_32): detachable STATE_OF_DFA for_all (test: FUNCTION [detachable STATE_OF_DFA, BOOLEAN]): BOOLEAN full: BOOLEAN greatest_input: INTEGER_32 Growth_percentage: INTEGER_32 has (v: detachable STATE_OF_DFA): BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] FIXED_DFA): BOOLEAN is_inserted (v: detachable STATE_OF_DFA): BOOLEAN item alias "[]" (i: INTEGER_32): detachable STATE_OF_DFA last_position: INTEGER_32 linear_representation: LINEAR [detachable STATE_OF_DFA] lower: INTEGER_32 Minimal_increase: INTEGER_32 nb_states: INTEGER_32 new_cursor: ARRAY_ITERATION_CURSOR [detachable STATE_OF_DFA] object_comparison: BOOLEAN occurrences (v: detachable STATE_OF_DFA): INTEGER_32 possible_tokens (l: LINKED_LIST [INTEGER_32]): detachable ARRAY [INTEGER_32] prunable: BOOLEAN recognize (l: LINKED_LIST [INTEGER_32]): INTEGER_32 resizable: BOOLEAN same_items (other: [like Current] FIXED_DFA): BOOLEAN start_number: INTEGER_32 subarray (start_pos, end_pos: INTEGER_32): ARRAY [detachable STATE_OF_DFA] there_exists (test: FUNCTION [detachable STATE_OF_DFA, BOOLEAN]): BOOLEAN to_c: ANY to_cil: NATIVE_ARRAY [detachable STATE_OF_DFA] to_special: SPECIAL [detachable STATE_OF_DFA] upper: INTEGER_32 valid_index (i: INTEGER_32): BOOLEAN Commands add_right (s: detachable STATE_OF_DFA) array_make_filled (a_default_value: detachable STATE_OF_DFA; min_index, max_index: INTEGER_32) automatic_grow bag_put (v: detachable STATE_OF_DFA) clear_all compare_objects compare_references conservative_resize_with_default (a_default_value: detachable STATE_OF_DFA; min_index, max_index: INTEGER_32) copy (other: [like Current] FIXED_DFA) discard_items do_all (action: PROCEDURE [detachable STATE_OF_DFA]) do_all_with_index (action: PROCEDURE [detachable STATE_OF_DFA, INTEGER_32]) do_if (action: PROCEDURE [detachable STATE_OF_DFA]; test: FUNCTION [detachable STATE_OF_DFA, BOOLEAN]) do_if_with_index (action: PROCEDURE [detachable STATE_OF_DFA, INTEGER_32]; test: FUNCTION [detachable STATE_OF_DFA, INTEGER_32, BOOLEAN]) enter (v: [like item] detachable STATE_OF_DFA; i: INTEGER_32) extend (v: detachable STATE_OF_DFA) f_set_final (state, f: INTEGER_32) fill (other: CONTAINER [detachable STATE_OF_DFA]) fill_with (v: detachable STATE_OF_DFA) force (v: [like item] detachable STATE_OF_DFA; i: INTEGER_32) force_and_fill (v: [like item] detachable STATE_OF_DFA; i: INTEGER_32) grow (i: INTEGER_32) keep_head (n: INTEGER_32) keep_tail (n: INTEGER_32) make_empty make_from_array (a: ARRAY [detachable STATE_OF_DFA]) make_from_cil (na: NATIVE_ARRAY [[like item] detachable STATE_OF_DFA]) make_from_special (a: SPECIAL [detachable STATE_OF_DFA]) prune (v: detachable STATE_OF_DFA) prune_all (v: detachable STATE_OF_DFA) put (v: [like item] detachable STATE_OF_DFA; 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) set_start (n: INTEGER_32) set_state set_transition (source, input_doc, target: INTEGER_32) subcopy (other: ARRAY [[like item] detachable STATE_OF_DFA]; start_pos, end_pos, index_pos: INTEGER_32) trace trim
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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