Package dsa.lab09.solutions
Class ArrayPriorityQueue<Priority extends Comparable<Priority>,Item>
java.lang.Object
dsa.lab09.solutions.ArrayPriorityQueue<Priority,Item>
- Type Parameters:
Priority
- the priority typeItem
- the item type
- All Implemented Interfaces:
Container<PriorityQueueItem<Priority,
,Item>> PriorityQueue<Priority,
,Item> Iterable<PriorityQueueItem<Priority,
Item>>
public class ArrayPriorityQueue<Priority extends Comparable<Priority>,Item>
extends Object
implements PriorityQueue<Priority,Item>
An (unsorted) array priority queue.
-
Nested Class Summary
Nested classes/interfaces inherited from interface dsa.lab09.base.PriorityQueue
PriorityQueue.ItemIterator<Priority extends Comparable<Priority>,
Item> -
Constructor Summary
ConstructorsConstructorDescriptionConstruct an empty array priority queue.ArrayPriorityQueue
(PriorityQueueItem<Priority, Item>... items) Construct an array priority queue containing the given items.Construct an array priority queue containing the given items.ArrayPriorityQueue
(Iterable<PriorityQueueItem<Priority, Item>> items, int size) Construct an array priority queue containing the given items more efficiently thanArrayPriorityQueue(Iterable)
. -
Method Summary
Modifier and TypeMethodDescriptionvoid
insert
(PriorityQueueItem<Priority, Item> item) Insert the given prioritised item.items()
Get a forward iterable that yields each prioritised item once.max()
Get the item with the greatest priority.Remove the item with the greatest priority.reversed()
Get a reverse iterable that yields each prioritised item once.int
size()
Get the number of contained items.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
Methods inherited from interface dsa.lab09.base.PriorityQueue
insert, itemsOnly, reversedItemsOnly
-
Constructor Details
-
ArrayPriorityQueue
public ArrayPriorityQueue()Construct an empty array priority queue. -
ArrayPriorityQueue
Construct an array priority queue containing the given items.- Parameters:
items
- the items
-
ArrayPriorityQueue
public ArrayPriorityQueue(Iterable<PriorityQueueItem<Priority, Item>> items, int size) throws IllegalArgumentExceptionConstruct an array priority queue containing the given items more efficiently thanArrayPriorityQueue(Iterable)
.- Parameters:
items
- the itemssize
- the number of items- Throws:
IllegalArgumentException
- ifsize
!=n
(wheren
isitems
's size)
-
ArrayPriorityQueue
Construct an array priority queue containing the given items.- Parameters:
items
- the items
-
-
Method Details
-
size
public int size()Description copied from interface:Container
Get the number of contained items.- Specified by:
size
in interfaceContainer<Priority extends Comparable<Priority>>
- Returns:
- the size
-
max
Description copied from interface:PriorityQueue
Get the item with the greatest priority.- Specified by:
max
in interfacePriorityQueue<Priority extends Comparable<Priority>,
Item> - Returns:
- the maximum priority item, or
null
if empty
-
insert
Description copied from interface:PriorityQueue
Insert the given prioritised item.- Specified by:
insert
in interfacePriorityQueue<Priority extends Comparable<Priority>,
Item> - Parameters:
item
- the prioritised item
-
removeMax
Description copied from interface:PriorityQueue
Remove the item with the greatest priority.- Specified by:
removeMax
in interfacePriorityQueue<Priority extends Comparable<Priority>,
Item> - Returns:
- the maximum priority item, or
null
if empty
-
items
Description copied from interface:PriorityQueue
Get a forward iterable that yields each prioritised item once.The items are iterated over in max-to-min order (by priority).
- Specified by:
items
in interfaceContainer<Priority extends Comparable<Priority>>
- Specified by:
items
in interfacePriorityQueue<Priority extends Comparable<Priority>,
Item> - Returns:
- an iterable over the prioritised items
-
reversed
Description copied from interface:PriorityQueue
Get a reverse iterable that yields each prioritised item once.The items are iterated over in min-to-max order (by priority).
- Specified by:
reversed
in interfacePriorityQueue<Priority extends Comparable<Priority>,
Item> - Returns:
- an iterable over the prioritised items
-