Searched refs:Queue (Results 26 - 45 of 45) sorted by relevance

12

/openjdk7/jdk/src/share/classes/sun/nio/ch/
H A DAsynchronousChannelGroupImpl.java33 import java.util.Queue;
65 private final Queue<Runnable> taskQueue;
/openjdk7/jdk/test/java/util/PriorityQueue/
H A DForgetMeNot.java54 Queue<Integer> q) {
/openjdk7/jdk/test/java/util/concurrent/ConcurrentQueues/
H A DOfferRemoveLoops.java67 void testQueue(final Queue q) throws Throwable {
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DGraph.java32 import java.util.Queue;
154 Queue<Node<N, E>> queue = new LinkedList<Node<N, E>>();
H A DHierarchicalLayoutManager.java39 import java.util.Queue;
812 Queue<Segment> queue = new LinkedList<Segment>();
1993 Queue<LayoutNode> queue = new LinkedList<LayoutNode>();
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/privateutil/
H A DPolicyUtils.java41 import java.util.Queue;
237 final Queue<T> optionProcessingQueue = new LinkedList<T>();
/openjdk7/jdk/test/java/beans/XMLEncoder/
H A DBeanValidator.java40 import java.util.Queue;
146 } else if (Queue.class.isAssignableFrom(type)) {
/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/util/concurrent/
H A DConcurrentLinkedQueue.java43 import java.util.Queue;
46 * An unbounded thread-safe {@linkplain Queue queue} based on linked nodes.
62 * Fast, and Practical Non-Blocking and Blocking Concurrent Queue
85 * methods of the {@link Queue} and {@link Iterator} interfaces.
104 implements Queue<E>, java.io.Serializable {
322 * @return {@code true} (as specified by {@link Queue#offer})
H A DLinkedTransferQueue.java42 import java.util.Queue;
443 * Queue nodes. Uses Object, not E, for items to allow forgetting
833 * of calls to both Queue.remove and Itr.remove, we must
1060 * @return {@code true} (as specified by {@link Queue#offer})
1314 * Reconstitutes the Queue instance from a stream (that is,
H A DConcurrentLinkedDeque.java44 import java.util.Queue;
1002 // *** Queue and stack methods ***
1008 * @return {@code true} (as specified by {@link Queue#offer})
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DLog.java33 import java.util.Queue;
122 public Queue<JCDiagnostic> deferredDiagnostics = new ListBuffer<JCDiagnostic>();
/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...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/sourcemodel/
H A DPolicySourceModel.java43 import java.util.Queue;
388 final Queue<ModelNode> nodesToBeProcessed = new LinkedList<ModelNode>();
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/api/
H A DJavacTaskImpl.java382 private void handleFlowResults(Queue<Env<AttrContext>> queue, ListBuffer<Element> elems) {
473 void run(Queue<Env<AttrContext>> list, Iterable<? extends TypeElement> classes) {
/openjdk7/jdk/src/share/classes/sun/applet/
H A DAppletPanel.java54 import sun.misc.Queue;
255 * AppletEvent Queue
257 private Queue queue = null;
280 * Send an event. Queue it for execution by the handler thread.
286 queue = new Queue();
/openjdk7/jdk/test/java/util/Collection/
H A DMOAT.java425 private static void testQueue(Queue<Integer> q) {
445 private static void testQueueAddRemove(final Queue<Integer> q,
655 private static void testQueueIteratorRemove(Queue<Integer> q) {
729 if (c instanceof Queue)
730 testQueue((Queue<Integer>)c);
/openjdk7/jdk/src/share/classes/java/util/
H A DCollections.java3927 * {@link Queue}. Method <tt>add</tt> is mapped to <tt>push</tt>,
3930 * requiring a <tt>Queue</tt> but you need Lifo ordering.
3934 * one exception. The {@link Queue#addAll addAll} method is
3942 public static <T> Queue<T> asLifoQueue(Deque<T> deque) {
3950 implements Queue<E>, Serializable {
/openjdk7/jdk/make/java/java/
H A DFILES_java.gmk240 java/util/Queue.java \
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DAttr.java1154 Queue<JCDiagnostic> prevDeferredDiags = log.deferredDiagnostics;
1668 Queue<JCDiagnostic> prevDeferredDiags = log.deferredDiagnostics;

Completed in 139 milliseconds

12