Automatic generation produced by ISE Eiffel
class FIXED_LIST [G] General cluster: base.structures.list description: "Lists with fixed maximum numbers of items, implemented by arrays" create: make_filled, make Ancestors ARRAY [G] FIXED [G] LIST [G] Queries infix "@" (i: INTEGER): G after: BOOLEAN area: SPECIAL [G] before: BOOLEAN capacity: INTEGER changeable_comparison_criterion: BOOLEAN count: INTEGER cursor: CURSOR duplicate (n: INTEGER): [like Current] FIXED_LIST [G] exhausted: BOOLEAN extendible: BOOLEAN first: G for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN full: BOOLEAN has (v: G): BOOLEAN i_th (i: INTEGER): G index: INTEGER index_of (v: [like item] G; i: INTEGER): INTEGER index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_equal (other: [like Current] FIXED_LIST [G]): BOOLEAN is_inserted (v: G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G last: [like first] G linear_representation: LINEAR [G] object_comparison: BOOLEAN occurrences (v: G): INTEGER off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN Resizable: BOOLEAN sequential_occurrences (v: G): INTEGER there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER): BOOLEAN valid_index (i: INTEGER): BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) back compare_objects compare_references copy (other: [like Current] FIXED_LIST [G]) do_all (action: PROCEDURE [ANY, TUPLE [G]]) do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN]) extend (v: [like item] G) finish forth go_i_th (i: INTEGER) go_to (p: CURSOR) make (n: INTEGER) make_filled (n: INTEGER) move (i: INTEGER) put (v: [like first] G) put_i_th (v: [like item] G; i: INTEGER) remove replace (v: [like first] G) search (v: [like item] G) start swap (i: INTEGER) Constraints empty means storage empty -- Generated by ISE Eiffel --
For more details: www.eiffel.com