Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class LINKED_PRIORITY_QUEUE [G -> COMPARABLE] General cluster: elks description: "Priority queues implemented as sorted lists" create: make, make_from_iterable, make_sublist Ancestors PRIORITY_QUEUE* [G -> PART_COMPARABLE] SORTED_TWO_WAY_LIST [G -> COMPARABLE] Queries after: BOOLEAN at alias "@" (i: INTEGER_32): [like sl_item] G before: BOOLEAN changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: TWO_WAY_LIST_CURSOR [G] exhausted: BOOLEAN extendible: BOOLEAN first: [like sl_item] G first_element: [detachable like new_cell] detachable BI_LINKABLE [G] for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN Full: BOOLEAN has (v: G): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like sl_item] G index: INTEGER_32 index_of (v: [like sl_item] G; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] LINKED_PRIORITY_QUEUE [G]): BOOLEAN is_inserted (v: G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G item_for_iteration: G last: [like sl_item] G last_element: [like first_element] detachable BI_LINKABLE [G] linear_representation: LINEAR [G] Lower: INTEGER_32 max: [like sl_item] G median: [like sl_item] G min: [like sl_item] G new_cursor: TWO_WAY_LIST_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: [like sl_item] G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN sequential_has (v: [like sl_item] G): BOOLEAN sequential_index_of (v: [like sl_item] G; i: INTEGER_32): INTEGER_32 sequential_occurrences (v: [like sl_item] G): INTEGER_32 sl_item: G sorted: BOOLEAN sublist: [detachable like Current] detachable LINKED_PRIORITY_QUEUE [G] 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 chain_wipe_out compare_objects compare_references copy (other: [like Current] LINKED_PRIORITY_QUEUE [G]) do_all (action: PROCEDURE [G]) do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN]) extend (v: [like sl_item] G) fill (other: CONTAINER [G]) finish force (v: [like sl_item] G) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) ll_merge_right (other: [like Current] LINKED_PRIORITY_QUEUE [G]) ll_move (i: INTEGER_32) ll_put_front (v: [like sl_item] G) ll_put_right (v: [like sl_item] G) ll_wipe_out merge (other: LINEAR [G]) merge_left (other: [like Current] LINKED_PRIORITY_QUEUE [G]) merge_right (other: [like Current] LINKED_PRIORITY_QUEUE [G]) move (i: INTEGER_32) prune (v: [like sl_item] G) prune_all (v: [like sl_item] G) put (v: [like item] G) put_front (v: [like sl_item] G) put_i_th (v: [like sl_item] G; i: INTEGER_32) put_left (v: [like sl_item] G) put_right (v: [like sl_item] G) remove remove_i_th (i: INTEGER_32) remove_left remove_right remove_sublist replace (v: [like sl_item] G) search (v: [like sl_item] G) search_after (v: [like sl_item] G) search_before (v: [like sl_item] G) sl_put (v: [like sl_item] G) sort split (n: INTEGER_32) start swap (i: INTEGER_32) wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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