/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/messaging/saaj/util/ |
H A D | MimeHeadersUtil.java | 42 MimeHeader currentHeader = (MimeHeader) eachHeader.next();
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/rngom/parse/compact/ |
H A D | ParseException.java | 152 Token tok = currentToken.next; 163 tok = tok.next; 165 retval += "\" at line " + currentToken.next.beginLine + ", column " + currentToken.next.beginColumn;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/util/ |
H A D | QNameMap.java | 72 * The next size value at which to resize . Taking it as 114 for (Entry<V> e = table[i]; e != null; e = e.next) { 262 Entry<V> next = e.next; 264 e.next = newTable[i]; 266 e = next; 306 Entry<V> next; // next entry to return field in class:QNameMap.HashIterator 317 next = n; 322 return next ! 346 public V next() { method in class:QNameMap.ValueIterator 373 Entry<V> next; field in class:QNameMap.Entry 440 public Entry<V> next() { method in class:QNameMap.EntryIterator [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/util/xml/ |
H A D | NamedNodeMapIterator.java | 51 public Object next() { method in class:NamedNodeMapIterator
|
H A D | NodeListIterator.java | 51 public Object next() { method in class:NodeListIterator
|
/openjdk7/jdk/test/java/io/Serializable/verifyDynamicObjHandleTable/ |
H A D | VerifyDynamicObjHandleTable.java | 68 out.writeObject(iter.next());
|
/openjdk7/jdk/test/java/io/Serializable/writeObjectMemory/ |
H A D | WriteObjectMemory.java | 70 out.writeObject(iter.next());
|
/openjdk7/jdk/test/java/lang/management/ManagementFactory/ |
H A D | PlatformMBeanServerTest.java | 82 MemoryPoolMXBean p = (MemoryPoolMXBean) iter.next(); 97 MemoryManagerMXBean m = (MemoryManagerMXBean) iter.next(); 110 GarbageCollectorMXBean gc = (GarbageCollectorMXBean) iter.next(); 137 System.out.println(iter.next());
|
/openjdk7/jdk/test/sun/security/provider/PolicyFile/ |
H A D | SelfExpansion.java | 49 return i.next();
|
/openjdk7/langtools/test/tools/apt/mirror/type/ |
H A D | WildcardTyp.java | 77 type.getActualTypeArguments().iterator().next(); 83 return (WildcardType) d.getActualTypeArguments().iterator().next(); 144 res.add((num > 0) ? bounds.iterator().next() : null); 166 res.add((num > 0) ? bounds.iterator().next() : null);
|
/openjdk7/langtools/test/tools/javac/6402516/ |
H A D | CheckLocalElements.java | 56 Element e = elemIter.next(); 59 r = refIter.next(); 66 r = refIter.next(); 78 } catch (NoSuchElementException ex) { // from refIter.next() 86 error(s, ref, "scope is missing entry: " + refIter.next());
|
/openjdk7/jdk/src/share/javavm/export/ |
H A D | jvmticmlr.h | 38 * the kind of information being passed, and a pointer to the next 79 struct _jvmtiCompiledMethodLoadRecordHeader* next; member in struct:_jvmtiCompiledMethodLoadRecordHeader
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | SubstitutionLookups.cpp | 46 of the previous sequenceIndex in the loop and doing next() 70 tempIterator.next(sequenceIndex);
|
/openjdk7/jdk/src/share/native/sun/java2d/ |
H A D | ShaderList.h | 65 ShaderInfo *next; member in struct:_ShaderInfo
|
/openjdk7/jdk/src/share/classes/sun/security/krb5/internal/ |
H A D | LocalSeqNumber.java | 81 public synchronized int next() { method in class:LocalSeqNumber
|
/openjdk7/jdk/src/share/classes/sun/security/provider/certpath/ |
H A D | CollectionCertStore.java | 129 Object o = i.next(); 136 Object o = i.next(); 173 Object o = i.next(); 179 Object o = i.next();
|
/openjdk7/jdk/test/java/util/EnumMap/ |
H A D | EntrySetIteratorRemoveInvalidatesEntry.java | 51 Map.Entry<TestEnum, String> entry = entrySetIterator.next();
|
/openjdk7/jdk/test/java/util/IdentityHashMap/ |
H A D | EntrySetIteratorRemoveInvalidatesEntry.java | 50 Map.Entry<String, String> entry = entrySetIterator.next();
|
/openjdk7/jdk/test/java/util/zip/ |
H A D | ReadLoc.java | 42 ZipEntry zipEntry = (ZipEntry)it.next();
|
/openjdk7/jdk/test/javax/management/MBeanServer/ |
H A D | MBeanServerNotificationTest.java | 85 MBeanServerDelegate.DELEGATE_NAME, next(), name); 87 private static long next = 0; field in class:MBeanServerNotificationTest.Registration 88 private static synchronized long next() {return next++;} method in class:MBeanServerNotificationTest.Registration
|
/openjdk7/jdk/test/sun/java2d/pisces/ |
H A D | Test7036754.java | 55 pi.next();
|
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/ |
H A D | XAtomList.java | 77 res[i++] = iter.next(); 129 Integer bits = iter.next(); 153 add(iter.next()); 162 buf.append(iter.next().toString());
|
/openjdk7/langtools/test/tools/javac/generics/ |
H A D | ParenVerify.java | 40 System.out.println(i.next());
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 118 * Nodes next v v v v v 130 * basic idea in these lists is to mark the "next" pointers of 138 * use direct CAS'able next pointers. On deletion, instead of 152 * algorithm of changing the next-pointer of a deleted node so 188 * n's next pointer. 190 * 2. CAS n's next pointer to point to a new marker node. 198 * 3. CAS b's next pointer over both n and its marker. 213 * just (b, n, f), although the next field of a marker is 214 * immutable, and once a next field is CAS'ed to point to a 225 * Index levels are maintained as lists with volatile next field 397 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node 402 Node(K key, Object value, Node<K,V> next) argument 415 Node(Node<K,V> next) argument 2199 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter 2251 public V next() { method in class:ConcurrentSkipListMap.ValueIterator 2259 public K next() { method in class:ConcurrentSkipListMap.KeyIterator 2267 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator 3004 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter 3081 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator 3089 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator 3097 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator [all...] |
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | HashMap.java | 162 * The next size value at which to resize (capacity * load factor). 437 for (Entry<K,V> e = table[0]; e != null; e = e.next) { 469 e = e.next) { 498 for (Entry<K,V> e = table[i]; e != null; e = e.next) { 517 for (Entry<K,V> e = table[0]; e != null; e = e.next) { 545 for (Entry<K,V> e = table[i]; e != null; e = e.next) { 597 Entry<K,V> next = e.next; 602 e.next = newTable[i]; 604 e = next; 808 Entry<K,V> next; field in class:HashMap.Entry 906 Entry<K,V> next; // next entry to return field in class:HashMap.HashIterator 953 public V next() { method in class:HashMap.ValueIterator 959 public K next() { method in class:HashMap.KeyIterator 965 public Map.Entry<K,V> next() { method in class:HashMap.EntryIterator [all...] |