| /external/guava/guava/src/com/google/common/collect/ |
| AbstractLinkedIterator.java | 28 * interface for sequences whose next element can always be derived from the
60 * {@link #next()} in order to compute the result of a <i>future</i> call to
61 * {@code next()}.
71 public final T next() { method in class:AbstractLinkedIterator
|
| AbstractSortedMultiset.java | 71 return entryIterator.hasNext() ? entryIterator.next() : null;
77 return entryIterator.hasNext() ? entryIterator.next() : null;
84 Entry<E> result = entryIterator.next();
96 Entry<E> result = entryIterator.next();
|
| DiscreteDomain.java | 27 * operations: {@link #next}, {@link #previous} and {@link #distance}, according
54 public abstract C next(C value); method in class:DiscreteDomain
59 * #next}.
69 * #next} (if positive) or {@link #previous} (if negative) are needed to reach
71 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
153 assertEquals(0, (int) iter.next());
177 // hasNext/next), but we'll cop out for now, knowing that
178 // next() both start by invoking hasNext() anyway.
|
| /external/icu4c/i18n/unicode/ |
| fpositer.h | 97 UBool next(FieldPosition& fp);
|
| /external/icu4c/layout/ |
| SubstitutionLookups.cpp | 21 of the previous sequenceIndex in the loop and doing next()
45 tempIterator.next(sequenceIndex);
|
| /external/iproute2/include/ |
| xt-internal.h | 37 struct xtables_rule_match *next; member in struct:xtables_rule_match
|
| /external/iproute2/misc/ |
| lnstat.h | 25 struct lnstat_file *next; member in struct:lnstat_file
|
| /external/ipsec-tools/src/racoon/ |
| isakmp_unity.h | 66 struct unity_netentry *next; member in struct:unity_netentry
|
| /external/javassist/src/main/javassist/convert/ |
| TransformCall.java | 34 public TransformCall(Transformer next, CtMethod origMethod,
37 this(next, origMethod.getName(), substMethod);
41 public TransformCall(Transformer next, String oldMethodName,
44 super(next);
|
| /external/libcap-ng/libcap-ng-0.7/utils/ |
| proc-llist.h | 40 struct _lnode* next; // Next node pointer member in struct:_lnode
|
| /external/libselinux/src/ |
| avc_sidtab.h | 14 struct sidtab_node *next; member in struct:sidtab_node
|
| /external/linux-tools-perf/util/ |
| parse-events.h | 23 struct tracepoint_path *next; member in struct:tracepoint_path
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_state_setup.h | 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_quad_fs.c | 16 * next paragraph) shall be included in all copies or substantial portions
141 qs->next->run(qs->next, quads, nr_quads);
151 qs->next->begin(qs->next);
|
| /external/mesa3d/src/glsl/ |
| ir_function.cpp | 11 * The above copyright notice and this permission notice (including the next
52 ; node_a = node_a->next, node_b = node_b->next) {
188 ; node_a = node_a->next, node_b = node_b->next) {
|
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.h | 11 * The above copyright notice and this permission notice (including the next
80 struct intel_resolve_map *next; member in struct:intel_resolve_map
|
| /external/oprofile/daemon/liblegacy/ |
| opd_mapping.h | 26 /** next mapping for this image */
27 struct list_head next; member in struct:opd_map
|
| opd_proc.h | 43 struct list_head next; member in struct:opd_proc
|
| /external/oprofile/libdb/ |
| db_debug.c | 33 index = data->node_base[index].next;
50 index = data->node_base[index].next;
60 index = data->node_base[index].next;
110 index = data->node_base[index].next;
|
| /external/qemu/ |
| acl.h | 37 QTAILQ_ENTRY(qemu_acl_entry) next; member in struct:qemu_acl_entry
|
| shaper.c | 56 struct QueuedPacketRec_* next; member in struct:QueuedPacketRec_
76 packet->next = NULL;
121 shaper->packets = packet->next;
122 packet->next = NULL;
145 shaper->packets = packet->next;
189 shaper->packets = packet->next;
243 pnode = &node->next;
245 packet->next = *pnode;
291 struct SessionRec_* next; member in struct:SessionRec_
415 pnode = &node->next;
[all...] |
| /external/qemu/android/utils/ |
| tempfile.c | 47 TempFile* next; member in struct:TempFile
103 tempfile->next = _all_tempfiles;
106 if ( !tempfile->next ) {
196 for (tempfile = _all_tempfiles; tempfile; tempfile = tempfile->next)
|
| /external/skia/include/core/ |
| SkTRegistry.h | 42 const SkTRegistry* next() const { return fChain; } function in class:SkTRegistry
|
| /external/skia/src/core/ |
| SkTextToPathIter.h | 33 bool next(const SkPath** path, SkScalar* xpos);
44 SkScalar fXPos; // accumulated xpos, returned in next
|
