Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class LEX_ARRAY [T] General cluster: lex description: "One-dimensional arrays for lexical analysis" create: make_filled, make_empty Ancestors ARRAY [G] Queries additional_space: INTEGER_32 all_default: BOOLEAN area: SPECIAL [T] at alias "@" (i: INTEGER_32): T capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 entry (i: INTEGER_32): T extendible: BOOLEAN filled_with (v: T): BOOLEAN for_all (test: FUNCTION [T, BOOLEAN]): BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: T): BOOLEAN 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 new_cursor: ARRAY_ITERATION_CURSOR [T] 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 [T, BOOLEAN]): BOOLEAN to_c: ANY to_cil: NATIVE_ARRAY [T] to_special: SPECIAL [T] upper: INTEGER_32 valid_index (i: INTEGER_32): BOOLEAN Commands automatic_grow bag_put (v: T) clear_all compare_objects compare_references conservative_resize_with_default (a_default_value: T; min_index, max_index: INTEGER_32) copy (other: [like Current] LEX_ARRAY [T]) discard_items do_all (action: PROCEDURE [T]) do_all_with_index (action: PROCEDURE [T, INTEGER_32]) do_if (action: PROCEDURE [T]; test: FUNCTION [T, BOOLEAN]) do_if_with_index (action: PROCEDURE [T, INTEGER_32]; test: FUNCTION [T, INTEGER_32, BOOLEAN]) enter (v: [like item] T; i: INTEGER_32) extend (v: T) fill (other: CONTAINER [T]) fill_with (v: T) force (v: [like item] T; i: INTEGER_32) force_and_fill (v: [like item] T; i: INTEGER_32) grow (i: INTEGER_32) keep_head (n: INTEGER_32) keep_tail (n: INTEGER_32) make_empty make_filled (a_default_value: T; min_index, max_index: INTEGER_32) make_from_array (a: ARRAY [T]) make_from_cil (na: NATIVE_ARRAY [[like item] T]) make_from_special (a: SPECIAL [T]) prune (v: T) prune_all (v: T) put (v: [like item] T; i: INTEGER_32) rebase (a_lower: [like lower] INTEGER_32) remove_head (n: INTEGER_32) remove_tail (n: INTEGER_32) subcopy (other: ARRAY [[like item] T]; 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: eiffel.org