    class
    	LEX_ARRAY [T]

    General
    	cluster: lex
    	description: "One-dimensional arrays for lexical analysis"
    	create: make

    Ancestors
    	ARRAY [G]

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

    Commands
    	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] LEX_ARRAY [T])
    	discard_items
    	do_all (action: PROCEDURE [ANY, TUPLE [T]])
    	do_if (action: PROCEDURE [ANY, TUPLE [T]]; test: FUNCTION [ANY, TUPLE [T], BOOLEAN])
    	enter (v: [like item] T; i: INTEGER_32)
    	fill (other: CONTAINER [T])
    	force (v: [like item] T; i: INTEGER_32)
    	grow (i: INTEGER_32)
    	make (lower_index, upper_index: INTEGER_32)
    	make_from_array (a: ARRAY [T])
    	make_from_cil (na: NATIVE_ARRAY [[like item] T])
    	prune_all (v: T)
    	put (v: [like item] T; i: INTEGER_32)
    	subcopy (other: ARRAY [[like item] T]; start_pos, end_pos, index_pos: INTEGER_32)