/openjdk7/jdk/src/share/classes/sun/text/normalizer/ |
H A D | NormalizerBase.java | 807 * Return the next character in the normalized text and advance 813 public int next() { method in class:NormalizerBase 872 * while {@link #next} and {@link #previous} iterate through characters 875 * by <tt>next</tt> and <tt>previous</tt> and the indices passed to and 925 * {@link #next} and {@link #previous} iterate through characters in the 927 * correspondence between characters returned by <tt>next</tt> and 959 * over a string, calls to {@link #next} and {@link #previous} may 961 * until the iteration is able to re-sync at the next base character. 1263 * read forward and check if the character is a next-iteration boundary 1285 chars[0]=src.next(); 1402 private static int next(UCharacterIterator src, method in class:NormalizerBase [all...] |
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
H A D | Renderer.java | 44 // all the segments that cross the next scan line). 63 private int next() { method in class:Renderer.ScanlineIterator 450 int numCrossings = it.next();
|
/openjdk7/jdk/test/java/util/PluggableLocale/ |
H A D | fooprovider.jar | ... getText () public boolean isBoundary (int) public int last () public int next () public int next (int) public int preceding (int) public int ... |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | MultiDOM.java | 74 public int next() { method in class:MultiDOM.AxisIterator 78 return _source.next(); 213 public int next() { method in class:MultiDOM.NodeValueIterator 216 while ((node = _source.next()) != END) { 506 while ((node = nodes.next()) != DTM.NULL) {
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xpath/regex/ |
H A D | RegexParser.java | 132 this.next(); 164 final void next() { method in class:RegexParser 182 throw ex("parser.next.1", this.offset-1); 249 throw ex("parser.next.2", this.offset-1); 259 throw ex("parser.next.2", this.offset-3); 266 throw ex("parser.next.3", this.offset-3); 274 throw ex("parser.next.4", this.offset-1); 283 ret = T_CONDITION; // this.offsets points the next of '('. 286 throw ex("parser.next.2", this.offset-2); 293 throw ex("parser.next [all...] |
H A D | RegularExpression.java | 510 private Op compile(Token tok, Op next, boolean reverse) { argument 515 ret.next = next; 520 ret.next = next; 525 ret.next = next; 531 ret.next = next; 535 ret = next; [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/sax2dtm/ |
H A D | SAX2DTM2.java | 78 * i.e. subsequent call to next() should return END. 106 * Get the next node in the iteration. 108 * @return The next node handle in the iteration, or END if no more 111 public int next() method in class:SAX2DTM2.ChildrenIterator 136 * i.e. subsequent call to next() should return END. 181 * Get the next node in the iteration. In this case, we return 184 * @return The next node handle in the iteration, or END. 186 public int next() method in class:SAX2DTM2.ParentIterator 239 * i.e. subsequent call to next() should return END. 264 * Get the next nod 268 public int next() method in class:SAX2DTM2.TypedChildrenIterator 372 public int next() method in class:SAX2DTM2.TypedRootIterator 439 public int next() method in class:SAX2DTM2.FollowingSiblingIterator 473 public int next() method in class:SAX2DTM2.TypedFollowingSiblingIterator 535 public int next() method in class:SAX2DTM2.AttributeIterator 598 public int next() method in class:SAX2DTM2.TypedAttributeIterator 683 public int next() method in class:SAX2DTM2.PrecedingSiblingIterator 727 public int next() method in class:SAX2DTM2.TypedPrecedingSiblingIterator 909 public int next() method in class:SAX2DTM2.PrecedingIterator 983 public int next() method in class:SAX2DTM2.TypedPrecedingIterator 1115 public int next() method in class:SAX2DTM2.FollowingIterator 1168 public int next() method in class:SAX2DTM2.TypedFollowingIterator 1364 public int next() method in class:SAX2DTM2.AncestorIterator 1569 public int next() method in class:SAX2DTM2.DescendantIterator 1660 public int next() method in class:SAX2DTM2.TypedDescendantIterator 1749 public int next() method in class:SAX2DTM2.TypedSingletonIterator [all...] |
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/io/ |
H A D | ObjectStreamClass.java | 726 // The next check is more generic, since it covers the 782 // go on to the next source field 1421 descriptorFor[index] = e.next; 1432 prev.next = e.next; 1438 e = e.next; 1455 e.next = descriptorFor[index]; 1649 ObjectStreamClassEntry next; field in class:ObjectStreamClass.ObjectStreamClassEntry
|
/openjdk7/hotspot/agent/src/os/bsd/ |
H A D | ps_core.c | 68 lib = lib->next; 76 map_info* next = map->next; local 78 map = next; 88 map_info* next = map->next; local 90 map = next; 127 map->next = ph->core->maps; 143 map->next = ph->core->class_share_maps; 189 mp = mp->next; [all...] |
/openjdk7/hotspot/agent/src/os/linux/ |
H A D | ps_core.c | 68 lib = lib->next; 76 map_info* next = map->next; local 78 map = next; 88 map_info* next = map->next; local 90 map = next; 127 map->next = ph->core->maps; 143 map->next = ph->core->class_share_maps; 188 mp = mp->next; [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/win32/coff/ |
H A D | DebugVC50TypeIterator.java | 51 /** Go to the next type in the type table. NOTE that the iterator is 53 (!iter.done()) { ... iter.next(); } construct. 56 and next() is called. */ 57 public void next() throws NoSuchElementException; method in interface:DebugVC50TypeIterator 77 /** Goes to the next element in the current type string. NOTE that 400 count, skipping all intermediate indices. This is the next valid
|
/openjdk7/jdk/src/share/classes/java/io/ |
H A D | ObjectOutputStream.java | 2238 /* number of mappings in table/next available handle */ 2246 /* maps handle value -> next candidate handle value */ 2247 private int[] next; field in class:ObjectOutputStream.HandleTable 2257 next = new int[initialCapacity]; 2264 * Assigns next available handle to given object, and returns handle 2268 if (size >= next.length) { 2287 for (int i = spine[index]; i >= 0; i = next[i]) { 2318 next[handle] = spine[index]; 2339 int newLength = (next.length << 1) + 1; 2341 System.arraycopy(next, [all...] |
/openjdk7/jdk/src/share/classes/java/lang/invoke/ |
H A D | MethodType.java | 1044 // The next size value at which to resize (capacity * load factor). 1116 Entry next = p.next; 1119 table[i] = next; 1121 prev.next = next; 1122 entry.next = null; 1127 p = next; 1163 e = e.next; 1182 for (Entry e = tab[i]; e != null; e = e.next) { 1265 Entry next; field in class:MethodType.WeakInternSet.Entry 1270 Entry(MethodType key, ReferenceQueue<Object> queue, int hash, Entry next) argument [all...] |
/openjdk7/jdk/src/share/classes/java/sql/ |
H A D | ResultSet.java | 39 * before the first row. The <code>next</code> method moves the 40 * cursor to the next row, and because it returns <code>false</code> 137 * to retrieve the next result from a sequence of multiple results. 154 * <code>next</code> makes the first row the current row; the 157 * When a call to the <code>next</code> method returns <code>false</code>, 164 * subsequent call to <code>next</code>. 167 * to the method <code>next</code> will 176 boolean next() throws SQLException; method in interface:ResultSet 197 * re-executed, or is used to retrieve the next result from a 430 * read prior to getting the value of any other column. The next [all...] |
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Scanner.java | 48 * various <tt>next</tt> methods. 72 * System.out.println(s.next()); 73 * System.out.println(s.next()); 102 * <p>The {@link #next} and {@link #hasNext} methods and their 105 * pattern, and then attempt to return the next token. Both <tt>hasNext</tt> 106 * and <tt>next</tt> methods may block waiting for further input. Whether a 108 * associated <tt>next</tt> method will block. 974 // Must look for next delims. Simply attempting to match the 979 // Then look for next delims 983 // Zero length delimiter match; we should find the next on 1402 public String next() { method in class:Scanner 1462 public String next(String pattern) { method in class:Scanner 1509 public String next(Pattern pattern) { method in class:Scanner [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 119 * <p>We also use "next" links to implement blocking mechanics. 121 * predecessor signals the next node to wake up by traversing 122 * next link to determine which thread it is. Determination of 124 * the "next" fields of their predecessors. This is solved 127 * (Or, said differently, the next-links are an optimization 170 * waitStatus value to indicate the next acquireShared should 229 * assign next field of a predecessor until after attachment, 230 * so seeing a null next field does not necessarily mean that 231 * node is at end of queue. However, if a next field appears 233 * double-check. The next fiel 237 volatile Node next; field in class:AbstractQueuedLongSynchronizer.Node [all...] |
H A D | AbstractQueuedSynchronizer.java | 71 * mechanical sense that when a shared mode acquire succeeds, the next 342 * <p>We also use "next" links to implement blocking mechanics. 344 * predecessor signals the next node to wake up by traversing 345 * next link to determine which thread it is. Determination of 347 * the "next" fields of their predecessors. This is solved 350 * (Or, said differently, the next-links are an optimization 393 * waitStatus value to indicate the next acquireShared should 452 * assign next field of a predecessor until after attachment, 453 * so seeing a null next field does not necessarily mean that 454 * node is at end of queue. However, if a next fiel 460 volatile Node next; field in class:AbstractQueuedSynchronizer.Node [all...] |
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | classLoader.hpp | 54 ClassPathEntry* next() { return _next; } function in class:ClassPathEntry 55 void set_next(ClassPathEntry* next) { argument 57 OrderAccess::release_store_ptr(&_next, next); 310 e = e->next();
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | codeCache.cpp | 130 CodeBlob* CodeCache::next(CodeBlob* cb) { function in class:CodeCache 132 return (CodeBlob*)_heap->next(cb); 138 while (cb != NULL && !cb->is_alive()) cb = next(cb); 145 while (cb != NULL && (!cb->is_alive() || !cb->is_nmethod())) cb = next(cb); 153 cb = next(cb); 160 cb = next(cb); 162 cb = next(cb); 245 #define FOR_ALL_BLOBS(var) for (CodeBlob *var = first() ; var != NULL; var = next(var) ) 246 #define FOR_ALL_ALIVE_BLOBS(var) for (CodeBlob *var = alive(first()); var != NULL; var = alive(next(var))) 247 #define FOR_ALL_ALIVE_NMETHODS(var) for (nmethod *var = alive_nmethod(first()); var != NULL; var = alive_nmethod(next(va 363 nmethod* next = cur->scavenge_root_link(); local 385 nmethod* next = cur->scavenge_root_link(); local [all...] |
/openjdk7/hotspot/src/share/vm/compiler/ |
H A D | compileBroker.hpp | 95 CompileTask* next() const { return _next; } function in class:CompileTask 96 void set_next(CompileTask* next) { _next = next; } argument
|
H A D | compilerOracle.cpp | 65 Symbol* signature, MethodMatcher* next); 66 MethodMatcher(Symbol* class_name, Symbol* method_name, MethodMatcher* next); 86 MethodMatcher* next() const { return _next; } function in class:MethodMatcher 118 MethodMatcher::MethodMatcher(Symbol* class_name, Symbol* method_name, MethodMatcher* next) { argument 121 _next = next; 130 Symbol* signature, MethodMatcher* next): 133 , _next(next) 176 Symbol* signature, const char * opt, MethodMatcher* next): 177 MethodMatcher(class_name, class_mode, method_name, method_mode, signature, next) { 191 current = current->next(); 128 MethodMatcher(Symbol* class_name, Mode class_mode, Symbol* method_name, Mode method_mode, Symbol* signature, MethodMatcher* next) argument 174 MethodOptionMatcher(Symbol* class_name, Mode class_mode, Symbol* method_name, Mode method_mode, Symbol* signature, const char * opt, MethodMatcher* next) argument 196 MethodOptionMatcher* next() { function in class:MethodOptionMatcher [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegion.cpp | 63 // _vo == UseNextMarking -> use "next" marking information, 570 // we find to be self-forwarded on the next bitmap. So all 682 HeapWord* next = cur; local 683 while (next <= start) { 684 cur = next; 691 next = (cur + obj->size()); 716 next = (cur + obj->size()); 719 if (next < end || !obj->is_objArray()) { 730 cur = next;
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | allocation.cpp | 175 Chunk* _first; // first cached Chunk; its first word points to next chunk 189 _first = _first->next(); 231 Chunk* next; local 238 for (size_t i = 0; i < (n - 1) && cur != NULL; i++) cur = cur->next(); 241 next = cur->next(); 243 cur = next; 253 next = cur->next(); 255 cur = next; [all...] |
H A D | allocation.hpp | 263 void next_chop(); // Chop next chunk 267 Chunk* next() const { return _next; } function in class:Chunk
|
H A D | generation.cpp | 163 int next = level() + 1; local 164 if (next < gch->_n_gens) { 165 return gch->_gens[next];
|