/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/ |
H A D | XMLStreamReaderImpl.java | 207 fEventType = fScanner.next(); 549 public int next() throws XMLStreamException { method in class:XMLStreamReaderImpl 558 fEventType = fScanner.next(); 603 } //next() 621 fEventType = fScanner.next(); 840 "parser must be on START_ELEMENT to read next text", getLocation()); 842 int eventType = next(); 862 eventType = next(); 871 * The location information is only valid until next() is 940 * a call to next() change [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xpath/regex/ |
H A D | Op.java | 66 static CharOp createCapture(int number, Op next) { argument 69 op.next = next; 93 static ChildOp createLook(int type, Op next, Op branch) { argument 97 op.next = next; 108 static ChildOp createIndependent(Op next, Op branch) { argument 112 op.next = next; 115 static ModifierOp createModifier(Op next, O argument 122 createCondition(Op next, int ref, Op conditionflow, Op yesflow, Op noflow) argument 130 Op next = null; field in class:Op [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/ |
H A D | LocPathIterator.java | 304 int next = iter.nextNode(); 307 return next; 386 * Set the next position index of this iterator. 388 * @param next A value greater than or equal to zero that indicates the next 391 protected void setNextPosition(int next) argument 398 * the next nextNode() call will retrieve. i.e. if 399 * you call getCurrentPos() and the return is 0, the next 402 * @return A value greater than or equal to zero that indicates the next 556 int next; [all...] |
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orb/ |
H A D | ParserTable.java | 596 public ContactInfo next(ContactInfo primary, method in class:ParserTable.TestIIOPPrimaryToContactInfo
|
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/ |
H A D | ObjectStreamClass_1_3_1.java | 1008 descriptorFor[index] = e.next; 1019 prev.next = e.next; 1025 e = e.next; 1042 e.next = descriptorFor[index]; 1169 ObjectStreamClassEntry next; field in class:ObjectStreamClass_1_3_1.ObjectStreamClassEntry
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/win32/coff/ |
H A D | DebugVC50SymbolIterator.java | 42 /** Go to the next symbol. NOTE that the iterator is pointing at the 44 { ... iter.next(); } construct. 47 and next() is called. */ 48 public void next() throws NoSuchElementException; method in interface:DebugVC50SymbolIterator 343 /** Creates a new symbol iterator pointing to the next outermost 349 /** Gets the absolute file offset of the next symbol, or 0 if none. 413 /** Creates a new symbol iterator pointing to the next outermost 419 /** Gets the absolute file offset of the next symbol, or 0 if none. 528 // given code offset and until the address specified by the next
|
/openjdk7/jdk/src/share/classes/javax/swing/tree/ |
H A D | DefaultMutableTreeNode.java | 1015 * Returns the next sibling of this node in the parent's children array. 1135 * next node, this method first performs a linear search in the 1146 * @return returns the next leaf past this node 1406 public QNode next; // null if end field in class:DefaultMutableTreeNode.BreadthFirstEnumeration.Queue.QNode 1407 public QNode(Object object, QNode next) { argument 1409 this.next = next; 1417 tail.next = new QNode(anObject, null); 1418 tail = tail.next; 1429 head = head.next; [all...] |
/openjdk7/jdk/src/share/classes/sun/awt/geom/ |
H A D | Curve.java | 135 pi.next(); 193 pi.next(); 392 pi.next(); 462 pi.next(); 752 public static double next(double v) { method in class:Curve
|
/openjdk7/jdk/src/share/classes/java/awt/geom/ |
H A D | Path2D.java | 687 pi.next(); 1412 pi.next(); 2590 public void next() { method in class:Path2D.Iterator
|
/openjdk7/jdk/src/share/classes/java/beans/beancontext/ |
H A D | BeanContextSupport.java | 300 public Object next() { return src.next(); } method in class:BeanContextSupport.BCSIterator 573 if(!contains(i.next())) 763 Object c = i.next(); 790 Visibility v = getChildVisibility(i.next()); 809 Visibility v = getChildVisibility(i.next()); 948 Map.Entry entry = (Map.Entry)i.next();
|
/openjdk7/jdk/src/share/classes/java/text/ |
H A D | AttributedString.java | 165 Map.Entry entry = (Map.Entry) iterator.next(); 247 for (char c = text.current(); text.getIndex() < endIndex; c = text.next()) 271 Attribute attributeKey = (Attribute)itr.next(); 395 Map.Entry entry = (Map.Entry) iterator.next(); 656 Attribute key = (Attribute) iterator.next(); 689 * Sets the attributes for the range from offset to the next run break 707 Map.Entry entry = (Map.Entry)iterator.next(); 823 public char next() { method in class:AttributedString.AttributedStringIterator
|
/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...] |
H A D | WeakHashMap.java | 163 * The next size value at which to resize (capacity * load factor). 395 Entry<K,V> next = p.next; 398 table[i] = next; 400 prev.next = next; 401 // Must not null out e.next; 408 p = next; 425 * entries that will be removed before next attempted access 438 * entries that will be removed before next attempte 780 Entry<K,V> next; field in class:WeakHashMap.Entry 785 Entry(Object key, V value, ReferenceQueue<Object> queue, int hash, Entry<K,V> next) argument 908 public V next() { method in class:WeakHashMap.ValueIterator 914 public K next() { method in class:WeakHashMap.KeyIterator 920 public Map.Entry<K,V> next() { method in class:WeakHashMap.EntryIterator [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 117 * volatile-writes of table elements and entry "next" fields 160 * of two, at least two to avoid immediate resizing on next use 266 volatile HashEntry<K,V> next; field in class:ConcurrentHashMap.HashEntry 268 HashEntry(int hash, K key, V value, HashEntry<K,V> next) { argument 272 this.next = next; 276 * Sets next field with volatile write semantics. (See above 291 (k.getDeclaredField("next")); 451 e = e.next; 487 * reused because their next field 1376 public final K next() { return super.nextEntry().key; } method in class:ConcurrentHashMap.KeyIterator 1384 public final V next() { return super.nextEntry().value; } method in class:ConcurrentHashMap.ValueIterator 1420 public Map.Entry<K,V> next() { method in class:ConcurrentHashMap.EntryIterator [all...] |
H A D | ConcurrentLinkedDeque.java | 115 * ("prev") and successor ("next") nodes: 117 * class Node<E> { volatile Node<E> prev, next; volatile E item; } 126 * "last" node terminating any chain of next references starting at 131 * next reference in the first or last node to a fresh node 138 * A "self-link" is a next or prev reference that is the same node: 139 * p.prev == p or p.next == p 146 * (p.prev == null && p.next != p) || 147 * (p.next == null && p.prev != p) 170 * any time, the set of live nodes maintained by prev and next 171 * links are identical, that is, the live nodes found via next 295 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node 533 unlinkFirst(Node<E> first, Node<E> next) argument 1362 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr [all...] |
H A D | ForkJoinTask.java | 421 ExceptionNode next; field in class:ForkJoinTask.ExceptionNode 423 ExceptionNode(ForkJoinTask<?> task, Throwable ex, ExceptionNode next) { argument 426 this.next = next; 444 for (ExceptionNode e = t[i]; ; e = e.next) { 471 ExceptionNode next = e.next; 474 t[i] = next; 476 pred.next = next; [all...] |
H A D | LinkedTransferQueue.java | 155 * first unmatched node on match and CASing the next field of the 206 * pointer updates: Threads may sometimes shortcut the "next" link 212 * of costly-to-reclaim garbage caused by the sequential "next" 220 * pointer, we set the "next" link of the previous head to point 224 * adds some further complexity to traversal: If any "next" 353 * to be removed, we can unsplice s by CASing the next field of 358 * (i.e., with null next), then it is pinned as the target node 451 volatile Node next; field in class:LinkedTransferQueue.Node 549 (k.getDeclaredField("next")); 620 Node n = q.next; // updat 896 public final E next() { method in class:LinkedTransferQueue.Itr [all...] |
H A D | ScheduledThreadPoolExecutor.java | 267 * Sets the next time to run for a periodic task. 844 * the leader, it waits only for the next delay to elapse, but 1251 int cursor = 0; // index of next element to return 1262 public Runnable next() { method in class:ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr
|
H A D | SynchronousQueue.java | 135 * except that nodes that appear to be the next ones to become 231 volatile SNode next; // next node in stack field in class:SynchronousQueue.TransferStack.SNode 245 return cmp == next && 293 (k.getDeclaredField("next")); 315 static SNode snode(SNode s, Object e, SNode next, int mode) { argument 318 s.next = next; 355 casHead(h, h.next); // pop cancelled node 364 if ((h = head) != null && h.next 538 volatile QNode next; // next node in queue field in class:SynchronousQueue.TransferQueue.QNode [all...] |
/openjdk7/jdk/src/share/classes/javax/imageio/ |
H A D | ImageIO.java | 354 ImageInputStreamSpi spi = (ImageInputStreamSpi)iter.next(); 416 ImageOutputStreamSpi spi = (ImageOutputStreamSpi)iter.next(); 467 ImageReaderWriterSpi spi = iter.next(); 525 public ImageReader next() { method in class:ImageIO.ImageReaderIterator 528 spi = (ImageReaderSpi)iter.next(); 839 public ImageWriter next() { method in class:ImageIO.ImageWriterIterator 842 spi = (ImageWriterSpi)iter.next(); 1016 ImageReaderSpi temp = (ImageReaderSpi) readerSpiIter.next(); 1096 ImageWriterSpi temp = (ImageWriterSpi) writerSpiIter.next(); 1191 public ImageTranscoder next() { method in class:ImageIO.ImageTranscoderIterator [all...] |
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | stackMapTableFormat.hpp | 124 verification_type_info* next() { function in class:verification_type_info 185 stack_map_frame* next() const { function in class:stack_map_frame 551 cur = cur->next(); 552 types = types->next(); 562 types = types->next(); 599 vti = vti->next(); 601 vti = vti->next(); 618 vti = vti->next(); 658 cur = cur->next(); 659 locals = locals->next(); [all...] |
/openjdk7/hotspot/src/share/vm/compiler/ |
H A D | oopMap.hpp | 279 void next() { find_next(); } function in class:OopMapStream
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegionRemSet.hpp | 86 // their 'next' and 'prev' fields. 269 // Claim the next block of cards 271 size_t current, next; local 274 next = current + step; 275 } while (Atomic::cmpxchg((jlong)next, &_iter_claimed, (jlong)current) != (jlong)current);
|
H A D | ptrQueue.hpp | 156 BufferNode* next() const { return _next; } function in class:BufferNode 206 // This (and the interpretation of the first element as a "next"
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | generation.hpp | 82 ScratchBlock* next; member in struct:ScratchBlock 118 // Returns the next generation in the configuration, or else NULL if this 272 // the next older gen. The return value is a new limit, or NULL if none. The
|