INDEX CLUSTER FEATURES SHORT FRAMES NO FRAMES

indexing

description: "Priority queues implemented as sorted lists"
title: "EiffelBase: library of reusable components for Eiffel. ", "Based on EiffelBase library for ISE Eiffel, ", "used with permission. "
project: "EiffelBase Library"
copyright: "(c) 1986-1997 Interactive Software Engineering Inc. ", "Modifications and extensions: ", "(c) 1997 Object Tools ", "All rights reserved. Duplication and distribution prohibited", "May be used only with Visual Eiffel under terms of user ", "license "
key: priority_queue, queue
cluster: eiffelbase
class LINKED_PRIORITY_QUEUE [G -> COMPARABLE]
inherit

PRIORITY_QUEUE [G]
undefine
append,
copy,
is_equal,
prune_all,
readable,
writable
select
item,
put,
remove
end

SORTED_TWO_WAY_LIST [G]
rename
make as sl_make,
remove as sl_remove,
put as sl_put,
item as sl_item
export
{NONE}
all
end
creation

make
feature -- Initialization

make
-- Allocate heap space.
feature -- Access

item: G
-- Entry at top of heap.
feature -- Removal

remove
-- Remove item of highest value.
feature -- Element change

put (v: G)
-- Insert item `v' at its proper position.
end -- class LINKED_PRIORITY_QUEUE

INDEX CLUSTER FEATURES SHORT FRAMES NO FRAMES