Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Text Flat Contracts Flat contracts Go to:
indexing description: "Priority queues implemented as heaps" status: "See notice at end of class" names: sorted_priority_queue, dispenser, heap representation: heap access: fixed, membership contents: generic date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" class interface HEAP_PRIORITY_QUEUE [G -> COMPARABLE] create make feature -- Initialization make (n: INTEGER) -- Allocate heap space. feature -- Access item: G -- Entry at top of heap. feature -- Measurement count: INTEGER -- Number of items index_set: INTEGER_INTERVAL -- Range of acceptable indexes ensure then count_definition: Result.count = count feature -- Status report extendible: BOOLEAN -- May items be added? full: BOOLEAN -- Is structure filled to capacity? Prunable: BOOLEAN is True -- May items be removed? (Answer: yes.) feature -- Element change force (v: like item) -- Insert item v at its proper position. -- Was declared in HEAP_PRIORITY_QUEUE as synonym of put. put (v: like item) -- Insert item v at its proper position. -- Was declared in HEAP_PRIORITY_QUEUE as synonym of force. feature -- Removal remove -- Remove item of highest value. feature -- Conversion linear_representation: ARRAYED_LIST [G] -- Representation as a linear structure -- (Sorted according to decreasing priority) feature -- Duplication duplicate (n: INTEGER): like Current -- New priority queue containing the n greatest items invariant empty_means_storage_empty: is_empty implies all_default indexing library: "[ EiffelBase: Library of reusable components for Eiffel. ]" status: "[ Copyright 1986-2001 Interactive Software Engineering (ISE). For ISE customers the original versions are an ISE product covered by the ISE Eiffel license and support agreements. ]" license: "[ EiffelBase may now be used by anyone as FREE SOFTWARE to develop any product, public-domain or commercial, without payment to ISE, under the terms of the ISE Free Eiffel Library License (IFELL) at http://eiffel.com/products/base/license.html. ]" source: "[ Interactive Software Engineering Inc. ISE Building 360 Storke Road, Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Electronic mail <info@eiffel.com> Customer support http://support.eiffel.com ]" info: "[ For latest info see award-winning pages: http://eiffel.com ]" end -- class HEAP_PRIORITY_QUEUE
Classes Clusters Cluster hierarchy Chart Relations Text Flat Contracts Flat contracts Go to:

-- Generated by ISE Eiffel --
For more details: www.eiffel.com