Class PriorityQueueItem<E>

java.lang.Object

PriorityQueueItem<E>

Type Parameters:

E - the generic type of the data content stored in the list

All Implemented Interfaces:

java.lang.Comparable<PriorityQueueItem<E>>

public class PriorityQueueItem<E>
extends java.lang.Object
implements java.lang.Comparable<PriorityQueueItem<E>>

Class to represent object stored at every entry in the PriorityQueue. ie, The internal node structure of PriorityQueue

Author:

CS367

Field Summary

Fields

Modifier and Type	Field and Description
private int	priority
private Queue<E>	queue

Constructor Summary

Constructors

Constructor and Description
PriorityQueueItem(int priority)

Method Summary

Modifier and Type	Method and Description
void	add(E item) Add an item to the queue of this PriorityQueueItem object
int	compareTo(PriorityQueueItem<E> o) Compares this Node to another node on basis of priority
Queue<E>	getList()
int	getPriority()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

priority

private int priority

queue

private Queue<E> queue

Constructor Detail

PriorityQueueItem

public PriorityQueueItem(int priority)

Method Detail

getPriority

public int getPriority()

getList

public Queue<E> getList()

add

public void add(E item)

Add an item to the queue of this PriorityQueueItem object

Parameters:

item - item to add to the queue

compareTo

public int compareTo(PriorityQueueItem<E> o)

Compares this Node to another node on basis of priority

Specified by:

compareTo in interface java.lang.Comparable<PriorityQueueItem<E>>

Parameters:

o - other node to compare to

Returns:

-1 if this node's priority is lesser, +1 if this nodes priority is higher after, else 0 if priorities are the same.