Classes and interfacse for queue management.
Package Specification
Queues include FIFO, LIFO and priority queues. The current set of queues
include variants of FIFO and priority.
This package is used heavily by the
com.ibm.jcs.analysis.util.graph
package, among others.
This package is broken down into interfaces, FIFO and priority queues:
- Interfaces
- The basic interface for queues:
- {@link com.ibm.jcs.analysis.util.queue.JCSQueue JCSQueue}
defines methods for
push, pop, peek, contains,
isEmpty,
and size
.
- FIFO
- FIFO queue variants include:
- {@link com.ibm.jcs.analysis.util.queue.FifoNoDups FifoNoDups}
acts as a FIFO queue, but will not allow an element to be
pushed into the queue if it is already in the queue.
If it was in the queue, but was popped, it can be successfully
pushed again into the queue.
- {@link com.ibm.jcs.analysis.util.queue.FifoNoDupPush FifoNoDupPush}
acts as a FIFO queue, but allows an element to be pushed
into the queue only once.
If an element has ever been pushed into the queue, it will
not be allowed into the queue again.
- Priority
- Priority queue variants include:
- {@link com.ibm.jcs.analysis.util.queue.PriorityNoDups PriorityNoDups}
acts as a priority queue, but will not allow an element to be
pushed into the queue if it is already in the queue.
If it was in the queue, but was popped, it can be successfully
pushed again into the queue.
Elements must implement Comparable and the queue is ordered
by the elements'
compareTo()
method.
Related Documentation
See classes in
com.ibm.jcs.analysis.util.graph package for examples
of how the queue classes are used.