indexing
	description: "Priority queues implemented as sorted lists"
	names: priority_queue, queue
	contents: generic

class interface
	LINKED_PRIORITY_QUEUE [G -> COMPARABLE]

create 

	make
			-- Allocate heap space.

feature -- Initialization

	make
			-- Allocate heap space.
	
feature -- Access

	has (v: G): BOOLEAN
			-- Does structure include v?
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from PART_SORTED_LIST)
		ensure -- from CONTAINER
			not_found_in_empty: Result implies not empty

	item: G
			-- Entry at top of heap.
		require -- from ACTIVE
			readable: readable

	occurrences (v: like sl_item): INTEGER
			-- Number of times v appears.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from CHAIN)
		ensure -- from BAG
			non_negative_occurrences: Result >= 0

	occurrences (v: like sl_item): INTEGER
			-- Number of times v appears.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- (from CHAIN)
		ensure -- from BAG
			non_negative_occurrences: Result >= 0
	
feature -- Measurement

	count: INTEGER
			-- Number of items
			-- (from LINKED_LIST)
	
feature -- Status report

	changeable_comparison_criterion: BOOLEAN
			-- May object_comparison be changed?
			-- (Answer: yes by default.)
			-- (from CONTAINER)

	empty: BOOLEAN
			-- Is structure empty?
			-- (from FINITE)

	Extendible: BOOLEAN is true
			-- May new items be added? (Answer: yes.)
			-- (from DYNAMIC_CHAIN)

	Full: BOOLEAN is false
			-- Is structured filled to capacity? (Answer: no.)
			-- (from LINKED_LIST)

	object_comparison: BOOLEAN
			-- Must search operations use equal rather than =
			-- for comparing references? (Default: no, use =.)
			-- (from CONTAINER)

	prunable: BOOLEAN
			-- May items be removed? (Answer: yes.)
			-- (from DYNAMIC_CHAIN)

	readable: BOOLEAN
			-- Is there a current item that may be read?
			-- (from LINKED_LIST)

	writable: BOOLEAN
			-- Is there a current item that may be modified?
			-- (from SEQUENCE)
	
feature -- Status setting

	compare_objects
			-- Ensure that future search operations will use equal
			-- rather than = for comparing references.
			-- (from CONTAINER)
		require -- from CONTAINER
			changeable_comparison_criterion
		ensure -- from CONTAINER
			object_comparison

	compare_references
			-- Ensure that future search operations will use =
			-- rather than equal for comparing references.
			-- (from CONTAINER)
		require -- from CONTAINER
			changeable_comparison_criterion
		ensure -- from CONTAINER
			reference_comparison: not object_comparison
	
feature -- Element change

	append (s: SEQUENCE [G])
			-- Append a copy of s.
			-- (from SEQUENCE)
		require -- from SEQUENCE
			argument_not_void: s /= void
		require -- from SEQUENCE
			argument_not_void: s /= void
		ensure -- from SEQUENCE
			new_count: count >= old count
		ensure -- from SEQUENCE
			new_count: count >= old count

	extend (v: like sl_item)
			-- Put v at proper position in list.
			-- Move cursor to newly inserted item.
			-- (from SORTED_TWO_WAY_LIST)
		require -- PART_SORTED_LIST
			precursor: True
		require -- from COLLECTION
			extendible: extendible
ensure -- from COLLECTION
			item_inserted: has (v)
		ensure then -- from BAG
			one_more_occurrence: occurrences (v) = old (occurrences (v)) + 1

	fill (other: CONTAINER [G])
			-- Fill with as many items of other as possible.
			-- The representations of other and current structure
			-- need not be the same.
			-- (from COLLECTION)
		require -- from COLLECTION
			other_not_void: other /= void;
			extendible

	force (v: like sl_item)
			-- Add v to end.
			-- (from SEQUENCE)
		require -- from SEQUENCE
			extendible: extendible
		require -- from SEQUENCE
			extendible: extendible
		ensure then -- from SEQUENCE
			new_count: count = old count + 1;
			item_inserted: has (v)
		ensure then -- from SEQUENCE
			new_count: count = old count + 1;
			item_inserted: has (v)

	put (v: like item)
			-- Insert item v at its proper position.
		require -- from COLLECTION
			extendible: extendible
		ensure -- from COLLECTION
			item_inserted: has (v)

	replace (v: like sl_item)
			-- Replace current item by v.
			-- (from LINKED_LIST)
		require -- from ACTIVE
			writable: writable
		ensure -- from ACTIVE
			item_replaced: item = v
	
feature -- Removal

	prune (v: like sl_item)
			-- Remove first occurrence of v, if any,
			-- after cursor position.
			-- If found, move cursor to right neighbor;
			-- if not, make structure exhausted.
			-- (from DYNAMIC_CHAIN)
		require -- from COLLECTION
			prunable: prunable

	prune_all (v: like sl_item)
			-- Remove all items identical to v.
			-- (Reference or object equality,
			-- based on object_comparison.)
			-- Leave cursor off.
			-- (from SORTED_TWO_WAY_LIST)
		require -- DYNAMIC_CHAIN
			precursor: True
		require -- from COLLECTION
			prunable
ensure -- from COLLECTION
			no_more_occurrences: not has (v)

	remove
			-- Remove item of highest value.
		require -- from ACTIVE
			prunable: prunable;
			writable: writable

	wipe_out
			-- Remove all items.
			-- (from TWO_WAY_LIST)
		require -- DYNAMIC_LIST
			precursor: True
		require -- from COLLECTION
			prunable
ensure -- from COLLECTION
			wiped_out: empty
	
feature -- Conversion

	linear_representation: LINEAR [G]
			-- Representation as a linear structure
			-- (from LINEAR)
	
invariant

		-- from GENERAL
	reflexive_equality: standard_is_equal (Current);
	reflexive_conformance: conforms_to (Current);
		-- from DISPENSER
	readable_definition: readable = not empty;
	writable_definition: writable = not empty;
		-- from ACTIVE
	writable_constraint: writable implies readable;
	empty_constraint: empty implies (not readable) and (not writable);
		-- from FINITE
	empty_definition: empty = (count = 0);
	non_negative_count: count >= 0;
		-- from LINKED_LIST
	prunable: prunable;
		-- from DYNAMIC_CHAIN
	extendible: extendible;

end -- class LINKED_PRIORITY_QUEUE