class FIXED_AUTOMATON [S -> 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] capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 entry (i: INTEGER_32): S extendible: BOOLEAN for_all (test: FUNCTION [ANY, TUPLE [S], BOOLEAN]): BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: S): BOOLEAN index_set: INTEGER_INTERVAL infix "@" (i: INTEGER_32): S is_empty: BOOLEAN is_equal (other: [like Current] 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 object_comparison: BOOLEAN occurrences (v: S): INTEGER_32 prunable: BOOLEAN resizable: BOOLEAN same_items (other: [like Current] 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) array_make (min_index, max_index: INTEGER_32) automatic_grow clear_all compare_objects compare_references conservative_resize (min_index, max_index: INTEGER_32) copy (other: [like Current] FIXED_AUTOMATON [S]) discard_items do_all (action: PROCEDURE [ANY, TUPLE [S]]) do_if (action: PROCEDURE [ANY, TUPLE [S]]; test: FUNCTION [ANY, TUPLE [S], BOOLEAN]) enter (v: [like item] S; i: INTEGER_32) fill (other: CONTAINER [S]) force (v: [like item] S; i: INTEGER_32) grow (i: INTEGER_32) make (i, s: INTEGER_32) make_from_array (a: ARRAY [S]) make_from_cil (na: NATIVE_ARRAY [[like item] S]) prune_all (v: S) put (v: [like item] S; i: INTEGER_32) set_final (state, f: INTEGER_32) subcopy (other: ARRAY [[like item] S]; start_pos, end_pos, index_pos: INTEGER_32)