Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class HEAP_PRIORITY_QUEUE [G -> COMPARABLE] General cluster: elks description: "Priority queues implemented as heaps" create: make, make_from_iterable Ancestors PRIORITY_QUEUE* [G -> PART_COMPARABLE] RESIZABLE* [G] Queries additional_space: INTEGER_32 capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 extendible: BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: G): BOOLEAN index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_equal (other: [like Current] HEAP_PRIORITY_QUEUE [G]): BOOLEAN is_inserted (v: G): BOOLEAN item: G linear_representation: ARRAYED_LIST [G] Minimal_increase: INTEGER_32 new_cursor: HEAP_PRIORITY_QUEUE_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: G): INTEGER_32 Prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN resizable: BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) automatic_grow compare_objects compare_references copy (other: [like Current] HEAP_PRIORITY_QUEUE [G]) extend (v: [like item] G) fill (other: CONTAINER [G]) force (v: [like item] G) grow (i: INTEGER_32) prune (v: G) prune_all (v: G) put (v: [like item] G) remove trim wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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