Automatic generation produced by ISE Eiffel
deferred class SORTED_STRUCT [G -> COMPARABLE] General cluster: elks description: "Structures whose items are sorted according to a total order relation" Ancestors COMPARABLE_STRUCT* [G -> COMPARABLE] INDEXABLE* [G, H -> INTEGER_32] LINEAR* [G] Queries after: BOOLEAN at alias "@" (k: INTEGER_32): G before: BOOLEAN changeable_comparison_criterion: BOOLEAN exhausted: BOOLEAN extendible: BOOLEAN for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN has (v: [like item] G): BOOLEAN i_th (k: INTEGER_32): G index: INTEGER_32 index_of (v: [like item] G; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_inserted (v: G): BOOLEAN item: G item_for_iteration: G linear_representation: LINEAR [G] lower: INTEGER_32 max: [like item] G median: [like item] G min: [like item] G min_max_available: BOOLEAN new_cursor: INDEXABLE_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN sorted: BOOLEAN there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN upper: INTEGER_32 valid_index (i: INTEGER_32): BOOLEAN Commands back compare_objects compare_references do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: G) fill (other: CONTAINER [G]) finish forth prune (v: G) prune_all (v: G) put_i_th (v: G; k: INTEGER_32) putt (v: [like item] G) search (v: [like item] G) sort start wipe_out -- Generated by Eiffel Studio --
For more details: eiffel.org