/external/nist-sip/java/gov/nist/javax/sip/address/ |
H A D | NetObjectList.java | 111 /** returns the next element 114 public GenericObject next() { method in class:NetObjectList 115 return (NetObject) super.next(); 118 /** returns the next element 122 public GenericObject next(ListIterator li) { method in class:NetObjectList 123 return (NetObject) super.next(li);
|
/external/okhttp/okio/okio/src/main/java/okio/ |
H A D | AsyncTimeout.java | 46 * <p>Head's 'next' points to the first element of the linked list. The first 47 * element is the next node to time out, or null if the queue is empty. The 55 /** The next node in the linked list. */ 56 private AsyncTimeout next; field in class:AsyncTimeout 95 for (AsyncTimeout prev = head; true; prev = prev.next) { 96 if (prev.next == null || remainingNanos < prev.next.remainingNanos(now)) { 97 node.next = prev.next; 98 prev.next [all...] |
H A D | Segment.java | 31 * limits, prev, and next references are not shared. 39 /** The next byte of application data byte to read in this segment. */ 52 Segment next; field in class:Segment 81 Segment result = next != this ? next : null; 82 prev.next = next; 83 next.prev = prev; 84 next = null; 95 segment.next [all...] |
/external/squashfs-tools/squashfs-tools/ |
H A D | sort.h | 29 struct priority_entry *next; member in struct:priority_entry
|
/external/syslinux/com32/lib/syslinux/ |
H A D | freelist.c | 43 list = list->next;
|
/external/syslinux/core/fs/ntfs/ |
H A D | runlist.h | 31 struct runlist *next; member in struct:runlist 49 rlist->next = NULL; 65 tail->next = n; 78 *rlist = ret->next;
|
/external/syslinux/core/thread/ |
H A D | root_thread.c | 6 .list = { .next = &__root_thread.list, .prev = &__root_thread.list },
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_list.h | 42 x->next = nullptr; 46 x->next = nullptr; 47 last_->next = x; 55 x->next = nullptr; 59 x->next = first_; 67 first_ = first_->next; 85 l->last_->next = first_; 99 last_->next = l->first_; 112 for (Item *i = first_; ; i = i->next) { 117 CHECK_EQ(last_->next, [all...] |
/external/skia/src/pathops/ |
H A D | SkOpSpan.cpp | 22 while ((ptT = ptT->next()) != stopPtT) { 35 while ((ptT = ptT->next()) != stopPtT) { 47 while ((ptT = ptT->next()) != stopPtT) { 58 while ((ptT = ptT->next()) != stopPtT) { 70 while ((ptT = ptT->next()) != stopPtT) { 131 SkOpPtT* next = this; local 132 while ((next = next->fNext) != this) { 133 result = next; 169 while ((walk = walk->next()) ! 211 const SkOpSpanBase* next = this; local 256 SkOpPtT* next = remainder->next(); local 376 const SkOpSpan* next = fCoincident; local 404 SkOpPtT* next = &fPtT; local 439 SkOpSpanBase* next = this->next(); local [all...] |
/external/bison/lib/ |
H A D | hash.c | 49 struct hash_entry *next; member in struct:hash_entry 186 while (cursor = cursor->next, cursor) 218 while (cursor = cursor->next, cursor) 269 for (cursor = bucket; cursor; cursor = cursor->next) 312 /* Find next entry in the same bucket. */ 316 if (cursor->data == entry && cursor->next) 317 return cursor->next->data; 318 cursor = cursor->next; 347 for (cursor = bucket; cursor; cursor = cursor->next) 379 for (cursor = bucket; cursor; cursor = cursor->next) 662 struct hash_entry *next; local 700 struct hash_entry *next; local 811 struct hash_entry *next = bucket->next; local 837 struct hash_entry *next = cursor->next; local 864 struct hash_entry *next; local 1190 struct hash_entry *next; local [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
H A D | equal_range.pass.cpp | 50 assert(r.second == next(m.begin(), 3)); 52 assert(r.first == next(m.begin(), 3)); 53 assert(r.second == next(m.begin(), 3)); 55 assert(r.first == next(m.begin(), 3)); 56 assert(r.second == next(m.begin(), 6)); 58 assert(r.first == next(m.begin(), 6)); 59 assert(r.second == next(m.begin(), 6)); 61 assert(r.first == next(m.begin(), 6)); 62 assert(r.second == next(m.begin(), 9)); 87 assert(r.second == next( [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | ReverseAxesWalker.java | 70 * Get the next node in document order on the axes. 72 * @return the next node in document order on the axes, or null. 79 int next = m_iterator.next(); 84 if (DTM.NULL == next) 87 return next; 150 int next; 152 while (DTM.NULL != (next = clone.nextNode())) 213 int next; 215 while (DTM.NULL != (next [all...] |
/external/clang/lib/Basic/ |
H A D | VersionTuple.cpp | 44 char next = input[0]; local 46 if (next < '0' || next > '9') return true; 47 value = (unsigned) (next - '0'); 50 next = input[0]; 51 if (next < '0' || next > '9') return false; 53 value = value * 10 + (unsigned) (next - '0');
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingIterator.java | 47 public T next() { method in class:ForwardingIterator 48 return delegate().next();
|
H A D | AbstractIterator.java | 46 * String s = in.next(); 71 /** We have computed the next element and haven't returned it yet. */ 84 private T next; field in class:AbstractIterator 87 * Returns the next element. <b>Note:</b> the implementation must call {@link 91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls 93 * next} following each successful call to {@code next}. Once the 98 * {@code hasNext} or {@code next} invocation that invoked this method. Any 103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an 106 * @return the next elemen 152 public final T next() { method in class:AbstractIterator [all...] |
/external/guava/guava/src/com/google/common/util/concurrent/ |
H A D | AtomicDouble.java | 94 long next = doubleToRawLongBits(newValue); 95 value = next; 106 // long next = doubleToRawLongBits(newValue); 107 // updater.lazySet(this, next); 117 long next = doubleToRawLongBits(newValue); 118 return longBitsToDouble(updater.getAndSet(this, next)); 169 long next = doubleToRawLongBits(nextVal); 170 if (updater.compareAndSet(this, current, next)) { 187 long next = doubleToRawLongBits(nextVal); 188 if (updater.compareAndSet(this, current, next)) { [all...] |
/external/hamcrest/hamcrest-core/src/main/java/org/hamcrest/internal/ |
H A D | SelfDescribingValueIterator.java | 20 public SelfDescribing next() { method in class:SelfDescribingValueIterator 21 return new SelfDescribingValue<T>(values.next());
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2); 46 assert(next(m.begin())->second == 1); 47 assert(next(m.begin(), 2)->first == 3); 48 assert(next(m.begin(), 2)->second == 1); 71 assert(next(m.begin())->first == 2); 72 assert(next(m.begin())->second == 1); 73 assert(next(m.begin(), 2)->first == 3); 74 assert(next(m.begin(), 2)->second == 1);
|
/external/libusb-compat/examples/ |
H A D | lsusb.c | 33 for (bus = busses; bus; bus = bus->next) { 35 for (dev = bus->devices; dev; dev = dev->next) {
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
H A D | PVisitedNetworkIDParser.java | 135 char next = this.lexer.getNextChar(); 136 if (next == '\"') { 139 } else if (next == '\0') { 141 } else if (next == '\\') { 142 retval.append(next); 143 next = this.lexer.getNextChar(); 144 retval.append(next); 146 retval.append(next);
|
/external/skia/src/core/ |
H A D | SkAutoKern.h | 14 #define SkAutoKern_Adjust(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractBiMapTest.java | 30 // The next two tests verify that map entries are not accessed after they're 40 iterator.next(); 41 iterator.next(); 43 iterator.next(); 57 iterator.next(); 58 iterator.next(); 60 iterator.next();
|
H A D | UnmodifiableListIteratorTest.java | 38 assertEquals("a", iterator.next()); 49 assertEquals("a", iterator.next()); 50 assertEquals("b", iterator.next()); 62 assertEquals("a", iterator.next()); 63 assertEquals("b", iterator.next()); 81 public String next() {
|
/external/ltp/tools/top-LTP/proc/ |
H A D | pwcache.c | 27 struct pwbuf *next; member in struct:pwbuf 41 p = &(*p)->next; 49 (*p)->next = NULL; 54 struct grpbuf *next; member in struct:grpbuf 68 g = &(*g)->next; 76 (*g)->next = NULL;
|
/external/mesa3d/src/gallium/auxiliary/pipe-loader/ |
H A D | pipe_loader.c | 15 * next paragraph) shall be included in all copies or substantial portions 76 const char *next; local 80 for (next = library_paths; *next; library_paths = next + 1) { 81 next = util_strchrnul(library_paths, ':'); 82 len = next - library_paths;
|