C D E F P Q

C

csc241.samples.Queue - package csc241.samples.Queue

D

dequeue() - Method in interface csc241.samples.Queue.Queue

remove an element from the front of the queue.

dequeue() - Method in class csc241.samples.Queue.dynamicQueue

remove an element from the front of the queue.

dequeue() - Method in class csc241.samples.Queue.fixedQueue

remove an element from the front of the queue.

dynamicQueue - class csc241.samples.Queue.dynamicQueue.

~mohammad/public_html/classes/csc241/Queue/dynamicQueue.java This version implements Queue using a linked list.

dynamicQueue() - Constructor for class csc241.samples.Queue.dynamicQueue

construct a dynamicQueue

E

empty() - Method in interface csc241.samples.Queue.Queue

return true if queue is empty, otherwise, return false

empty() - Method in class csc241.samples.Queue.dynamicQueue

return true if queue is empty, otherwise, return false

empty() - Method in class csc241.samples.Queue.fixedQueue

return true if queue is empty, otherwise, return false

enqueue(Object) - Method in interface csc241.samples.Queue.Queue

add an element to the back of the queue.

enqueue(Object) - Method in class csc241.samples.Queue.dynamicQueue

add an element to the back of the queue.

enqueue(Object) - Method in class csc241.samples.Queue.fixedQueue

add an element to the back of the queue.

F

fixedQueue - class csc241.samples.Queue.fixedQueue.

~mohammad/public_html/classes/csc241/Queue/fixedQueue.java This version implements Queue using an array.

fixedQueue(int) - Constructor for class csc241.samples.Queue.fixedQueue

construct a fixedQueue
size - the # of cells needed

full() - Method in interface csc241.samples.Queue.Queue

return true if queue is full, otherwise, return false

full() - Method in class csc241.samples.Queue.dynamicQueue

return true if queue is full, otherwise, return false

full() - Method in class csc241.samples.Queue.fixedQueue

return true if queue is full, otherwise, return false

P

peek() - Method in interface csc241.samples.Queue.Queue

return value - the object in front of the queue; null if queue is empty.

peek() - Method in class csc241.samples.Queue.dynamicQueue

return value - the object in front of the queue; null if queue is empty.

peek() - Method in class csc241.samples.Queue.fixedQueue

return value - the object in front of the queue; null if queue is empty.

Q

Qnode - class csc241.samples.Queue.Qnode.

Basic node used to implement a linked list of Objects for a Queue.

Queue - interface csc241.samples.Queue.Queue.

~mohammad/public_html/classes/csc241/Queue/Queue.java This is an ADT for Queue class.

queueException - exception csc241.samples.Queue.queueException.

queueException(String) - Constructor for class csc241.samples.Queue.queueException

C D E F P Q