Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class LINKED_SET [G] General cluster: elks description: "Sets implemented by linked lists" create: make, make_from_iterable Ancestors LINEAR_SUBSET* [G] LINKED_LIST [G] Queries after: BOOLEAN at alias "@" (i: INTEGER_32): [like item] G before: BOOLEAN changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: LINKED_LIST_CURSOR [G] disjoint (other: TRAVERSABLE_SUBSET [G]): BOOLEAN exhausted: BOOLEAN extendible: BOOLEAN first: [like item] G for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN Full: BOOLEAN has alias "" (v: [like item] G): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] G index: INTEGER_32 index_of (v: [like item] G; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] LINKED_SET [G]): BOOLEAN is_inserted (v: G): BOOLEAN is_subset alias "" (other: TRAVERSABLE_SUBSET [G]): BOOLEAN is_superset alias "" (other: SUBSET [G]): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G item_for_iteration: G last: [like item] G linear_representation: LINEAR [G] Lower: INTEGER_32 new_cursor: LINKED_LIST_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) back compare_objects compare_references copy (other: [like Current] LINKED_SET [G]) do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: G) fill (other: CONTAINER [G]) finish force (v: [like item] G) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) intersect (other: TRAVERSABLE_SUBSET [G]) ll_extend (v: [like item] G) ll_prune (v: [like item] G) ll_put (v: [like item] G) merge (other: CONTAINER [G]) merge_left (other: [like Current] LINKED_SET [G]) merge_right (other: [like Current] LINKED_SET [G]) move (i: INTEGER_32) move_item (v: G) prune (v: [like item] G) prune_all (v: [like item] G) put (v: G) put_front (v: [like item] G) put_i_th (v: [like item] G; i: INTEGER_32) put_left (v: [like item] G) put_right (v: [like item] G) remove remove_i_th (i: INTEGER_32) remove_left remove_right replace (v: [like item] G) search (v: [like item] G) sequence_put (v: [like item] G) start subtract (other: TRAVERSABLE_SUBSET [G]) swap (i: INTEGER_32) symdif (other: TRAVERSABLE_SUBSET [G]) wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

-- Generated by Eiffel Studio --
For more details: eiffel.org