Searched defs:Queue (Results 1 - 4 of 4) sorted by relevance

/openjdk7/jdk/src/share/classes/java/util/
H A DQueue.java46 * specifically for use with capacity-restricted <tt>Queue</tt>
83 * different placement rules. Every <tt>Queue</tt> implementation
106 * <p>The <tt>Queue</tt> interface does not define the <i>blocking queue
112 * <p><tt>Queue</tt> implementations generally do not allow insertion
116 * not be inserted into a <tt>Queue</tt>, as <tt>null</tt> is also
120 * <p><tt>Queue</tt> implementations generally do not define
144 public interface Queue<E> extends Collection<E> { interface in inherits:Collection
/openjdk7/jdk/src/share/classes/sun/misc/
H A DQueue.java32 * Queue: implements a simple queue mechanism. Allows for enumeration of the
38 public class Queue { class
45 public Queue() { method in class:Queue
151 Queue queue;
154 FIFOQueueEnumerator(Queue q) {
176 Queue queue;
179 LIFOQueueEnumerator(Queue q) {
/openjdk7/jdk/src/share/classes/javax/swing/tree/
H A DDefaultMutableTreeNode.java1369 protected Queue queue;
1375 queue = new Queue();
1400 final class Queue { class in class:DefaultMutableTreeNode.BreadthFirstEnumeration
1450 } // End of class Queue
/openjdk7/jdk/src/share/classes/java/awt/
H A DEventQueue.java114 * We maintain one Queue for each priority that the EventQueue supports.
116 * NUM_PRIORITIES queues and all Events on a particular internal Queue
118 * with the Queue of highest priority. We progress in decreasing order
121 private Queue[] queues = new Queue[NUM_PRIORITIES];
217 queues[i] = new Queue();
300 * Posts the event to the internal Queue of specified priority,
332 // Insert it at the end of the appropriate Queue.
1300 * The Queue object holds pointers to the beginning and end of one internal
1303 * internal Queue hav
1305 class Queue { class
[all...]

Completed in 62 milliseconds