Uses of Interface
java.util.Queue
| Package | Description |
|---|---|
| java.util | |
| java.util.concurrent |
Utility classes commonly useful in concurrent programming.
|
| org.apache.http.impl.conn.tsccm |
The implementation of a thread-safe client connection manager.
|
-
Uses of Queue in java.util
Subinterfaces of Queue in java.util Modifier and Type Interface Description interfaceDeque<E>A linear collection that supports element insertion and removal at both ends.Classes in java.util that implement Queue Modifier and Type Class Description classAbstractQueue<E>This class provides skeletal implementations of someQueueoperations.classArrayDeque<E>Resizable-array implementation of theDequeinterface.classLinkedList<E>LinkedList is an implementation ofList, backed by a doubly-linked list.classPriorityQueue<E>A PriorityQueue holds elements on a priority heap, which orders the elements according to their natural order or according to the comparator specified at construction time.Methods in java.util that return Queue Modifier and Type Method Description static <T> Queue<T>Collections. asLifoQueue(Deque<T> deque)Returns a last-in, first-out queue as a view ofdeque. -
Uses of Queue in java.util.concurrent
Subinterfaces of Queue in java.util.concurrent Modifier and Type Interface Description interfaceBlockingDeque<E>ADequethat additionally supports blocking operations that wait for the deque to become non-empty when retrieving an element, and wait for space to become available in the deque when storing an element.interfaceBlockingQueue<E>AQueuethat additionally supports operations that wait for the queue to become non-empty when retrieving an element, and wait for space to become available in the queue when storing an element.interfaceTransferQueue<E>ABlockingQueuein which producers may wait for consumers to receive elements.Classes in java.util.concurrent that implement Queue Modifier and Type Class Description classArrayBlockingQueue<E>A bounded blocking queue backed by an array.classConcurrentLinkedDeque<E>An unbounded concurrent deque based on linked nodes.classConcurrentLinkedQueue<E>An unbounded thread-safe queue based on linked nodes.classDelayQueue<E extends Delayed>An unbounded blocking queue ofDelayedelements, in which an element can only be taken when its delay has expired.classLinkedBlockingDeque<E>An optionally-bounded blocking deque based on linked nodes.classLinkedBlockingQueue<E>An optionally-bounded blocking queue based on linked nodes.classLinkedTransferQueue<E>An unboundedTransferQueuebased on linked nodes.classPriorityBlockingQueue<E>An unbounded blocking queue that uses the same ordering rules as classPriorityQueueand supplies blocking retrieval operations.classSynchronousQueue<E>A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa. -
Uses of Queue in org.apache.http.impl.conn.tsccm
Fields in org.apache.http.impl.conn.tsccm declared as Queue Modifier and Type Field Description protected Queue<BasicPoolEntry>ConnPoolByRoute. freeConnectionsThe list of free connectionsprotected Queue<WaitingThread>ConnPoolByRoute. waitingThreadsThe list of WaitingThreads waiting for a connectionprotected Queue<WaitingThread>RouteSpecificPool. waitingThreadsThe list of threads waiting for this pool.Methods in org.apache.http.impl.conn.tsccm that return Queue Modifier and Type Method Description protected Queue<BasicPoolEntry>ConnPoolByRoute. createFreeConnQueue()Creates the queue forConnPoolByRoute.freeConnections.protected Queue<WaitingThread>ConnPoolByRoute. createWaitingThreadQueue()Creates the queue forConnPoolByRoute.waitingThreads.