Searched defs:next (Results 351 - 375 of 702) sorted by relevance

<<11121314151617181920>>

/openjdk7/corba/src/share/classes/org/omg/CORBA/
H A DDynAny.java111 * object, it initializes the next component of the constructed data
128 * object, it initializes the next component of the constructed data
145 * object, it initializes the next component of the constructed data
162 * object, it initializes the next component of the constructed data
179 * object, it initializes the next component of the constructed data
196 * object, it initializes the next component of the constructed data
213 * object, it initializes the next component of the constructed data
230 * object, it initializes the next component of the constructed data
247 * object, it initializes the next component of the constructed data
264 * object, it initializes the next componen
711 public boolean next() ; method in interface:DynAny
[all...]
/openjdk7/hotspot/agent/src/os/bsd/
H A Dlibproc_impl.h43 struct lib_info* next; member in struct:lib_info
51 struct thread_info* next; member in struct:thread_info
60 struct map_info* next; member in struct:map_info
/openjdk7/hotspot/agent/src/os/linux/
H A Dlibproc_impl.h43 struct lib_info* next; member in struct:lib_info
51 struct thread_info* next; member in struct:thread_info
60 struct map_info* next; member in struct:map_info
/openjdk7/jdk/src/share/classes/javax/print/
H A DMimeType.java153 public Object next() { method in class:MimeType.ParameterMapEntrySetIterator
/openjdk7/jdk/src/share/classes/javax/swing/text/html/parser/
H A DDTD.java306 protected ContentModel defContentModel(int type, Object obj, ContentModel next) { argument
307 return new ContentModel(type, obj, next);
413 ContentModel next = readContentModel(in, names);
414 return defContentModel(type, m, next);
419 ContentModel next = readContentModel(in, names);
420 return defContentModel(type, el, next);
/openjdk7/jdk/src/share/classes/sun/awt/util/
H A DIdentityLinkedList.java100 header.next = header.previous = header;
126 return header.next.element;
149 return remove(header.next);
168 addBefore(e, header.next);
230 for (Entry<E> e = header.next; e != header; e = e.next) {
284 predecessor.next = e;
297 Entry<E> e = header.next;
299 Entry<E> next = e.next;
654 private Entry<E> next; field in class:IdentityLinkedList.ListItr
677 public E next() { method in class:IdentityLinkedList.ListItr
749 Entry<E> next; field in class:IdentityLinkedList.Entry
752 Entry(E element, Entry<E> next, Entry<E> previous) argument
795 public E next() { method in class:IdentityLinkedList.DescendingIterator
[all...]
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DArea.java186 pi.next();
685 public void next() { method in class:AreaIterator
/openjdk7/jdk/src/share/classes/java/text/
H A DBreakIterator.java146 * for (int end = boundary.next();
148 * start = end, end = boundary.next()) {
174 * int end = boundary.next();
202 * Find the next word:
209 * int current = wb.next();
216 * current = wb.next();
224 * that each represent the end of one sentence and the beginning of the next.
228 * of a word: If the characters between this boundary and the next boundary
231 * and the next is a word; otherwise, it's the material between words.)
262 * DONE is returned by previous(), next(), nex
301 public abstract int next(int n); method in class:BreakIterator
314 public abstract int next(); method in class:BreakIterator
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DAbstractList.java181 if (it.next()==null)
185 if (o.equals(it.next()))
332 * Index of element to be returned by subsequent call to next.
337 * Index of element returned by most recent call to next or
354 public E next() { method in class:AbstractList.Itr
358 E next = get(i);
361 return next;
521 E o1 = e1.next();
522 Object o2 = e2.next();
559 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next}
[all...]
H A DArrayDeque.java106 * The index at which the next element would be added to the tail
605 * Index of element to be returned by subsequent call to next.
616 * Index of element returned by most recent call to next.
625 public E next() { method in class:ArrayDeque.DeqIterator
641 if (delete(lastRet)) { // if left-shifted, undo increment in next()
663 public E next() { method in class:ArrayDeque.DescendingIterator
H A DEnumMap.java177 keyType = m.keySet().iterator().next().getDeclaringClass();
518 // Lower bound on index of next element to return
547 public K next() { method in class:EnumMap.KeyIterator
556 public V next() { method in class:EnumMap.ValueIterator
567 public Map.Entry<K,V> next() { method in class:EnumMap.EntryIterator
H A DLinkedHashMap.java257 e.next = newTable[index];
324 Entry(int hash, K key, V value, HashMap.Entry<K,V> next) { argument
325 super(hash, key, value, next);
405 public K next() { return nextEntry().getKey(); } method in class:LinkedHashMap.KeyIterator
409 public V next() { return nextEntry().value; } method in class:LinkedHashMap.ValueIterator
413 public Map.Entry<K,V> next() { return nextEntry(); } method in class:LinkedHashMap.EntryIterator
H A DPriorityQueue.java475 * subsequent call to next.
480 * Index of element returned by most recent call to next,
500 * Element returned by the most recent call to next iff that
517 public E next() { method in class:PriorityQueue.Itr
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DArrayBlockingQueue.java89 /** items index for next take, poll, peek or remove */
92 /** items index for next put, offer, or add */
734 * have moved between calls to next.
738 private int nextIndex; // Index of element to be returned by next
739 private E nextItem; // Element to be returned by next call to next
740 private E lastItem; // Element returned by last call to next
759 public E next() { method in class:ArrayBlockingQueue.Itr
H A DConcurrentLinkedQueue.java121 * - There is exactly one (last) Node with a null next reference,
180 volatile Node<E> next; field in class:ConcurrentLinkedQueue.Node
215 (k.getDeclaredField("next"));
228 * - (tmp = head).next != tmp || tmp != head
238 * node with node.next == null) can be reached in O(1) time.
246 * - tail.next may or may not be self-pointing to tail.
309 * Returns the successor of p, or the head node if p.next has been
314 Node<E> next = p.next;
315 return (p == next)
735 public E next() { method in class:ConcurrentLinkedQueue.Itr
[all...]
H A DFutureTask.java352 volatile WaitNode next; field in class:FutureTask.WaitNode
370 WaitNode next = q.next;
371 if (next == null)
373 q.next = null; // unlink to help gc
374 q = next;
415 q.next = waiters, q);
445 s = q.next;
449 pred.next = s;
H A DLinkedBlockingQueue.java114 * self-link implicitly means to advance to head.next.
126 * - this Node, meaning the successor is head.next
129 Node<E> next; field in class:LinkedBlockingQueue.Node
148 * Invariant: last.next == null
198 // assert last.next == null;
199 last = last.next = node;
211 Node<E> first = h.next;
212 h.next = h; // help GC
510 Node<E> first = head.next;
525 // p.next i
824 public E next() { method in class:LinkedBlockingQueue.Itr
[all...]
H A DPriorityBlockingQueue.java875 int cursor; // index of next element to return
887 public E next() { method in class:PriorityBlockingQueue.Itr
/openjdk7/jdk/src/share/classes/javax/naming/directory/
H A DBasicAttribute.java539 public Object next() throws NamingException { method in class:BasicAttribute.ValuesEnumImpl
/openjdk7/hotspot/src/share/vm/classfile/
H A Ddictionary.hpp138 ProtectionDomainEntry(oop protection_domain, ProtectionDomainEntry* next) { argument
140 _next = next;
143 ProtectionDomainEntry* next() { return _next; } function in class:ProtectionDomainEntry
168 DictionaryEntry* next() const { function in class:DictionaryEntry
169 return (DictionaryEntry*)HashtableEntry<klassOop, mtClass>::next();
250 SymbolPropertyEntry* next() const { function in class:SymbolPropertyEntry
251 return (SymbolPropertyEntry*)HashtableEntry<Symbol*, mtSymbol>::next();
H A DstackMapTable.cpp43 StackMapFrame* frame = reader->next(
213 StackMapFrame* StackMapReader::next( function in class:StackMapReader
/openjdk7/hotspot/src/share/vm/code/
H A Dstubs.hpp220 Stub* next(Stub* s) const { int i = index_of(s) + stub_size(s); function in class:StubQueue
H A Dvmreg.hpp130 VMReg next() { function in class:VMRegImpl
134 VMReg next(int i) { function in class:VMRegImpl
210 void set2 ( VMReg v ) { _second=v->next(); _first=v; }
214 _second = ptr->next();
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DpromotionInfo.hpp67 inline PromotedObject* next() const { function in class:VALUE_OBJ_CLASS_SPEC
71 // The next pointer is a compressed oop stored in the top 32 bits
176 markOop nextDisplacedHeader(); // get next header & forward spool pointer
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DgcTimer.cpp176 GCPhase* TimePartitionPhasesIterator::next() { function in class:TimePartitionPhasesIterator
211 validate_pause_phase(iter.next(), 0, "PausePhase", 2, 8);
227 validate_pause_phase(iter.next(), 0, "PausePhase1", 2, 3);
228 validate_pause_phase(iter.next(), 0, "PausePhase2", 4, 6);
245 validate_pause_phase(iter.next(), 0, "PausePhase", 2, 5);
246 validate_pause_phase(iter.next(), 1, "SubPhase", 3, 4);
267 validate_pause_phase(iter.next(), 0, "PausePhase", 2, 9);
268 validate_pause_phase(iter.next(), 1, "SubPhase1", 3, 8);
269 validate_pause_phase(iter.next(), 2, "SubPhase2", 4, 7);
270 validate_pause_phase(iter.next(),
[all...]

Completed in 172 milliseconds

<<11121314151617181920>>