/external/e2fsprogs/lib/et/ |
H A D | error_table.h | 18 struct et_list *next; member in struct:et_list
|
/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 21 struct et_list *next; member in struct:et_list 42 for (end = list, et = *list; et; end = &et->next, et = et->next) 53 et->next = 0;
|
H A D | heimdal3.c | 22 struct et_list *next; member in struct:et_list 43 for (end = list, et = *list; et; end = &et->next, et = et->next) 54 et->next = 0;
|
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
H A D | CDL.java | 49 * Get the next value. The value can be wrapped in quotes. The value can 58 c = x.next(); 90 char c = x.next();
|
/external/guava/guava/src/com/google/common/base/ |
H A D | AbstractIterator.java | 40 private T next; field in class:AbstractIterator 64 next = computeNext(); 73 public final T next() { method in class:AbstractIterator 78 return next;
|
/external/iproute2/genl/ |
H A D | genl_utils.h | 9 struct genl_util *next; member in struct:genl_util
|
/external/ipsec-tools/src/racoon/ |
H A D | throttle.h | 39 TAILQ_ENTRY(throttle_entry) next; member in struct:throttle_entry
|
/external/javassist/src/main/javassist/convert/ |
H A D | TransformAfter.java | 23 public TransformAfter(Transformer next, argument 27 super(next, origMethod, afterMethod); 37 pos = iterator.next(); 44 return iterator.next();
|
/external/libcxx/test/containers/associative/map/map.cons/ |
H A D | assign_initializer_list.pass.cpp | 45 assert(*next(m.begin()) == V(2, 1)); 46 assert(*next(m.begin(), 2) == V(3, 1)); 70 assert(*next(m.begin()) == V(2, 1)); 71 assert(*next(m.begin(), 2) == V(3, 1));
|
H A D | initializer_list.pass.cpp | 41 assert(*next(m.begin()) == V(2, 1)); 42 assert(*next(m.begin(), 2) == V(3, 1)); 62 assert(*next(m.begin()) == V(2, 1)); 63 assert(*next(m.begin(), 2) == V(3, 1));
|
/external/libcxx/test/containers/associative/map/map.modifiers/ |
H A D | insert_initializer_list.pass.cpp | 43 assert(*next(m.begin()) == V(2, 1)); 44 assert(*next(m.begin(), 2) == V(3, 1)); 66 assert(*next(m.begin()) == V(2, 1)); 67 assert(*next(m.begin(), 2) == V(3, 1));
|
/external/libcxx/test/containers/associative/set/ |
H A D | insert_iter_iter.pass.cpp | 45 assert(*next(m.begin()) == 2); 46 assert(*next(m.begin(), 2) == 3); 69 assert(*next(m.begin()) == 2); 70 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/containers/associative/set/set.cons/ |
H A D | iter_iter.pass.cpp | 44 assert(*next(m.begin()) == 2); 45 assert(*next(m.begin(), 2) == 3); 67 assert(*next(m.begin()) == 2); 68 assert(*next(m.begin(), 2) == 3);
|
/external/mesa3d/src/gallium/drivers/trace/ |
H A D | tr_screen.h | 15 * next paragraph) shall be included in all copies or substantial portions 42 struct tr_list *next; member in struct:tr_list
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Handler.java | 69 Handler next;
field in class:Handler
|
/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/skia/src/pathops/ |
H A D | SkAddIntersections.h | 14 bool AddIntersectTs(SkOpContour* test, SkOpContour* next);
|
/external/chromium_org/third_party/libaddressinput/src/cpp/src/ |
H A D | address_field_util.cc | 71 for (std::string::const_iterator next = format.begin(); 72 next != format.end(); prev = ++next) { 73 // Find the next field element or newline (indicated by %<TOKEN>). 74 if ((next = std::find(next, format.end(), '%')) == format.end()) { 78 if (prev < next) { 80 elements->push_back(FormatElement(std::string(prev, next))); 82 if ((prev = ++next) == format.end()) { 88 if (*next [all...] |
/external/okhttp/okio/src/main/java/okio/ |
H A D | Segment.java | 36 /** The next byte of application data byte to read in this segment. */ 43 Segment next; field in class:Segment 53 Segment result = next != this ? next : null; 54 prev.next = next; 55 next.prev = prev; 56 next = null; 67 segment.next = next; [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/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/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | Iterator.h | 22 virtual ScriptValue next(ScriptState*, ExceptionState&) = 0; 23 virtual ScriptValue next(ScriptState*, ScriptValue /* value */, ExceptionState&) = 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();
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
H A D | AtomicDouble.java | 96 long next = doubleToRawLongBits(newValue); 97 value = next; 108 // long next = doubleToRawLongBits(newValue); 109 // updater.lazySet(this, next); 119 long next = doubleToRawLongBits(newValue); 120 return longBitsToDouble(updater.getAndSet(this, next)); 171 long next = doubleToRawLongBits(nextVal); 172 if (updater.compareAndSet(this, current, next)) { 189 long next = doubleToRawLongBits(nextVal); 190 if (updater.compareAndSet(this, current, next)) { [all...] |
/external/hamcrest/src/org/hamcrest/internal/ |
H A D | SelfDescribingValueIterator.java | 18 public SelfDescribing next() { method in class:SelfDescribingValueIterator 19 return new SelfDescribingValue<T>(values.next());
|