|
|||||||||
| Home >> All >> edu >> emory >> mathcs >> [ util overview ] | PREV NEXT | ||||||||
Uses of Interface
edu.emory.mathcs.util.Queue
| Uses of Queue in edu.emory.mathcs.util |
| Classes in edu.emory.mathcs.util that implement Queue | |
class |
AbstractQueue
AbstractQueue provides default implementations of add, remove, and element based on offer, poll, and peek, respectively but that throw exceptions instead of indicating failure via false or null returns. |
class |
PriorityQueue
An unbounded priority queue based on a priority heap. |
|
|||||||||
| Home >> All >> edu >> emory >> mathcs >> [ util overview ] | PREV NEXT | ||||||||