Searched defs:next (Results 251 - 275 of 702) sorted by relevance

<<11121314151617181920>>

/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DMultiValuedNodeHeapIterator.java39 * the next DTM node handle available form the heap node.</p>
41 * heap, the heap node is advanced to the next DTM node handle it makes
42 * available, and the heap nature of the heap is restored to ensure the next
43 * DTM node handle pulled is next in document order overall.
50 comparison on the value of their next() method
62 * Advance to the next node represented by this {@link HeapNode}
64 * @return the next DTM node.
93 * Remembers the current node for the next call to {@link #gotoMark()}.
142 // next; used to prune duplicates
183 public int next() { method in class:MultiValuedNodeHeapIterator
[all...]
H A DSortingIterator.java43 private int _current; // index in _nodes of the next node to try
51 public int next() { method in class:SortingIterator
62 while ((node = _source.next()) != END) {
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/runtime/
H A DHashtable.java43 HashtableEntry next; field in class:HashtableEntry
50 entry.next = (next != null) ? (HashtableEntry)next.clone() : null;
137 for (e = tab[i] ; e != null ; e = e.next) {
155 for (e = tab[index] ; e != null ; e = e.next)
171 for (e = tab[index] ; e != null ; e = e.next)
199 old = old.next;
201 e.next = newTable[index];
225 for (e = tab[index] ; e != null ; e = e.next) {
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/util/
H A DAugmentationsImpl.java216 int next = 0; field in class:AugmentationsImpl.SmallContainer.SmallContainerKeyEnumeration
225 return next < enumArray.length;
229 if (next >= enumArray.length) {
233 Object nextVal = enumArray[next];
234 enumArray[next] = null;
235 next++;
H A DNamespaceSupport.java418 public Object next() { method in class:NamespaceSupport.IteratorPrefixes
H A DXMLGrammarPoolImpl.java102 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/jaxp/src/javax/xml/validation/
H A DSchemaFactoryFinder.java220 URL resource = (URL)sitr.next();
359 public final Object next() { method in class:SchemaFactoryFinder.SingleIterator
513 public Object next() {
/openjdk7/jaxp/src/javax/xml/xpath/
H A DXPathFactoryFinder.java217 URL resource = (URL)sitr.next();
449 public final Object next() { method in class:XPathFactoryFinder.SingleIterator
513 public Object next() {
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/oa/toa/
H A DTransientObjectManager.java156 java.lang.Object servant=null; // also stores "next pointer" in free list
163 Element(int i, java.lang.Object next) argument
165 servant = next;
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/
H A DCacheTable.java39 Entry next; // this chains the collision list of table "map" field in class:CacheTable.Entry
44 next = null;
84 for (Entry e = oldMap[i]; e != null; e = e.next)
112 for (Entry e = map[index]; e != null; e = e.next) {
125 newEntry.next = map[index];
139 for (Entry e = map[index]; e != null; e = e.next) {
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/transport/
H A DCorbaContactInfoListIteratorImpl.java106 // wraps sticky or default. Then hasNext and next just call
126 public Object next() method in class:CorbaContactInfoListIteratorImpl
140 primaryToContactInfo.next(primaryContactInfo,
145 effectiveTargetIORIterator.next();
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/util/
H A DIdentityHashtable.java52 IdentityHashtableEntry next; field in class:IdentityHashtableEntry
184 for (IdentityHashtableEntry e = tab[i] ; e != null ; e = e.next) {
206 for (IdentityHashtableEntry e = tab[index] ; e != null ; e = e.next) {
228 for (IdentityHashtableEntry e = tab[index] ; e != null ; e = e.next) {
259 old = old.next;
262 e.next = newTable[index];
295 for (IdentityHashtableEntry e = tab[index] ; e != null ; e = e.next) {
314 e.next = tab[index];
333 for (IdentityHashtableEntry e = tab[index], prev = null ; e != null ; prev = e, e = e.next) {
336 prev.next
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/
H A DLongHashMap.java44 private Entry next; field in class:LongHashMap.Entry
46 Entry(int hash, long key, Object value, Entry next) { argument
50 this.next = next;
273 for (Entry e = tab[index]; e != null; e = e.next)
293 for (Entry e = tab[i] ; e != null ; e = e.next)
298 for (Entry e = tab[i] ; e != null ; e = e.next)
324 for (Entry e = tab[index] ; e != null ; e = e.next) {
371 prev = e, e = e.next) {
375 prev.next
453 newEntry(int hash, long key, Object value, Entry next) argument
[all...]
H A DPage.java34 private Page next; field in class:Page
79 return next;
82 public void setNext(Page next) { argument
83 this.next = next;
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/
H A DBytecodeStream.java36 private int _next_bci; // bci of next bytecode
66 public int next() { method in class:BytecodeStream
84 // set next bytecode position
/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DSegment.java180 public char next() { method in class:Segment
/openjdk7/jdk/src/share/classes/sun/awt/image/
H A DImageDecoder.java41 ImageDecoder next; field in class:ImageDecoder
65 cq = ((cq == null) ? queue : cq.next);
70 cq = cq.next;
/openjdk7/jdk/src/share/classes/sun/font/
H A DScriptRun.java61 * while (scriptRun.next()) {
148 * Find the next script run. Returns <code>false</code> if there
153 public final boolean next() { method in class:ScriptRun
223 // the next run. Back over it so we'll see
224 // it again the next time.
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DFlatteningPathIterator.java71 // returned in the next call to
129 next(false);
189 * Moves the iterator to the next segment of the path forwards
193 public void next() { method in class:FlatteningPathIterator
194 next(true);
197 private void next(boolean doNext) { method in class:FlatteningPathIterator
202 src.next();
259 // the former curve and one of them is in the next
261 // curves level values to the next higher level.
306 // the former curve and one of them is in the next
[all...]
/openjdk7/jdk/src/share/classes/java/security/
H A DSecureRandom.java472 final protected int next(int numBits) { method in class:SecureRandom
475 int next = 0;
479 next = (next << 8) + (b[i] & 0xFF);
481 return next >>> (numBytes*8 - numBits);
/openjdk7/jdk/src/share/classes/java/text/
H A DCollationElementIterator.java86 * int primaryOrder = CollationElementIterator.primaryOrder(collationElementIterator.next());
93 * <code>CollationElementIterator.next</code> returns the collation order
94 * of the next character. A collation order consists of primary order,
97 * is its primary order; the next 8 bits is the secondary order and the
120 * NULLORDER will be returned on the calls to next().
138 * NULLORDER will be returned on the calls to next().
151 * Resets the cursor to the beginning of the string. The next call
152 * to next() will return the first collation element in the string.
168 * Get the next collation element in the string. <p>This iterator iterates
172 * collation element [or ordering priority] of the next characte
181 public int next() method in class:CollationElementIterator
[all...]
H A DPatternEntry.java207 public PatternEntry next() throws ParseException { method in class:PatternEntry.Parser
/openjdk7/jdk/src/share/classes/java/util/
H A DJumboEnumSet.java130 public E next() { method in class:JumboEnumSet.EnumSetIterator
H A DRandom.java98 long next = current * 181783497276652981L;
99 if (seedUniquifier.compareAndSet(current, next))
100 return next;
110 * number generator which is maintained by method {@link #next}.
159 * Generates the next pseudorandom number. Subclasses should
162 * <p>The general contract of {@code next} is that it returns an
167 * likely to be {@code 0} or {@code 1}. The method {@code next} is
179 * @return the next pseudorandom value from this random number
183 protected int next(int bits) { method in class:Random
221 * Returns the next pseudorando
[all...]
H A DRegularEnumSet.java99 public E next() { method in class:RegularEnumSet.EnumSetIterator

Completed in 57 milliseconds

<<11121314151617181920>>