Automatic generation produced by ISE Eiffel
deferred class CHAIN [G] General cluster: base.structures.list description: "Possibly circular sequences of items, without commitment to a particular representation" Ancestors CURSOR_STRUCTURE [G] INDEXABLE [G, H -> INTEGER] SEQUENCE [G] SEQUENCE [G] Queries infix "@" (i: INTEGER): [like item] G after: BOOLEAN before: BOOLEAN changeable_comparison_criterion: BOOLEAN count: INTEGER cursor: CURSOR duplicate (n: INTEGER): [like Current] CHAIN [G] exhausted: BOOLEAN extendible: BOOLEAN first: [like item] G for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN full: BOOLEAN has (v: [like item] G): BOOLEAN i_th (i: INTEGER): [like item] G index: INTEGER index_of (v: [like item] G; i: INTEGER): INTEGER index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_inserted (v: G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G last: [like item] G linear_representation: LINEAR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER off: BOOLEAN prunable: BOOLEAN readable: 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 do_all (action: PROCEDURE [ANY, TUPLE [G]]) do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN]) extend (v: G) fill (other: CONTAINER [G]) finish force (v: [like item] G) forth go_i_th (i: INTEGER) go_to (p: CURSOR) move (i: INTEGER) prune (v: [like item] G) prune_all (v: [like item] G) put (v: [like item] G) put_i_th (v: [like item] G; i: INTEGER) replace (v: G) search (v: [like item] G) start swap (i: INTEGER) wipe_out Constraints non negative index index small enough off definition isfirst definition islast definition item corresponds to index index set has same count -- Generated by ISE Eiffel --
For more details: www.eiffel.com