/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/reflect/ |
H A D | ListIterator.java | 45 * Works like {@link Iterator#next()}. 52 E next() throws SAXException, JAXBException; method in interface:ListIterator
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/rngom/digested/ |
H A D | DChoicePattern.java | 55 for( DPattern p=firstChild(); p!=null; p=p.next )
|
H A D | DGroupPattern.java | 53 for( DPattern p=firstChild(); p!=null; p=p.next )
|
H A D | DInterleavePattern.java | 53 for( DPattern p=firstChild(); p!=null; p=p.next )
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/encoding/ |
H A D | ParameterList.java | 62 tk = h.next(); 70 tk = h.next(); 80 tk = h.next(); 85 tk = h.next();
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/scd/ |
H A D | Token.java | 55 * A reference to the next regular (non-special) token from the input 62 public Token next; field in class:Token 69 * to the last of these special tokens, which in turn refers to the next 72 * The next fields of special tokens refer to other special tokens that
|
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_blocks.h | 45 struct BlockHeader *next; member in struct:BlockHeader
|
/openjdk7/jdk/src/share/classes/sun/tools/tree/ |
H A D | UplevelReference.java | 80 * The next item on the references list of the client. 82 UplevelReference next; field in class:UplevelReference 99 // of enclosing scopes. The next paragraph of this 112 // will have a single up-level "this$N" reference to the next 146 r != null; r = r.next) { 176 next = references; 180 while (!(prev.next == null || isEarlierThan(prev.next))) { 181 prev = prev.next; 183 next [all...] |
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/ |
H A D | Node.java | 51 private Node next; field in class:Node 91 return next; 95 this.next = node; 114 public Node next(); method in interface:Node.Iterator
|
/openjdk7/jdk/test/java/util/LinkedHashMap/ |
H A D | EmptyMapIterator.java | 39 iter.next();
|
/openjdk7/jdk/test/java/util/Vector/ |
H A D | ComodifiedRemoveAllElements.java | 41 it.next();
|
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | Timer.java | 113 * continued, the next tick will happen remaingTime 136 Timer next; field in class:Timer 206 * Continue the timer. The next tick will come at getRemainingTime() 261 * does not take effect until after the next tick. 271 * Returns the remaining time before the timer's next tick. 279 * Sets the remaining time before the timer's next tick. 339 thread then processes the next timer in the queue. 394 timerQueue = timerQueue.next; 432 timer.next = timerQueue; 439 cur = cur.next; 559 TimerTickThread next = null; field in class:TimerTickThread [all...] |
/openjdk7/langtools/test/tools/javac/foreach/ |
H A D | SpecIterable.java | 49 public String next() { return "a"; }
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | DeepNodeListImpl.java | 168 Node next; 176 else if (current != rootNode && null != (next = current.getNextSibling())) { 177 current = next; 182 next = null; 186 next = current.getNextSibling(); 187 if (next != null) 190 current = next;
|
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/ |
H A D | BasicTestIterator.java | 33 * Base for iterators that handle predicates. Does the basic next 35 * next node. 122 * Get the next node via getNextXXX. Bottlenecked for derived class override. 123 * @return The next node on the axis, or DTM.NULL. 128 * Returns the next node in the set and advances the position of the 132 * @return The next <code>Node</code> in the set being iterated over, or 148 int next; 172 next = getNextNode(); 174 if (DTM.NULL != next) 176 if(DTMIterator.FILTER_ACCEPT == acceptNode(next)) [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | UnsharedNameTable.java | 46 HashEntry next; field in class:UnsharedNameTable.HashEntry 107 hashes[h] = firstTableEntry = element.next; 111 previousNonNullTableEntry.next = element.next; 121 element = element.next; 136 Assert.checkNull(previousNonNullTableEntry.next, "previousNonNullTableEntry.next must be null."); 137 previousNonNullTableEntry.next = newEntry;
|
/openjdk7/langtools/test/tools/javac/boxing/ |
H A D | Boxing1.java | 109 x.next = y; 110 x.next.i = 4; 111 x.next.i += 4; 112 if (--x.next.i != 7) throw new Error(); 113 if (x.next.i-- != 7) throw new Error(); 114 if (x.next.i != 6) throw new Error(); 133 Froobie next = null; field in class:Boxing1.Froobie
|
/openjdk7/jdk/src/share/back/ |
H A D | classTrack.c | 54 struct KlassNode *next; /* next node in this slot */ member in struct:KlassNode 86 for (nodePtr = head; node = *nodePtr, node != NULL; nodePtr = &(node->next)) { 91 *nodePtr = node->next; 94 node->next = *newHead; 131 KlassNode *next; local 143 next = node->next; 146 node = next; 220 for (node = *head; node != NULL; node = node->next) { [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/dtdparser/ |
H A D | SimpleHashtable.java | 147 * Used to view this as an enumeration; returns the next key 156 current = current.next; 168 for (Entry e = tab[index]; e != null; e = e.next) { 183 for (Entry e = tab[index]; e != null; e = e.next) { 217 old = old.next; 220 e.next = newMap[index]; 244 for (Entry e = tab[index]; e != null; e = e.next) { 276 Entry next; field in class:SimpleHashtable.Entry 278 protected Entry(int hash, Object key, Object value, Entry next) { argument 282 this.next [all...] |
/openjdk7/jdk/src/windows/classes/sun/nio/fs/ |
H A D | WindowsPathParser.java | 104 int next = 2; 110 off = nextNonSlash(input, next, len); 111 next = nextSlash(input, off, len); 112 if (off == next) 114 String host = input.substring(off, next); //host 115 off = nextNonSlash(input, next, len); 116 next = nextSlash(input, off, len); 117 if (off == next) 119 root = "\\\\" + host + "\\" + input.substring(off, next) + "\\"; 120 off = next; [all...] |
/openjdk7/jdk/test/java/io/charStreams/ |
H A D | StringConvert.java | 59 while ((s = sg.next()) != null) { 85 while ((s = sg.next()) != null) { 101 while ((s = sg.next()) != null) { 104 int o = ig.next(s.length() - 1); 105 int n = ig.next(s.length() - o); 119 while ((s = sg.next()) != null) { 122 int o = ig.next(100); 136 while ((s = sg.next()) != null) { 138 int o = ig.next(s.length() - 1); 139 int n = ig.next( [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | StepIterator.java | 99 _iterator.setStartNode(_includeSelf ? _startNode : _source.next()); 108 _iterator.setStartNode(_includeSelf ? _startNode : _source.next()); 112 public int next() { method in class:StepIterator 115 if ((node = _iterator.next()) != END) { 118 // If not, get the next starting point from left-hand iterator... 119 else if ((node = _source.next()) == END) {
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/util/ |
H A D | XMLGrammarPoolImpl.java | 102 for (Entry e = fGrammars[i]; e != null; e = e.next) { 176 for (Entry entry = fGrammars[index]; entry != null; entry = entry.next) { 201 for (Entry entry = fGrammars[index] ; entry != null ; entry = entry.next) { 223 for (Entry entry = fGrammars[index], prev = null ; entry != null ; prev = entry, entry = entry.next) { 226 prev.next = entry.next; 229 fGrammars[index] = entry.next; 253 for (Entry entry = fGrammars[index] ; entry != null ; entry = entry.next) { 322 public Entry next; field in class:XMLGrammarPoolImpl.Entry 324 protected Entry(int hash, XMLGrammarDescription desc, Grammar grammar, Entry next) { argument [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/atomic/ |
H A D | AtomicIntegerFieldUpdater.java | 177 int next = current + 1; 178 if (compareAndSet(obj, current, next)) 193 int next = current - 1; 194 if (compareAndSet(obj, current, next)) 210 int next = current + delta; 211 if (compareAndSet(obj, current, next)) 226 int next = current + 1; 227 if (compareAndSet(obj, current, next)) 228 return next; 242 int next [all...] |
/openjdk7/jdk/src/windows/native/sun/windows/ |
H A D | Hashtable.cpp | 65 for (HashtableEntry* e = table[i] ; e != NULL ; e = e->next) { 78 for (HashtableEntry* e = table[index]; e != NULL; e = e->next) { 90 for (HashtableEntry* e = table[index]; e != NULL; e = e->next) { 113 old = old->next; 115 e->next = newTable[index]; 130 for (e = table[index]; e != NULL; e = e->next) { 152 e->next = table[index]; 167 for (HashtableEntry* e = table[index]; e != NULL ; prev = e, e = e->next) { 171 prev->next = e->next; 188 HashtableEntry* next = e->next; local [all...] |