public class LinkedQueue<Item> extends Object implements Iterable<Item>
This implementation uses a singly-linked list with a non-static nested class
for linked-list nodes. See Queue for a version that uses a static nested class.
The enqueue, dequeue, peek, size, and is-empty
operations all take constant time in the worst case.
For additional documentation, see Section 1.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
| Constructor and Description |
|---|
LinkedQueue()
Initializes an empty queue.
|
| Modifier and Type | Method and Description |
|---|---|
Item |
dequeue()
Removes and returns the item on this queue that was least recently added.
|
void |
enqueue(Item item)
Adds the item to this queue.
|
boolean |
isEmpty()
Is this queue empty?
|
Iterator<Item> |
iterator()
Returns an iterator that iterates over the items in this queue in FIFO order.
|
static void |
main(String[] args)
Unit tests the LinkedQueue data type.
|
Item |
peek()
Returns the item least recently added to this queue.
|
int |
size()
Returns the number of items in this queue.
|
String |
toString()
Returns a string representation of this queue.
|
public boolean isEmpty()
public int size()
public Item peek()
NoSuchElementException - if this queue is emptypublic void enqueue(Item item)
item - the item to addpublic Item dequeue()
NoSuchElementException - if this queue is emptypublic String toString()
public Iterator<Item> iterator()
public static void main(String[] args)
Copyright © 2014. All Rights Reserved.