/openjdk7/corba/src/share/classes/com/sun/tools/corba/se/logutil/ |
H A D | InputException.java | 28 import java.util.Queue; 40 private final Queue<InputCode> codes; 77 public Queue<InputCode> getCodes() {
|
H A D | Input.java | 36 import java.util.Queue; 61 private Queue<InputException> exceptions; 120 Queue<String> lines = new LinkedList<String>(); 193 public Queue<InputException> getExceptions() {
|
H A D | MC.java | 36 import java.util.Queue; 98 Queue<InputException> exceptions = input.getExceptions(); 167 private void writeImports(Queue<InputException> exceptions, 233 private void writeExceptions(String groupName, Queue<InputException> exceptions,
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Queue.java | 46 * 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
|
H A D | AbstractQueue.java | 39 * This class provides skeletal implementations of some {@link Queue} 48 * <p>A <tt>Queue</tt> implementation that extends this class must 49 * minimally define a method {@link Queue#offer} which does not permit 51 * Queue#peek}, {@link Queue#poll}, {@link Collection#size}, and 66 implements Queue<E> { 98 throw new IllegalStateException("Queue full");
|
H A D | Deque.java | 96 * <p>This interface extends the {@link Queue} interface. When a deque is 99 * inherited from the <tt>Queue</tt> interface are precisely equivalent to 105 * <td ALIGN=CENTER> <b><tt>Queue</tt> Method</b></td> 109 * <td>{@link java.util.Queue#add add(e)}</td> 113 * <td>{@link java.util.Queue#offer offer(e)}</td> 117 * <td>{@link java.util.Queue#remove remove()}</td> 121 * <td>{@link java.util.Queue#poll poll()}</td> 125 * <td>{@link java.util.Queue#element element()}</td> 129 * <td>{@link java.util.Queue#peek peek()}</td> 194 public interface Deque<E> extends Queue< [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | BlockingQueue.java | 39 import java.util.Queue; 42 * A {@link java.util.Queue} that additionally supports operations 181 public interface BlockingQueue<E> extends Queue<E> {
|
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | RequestProcessor.java | 39 private static Queue requestQueue; 95 requestQueue = new Queue();
|
H A D | Queue.java | 32 * 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/langtools/test/tools/javac/generics/6294779/ |
H A D | T6294779b.java | 41 Queue<E> m();
|
/openjdk7/jdk/src/share/classes/sun/swing/text/ |
H A D | CompoundPrintable.java | 40 private final Queue<CountingPrintable> printables;
|
/openjdk7/jdk/test/java/util/concurrent/ConcurrentQueues/ |
H A D | ConcurrentQueueLoops.java | 56 Collection<Queue<Integer>> concurrentQueues() { 57 List<Queue<Integer>> queues = new ArrayList<Queue<Integer>>(); 81 for (Queue<Integer> queue : concurrentQueues()) 85 void test(final Queue<Integer> q) throws Throwable { 106 final Queue<Integer> queue; 109 Stage(Queue<Integer> q, CyclicBarrier b, int items) { 148 void oneRun(int n, int items, final Queue<Integer> q) throws Exception {
|
H A D | GCRetention.java | 55 import java.util.Queue; 64 Collection<Queue<Boolean>> queues() { 65 List<Queue<Boolean>> queues = new ArrayList<Queue<Boolean>>(); 107 for (Queue<Boolean> queue : queues()) 110 for (Queue<Boolean> queue : queues()) 116 void test(Queue<Boolean> q) {
|
H A D | RemovePollRace.java | 55 import java.util.Queue; 64 Collection<Queue<Boolean>> concurrentQueues() { 65 List<Queue<Boolean>> queues = new ArrayList<Queue<Boolean>>(); 104 for (Queue<Boolean> queue : concurrentQueues()) 107 for (Queue<Boolean> queue : concurrentQueues()) 118 void test(final Queue<Boolean> q) throws Throwable {
|
H A D | IteratorWeakConsistency.java | 61 void test(Queue q) {
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/ |
H A D | Todo.java | 34 import java.util.Queue; 99 public Queue<Queue<Env<AttrContext>>> groupByFile() { 101 contentsByFile = new LinkedList<Queue<Env<AttrContext>>>(); 136 LinkedList<Queue<Env<AttrContext>>> contentsByFile;
|
/openjdk7/jdk/test/java/util/Collections/ |
H A D | RacingCollections.java | 105 else if (elLoco instanceof Queue) { 106 Queue<Integer> q = (Queue<Integer>) elLoco; 233 private static List<Queue<Integer>> newConcurrentQueues() { 234 List<Queue<Integer>> list = 235 new ArrayList<Queue<Integer>>(newConcurrentDeques()); 242 private static List<Queue<Integer>> newQueues() { 243 List<Queue<Integer>> list = 244 new ArrayList<Queue<Integer>>(newDeques()); 308 for (Queue<Intege [all...] |
H A D | AsLifoQueue.java | 43 Queue<String> q = Collections.asLifoQueue(deq); 50 final Queue<String> q =
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/main/ |
H A D | JavaCompiler.java | 35 import java.util.Queue; 547 protected final <T> Queue<T> stopIfError(CompileState cs, Queue<T> queue) { 861 Queue<Queue<Env<AttrContext>>> q = todo.groupByFile(); 1154 public Queue<Env<AttrContext>> attribute(Queue<Env<AttrContext>> envs) { 1205 public Queue<Env<AttrContext>> flow(Queue<Env<AttrContext>> envs) { 1216 public Queue<En [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/ |
H A D | PolicyIntersector.java | 32 import java.util.Queue; 128 final Queue<AssertionSet> testedAlternatives = new LinkedList<AssertionSet>();
|
/openjdk7/jdk/src/share/sample/nio/chatserver/ |
H A D | Client.java | 46 import java.util.Queue; 65 private final Queue<ByteBuffer> queue = new LinkedList<ByteBuffer>();
|
/openjdk7/jdk/test/java/util/PriorityQueue/ |
H A D | RemoveContains.java | 79 private static void test(Queue<String> q) {
|
H A D | PriorityQueueSort.java | 65 Queue<Integer> pq = new PriorityQueue<Integer>(n, new MyComparator());
|
/openjdk7/jdk/test/java/nio/file/Files/walkFileTree/ |
H A D | CreateFileTree.java | 42 Queue<Path> queue = new ArrayDeque<Path>();
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/sourcemodel/ |
H A D | PolicyModelTranslator.java | 35 import java.util.Queue; 251 final Queue<RawPolicy> policyQueue = new LinkedList<RawPolicy>(); 252 final Queue<Collection<ModelNode>> contentQueue = new LinkedList<Collection<ModelNode>>(); 297 final Queue<ModelNode> allContentQueue = new LinkedList<ModelNode>(content); 341 final Queue<ModelNode> eoContentQueue = new LinkedList<ModelNode>(content); 369 final Queue<RawAssertion> nestedAssertionsQueue = new LinkedList<RawAssertion>(alternative.nestedAssertions); 410 final Queue<RawAlternative> nestedAlternativeQueue = new LinkedList<RawAlternative>(assertion.nestedAlternatives);
|