/openjdk7/jdk/test/java/util/PriorityQueue/ |
H A D | ForgetMeNot.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 38 private static void noMoreElements(final Iterator<Integer> it) { argument 41 new Fun() { void f() { it.next(); }}); 42 check(! it.hasNext()); 46 private static void removeIsCurrentlyIllegal(final Iterator<Integer> it) { argument 49 new Fun() { void f() { it.remove(); }}); 53 private static void remove(Iterator<Integer> it, argument 56 it [all...] |
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | AbstractCollection.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 99 Iterator<E> it = iterator(); 101 while (it.hasNext()) 102 if (it.next()==null) 105 while (it.hasNext()) 106 if (o.equals(it.next())) 137 Iterator<E> it = iterator(); 139 if (! it 219 finishToArray(T[] r, Iterator<?> it) argument [all...] |
/openjdk7/jdk/make/tools/src/build/tools/jdwpgen/ |
H A D | AbstractTypeListNode.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 52 for (Iterator it = components.iterator(); it.hasNext();) { 53 ((Node)it.next()).document(writer); 60 for (Iterator it = components.iterator(); it.hasNext();) { 61 TypeNode tn = (TypeNode)it.next(); 68 for (Iterator it [all...] |
H A D | RootNode.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 45 for (Iterator it = components.iterator(); it.hasNext();) { 46 ((Node)it.next()).documentIndex(writer); 48 for (Iterator it = components.iterator(); it.hasNext();) { 49 ((Node)it.next()).document(writer);
|
H A D | AbstractNamedNode.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 41 Iterator it = components.iterator(); 43 if (it.hasNext()) { 44 Node nameNode = (Node)it.next(); 49 it.remove(); 67 for (Iterator it = components.iterator(); it.hasNext();) { 68 ((Node)it [all...] |
H A D | AbstractCommandNode.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 38 for (Iterator it = components.iterator(); it.hasNext();) { 39 ((Node)it.next()).document(writer);
|
H A D | CommandSetNode.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 46 for (Iterator it = components.iterator(); it.hasNext();) { 47 ((Node)it.next()).document(writer); 56 for (Iterator it = components.iterator(); it.hasNext();) { 57 ((Node)it.next()).documentIndex(writer);
|
H A D | Node.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 53 for (Iterator it = components.iterator(); it.hasNext();) { 54 Node node = (Node)it.next(); 56 it.remove(); 66 for (Iterator it = components.iterator(); it.hasNext();) { 67 Node node = (Node)it [all...] |
/openjdk7/jdk/test/java/util/Deque/ |
H A D | ChorusLine.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 47 Iterator<Integer> it = deq.descendingIterator(); 48 equal(it.next(), 8); 49 it.remove(); 51 try {it.remove();} 56 it = deq.descendingIterator(); 57 equal(it.next(), 9); 58 equal(it [all...] |
/openjdk7/hotspot/test/compiler/5091921/ |
H A D | Test7020614.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 41 for (int it = 0; it < ITERATIONS; ++it) {
|
/openjdk7/jdk/test/java/util/Vector/ |
H A D | ComodifiedRemoveAllElements.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 38 Iterator it = v.iterator(); 41 it.next();
|
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/bdi/ |
H A D | ThreadIterator.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 43 Iterator<ThreadReference> it = null; field in class:ThreadIterator 57 while (it == null || !it.hasNext()) { 61 it = tgi.nextThreadGroup().threads().iterator(); 68 return it.next();
|
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/tty/ |
H A D | ThreadIterator.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 43 Iterator<ThreadReference> it = null; field in class:ThreadIterator 60 while (it == null || !it.hasNext()) { 64 it = tgi.nextThreadGroup().threads().iterator(); 71 return it.next();
|
/openjdk7/jdk/test/java/util/List/ |
H A D | LockStep.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 90 Iterator it = list.iterator(); 92 it.next();}}, 94 Iterator it = asSubList(list).iterator(); 96 it.next();}}, 98 Iterator it = asSubList(asSubList(list)).iterator(); 100 it.next();}}, 210 ListIterator it [all...] |
/openjdk7/jdk/test/java/util/concurrent/DelayQueue/ |
H A D | Iterate.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 44 Iterator<Godot> it = q.iterator(); 46 check(it.hasNext()); 47 equal(it.next(), godots[0]); 48 it.remove(); 52 it = q.iterator(); 53 check(it.hasNext()); 54 it [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/util/ |
H A D | Which.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 47 * @return the source location of the resource, or null if it wasn't found 57 URL it = loader.getResource(classnameAsResource); 58 if (it != null) { 59 return it.toString();
|
/openjdk7/jdk/test/java/util/zip/ |
H A D | ReadLoc.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 41 for (Iterator it = entries.iterator(); it.hasNext();) { 42 ZipEntry zipEntry = (ZipEntry)it.next();
|
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/util/ |
H A D | CacheMap.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 39 * references}. Accessing an element means creating it, or retrieving 40 * it with {@link #get(Object) get}. Because these entries are kept 86 Iterator<SoftReference<K>> it = cache.iterator(); 87 while (it.hasNext()) { 88 SoftReference<K> sref = it.next(); 91 it.remove(); 94 it [all...] |
/openjdk7/jdk/src/macosx/native/jobjc/ |
H A D | run-and-write-if-okay | 6 # This code is free software; you can redistribute it and/or modify it 12 # This code is distributed in the hope that it will be useful, but WITHOUT 30 Expects two args: EXEC and OUTPATH. First, it runs and prints 31 `EXEC 2>&1`. If it returns successfully, it writes the output to OUTPATH.
|
/openjdk7/jdk/test/java/util/WeakHashMap/ |
H A D | GCDuringIteration.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 68 void checkIterator(final Iterator<Map.Entry<Foo, Integer>> it, int first) { argument 71 if (rnd.nextBoolean()) check(it.hasNext()); 72 equal(it.next().getValue(), i); 76 new F(){void f(){it.next();}}); 78 check(! it.hasNext()); 102 final Iterator<Map.Entry<Foo,Integer>> it = map.entrySet().iterator(); 107 checkIterator(it, firs [all...] |
/openjdk7/hotspot/src/share/tools/ProjectCreator/ |
H A D | WinGammaPlatform.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 41 boolean nextNotKey(ArgIterator it) { argument 42 if (it.next()) { 43 String s = it.get(); 87 public void handle(ArgIterator it) { argument 88 String cfg = getCfg(it.get()); 89 if (nextNotKey(it)) { 90 String val = it [all...] |
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | jvmtiThreadState.cpp | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 76 JvmtiEnvIterator it; local 77 for (JvmtiEnvBase* env = it.first(); env != NULL; env = it.next(env)) { 112 JvmtiEnvThreadStateIterator it(this); 113 for (JvmtiEnvThreadState* ets = it.first(); ets != NULL; ) { 115 ets = it.next(ets); 153 // unlink it fro [all...] |
/openjdk7/hotspot/src/share/tools/launcher/ |
H A D | wildcard.c | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 136 WildcardIterator it = NEW_(WildcardIterator); local 140 it->handle = handle; 141 it->firstFile = find_data.cFileName; 142 return it; 146 WildcardIterator_next(WildcardIterator it) argument 149 if (it->firstFile != NULL) { 150 char *firstFile = it 159 WildcardIterator_close(WildcardIterator it) argument 190 WildcardIterator it = NEW_(WildcardIterator); local 197 WildcardIterator_next(WildcardIterator it) argument 204 WildcardIterator_close(WildcardIterator it) argument 370 WildcardIterator it = WildcardIterator_for(wildcard); local [all...] |
/openjdk7/jdk/src/share/bin/ |
H A D | wildcard.c | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 132 // since this is used repeatedly we keep it here. 137 WildcardIterator it = NEW_(WildcardIterator); local 141 it->handle = handle; 142 it->firstFile = find_data.cFileName; 143 return it; 147 WildcardIterator_next(WildcardIterator it) argument 149 if (it 159 WildcardIterator_close(WildcardIterator it) argument 190 WildcardIterator it = NEW_(WildcardIterator); local 197 WildcardIterator_next(WildcardIterator it) argument 204 WildcardIterator_close(WildcardIterator it) argument 358 WildcardIterator it = WildcardIterator_for(wildcard); local [all...] |
/openjdk7/jdk/test/java/util/Collection/ |
H A D | IteratorAtEnd.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 85 final Iterator it = c.iterator(); 87 new Fun() {void f() { while (true) it.next(); }}); 88 try { it.remove(); } 96 final ListIterator it = list.listIterator(0); 97 it.next(); 98 final Object x = it.previous(); 100 new Fun() {void f() { it [all...] |