Searched refs:next (Results 101 - 125 of 4188) sorted by relevance

1234567891011>>

/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DRangeValueIterator.java37 * while (iterator.next(result)) {
94 * <p>Returns the next maximal result range with a common value and returns
103 public boolean next(Element element); method in interface:RangeValueIterator
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/
H A Diter_iter_comp.pass.cpp46 assert(*next(m.begin()) == V(1, 1.5));
47 assert(*next(m.begin(), 2) == V(1, 2));
48 assert(*next(m.begin(), 3) == V(2, 1));
49 assert(*next(m.begin(), 4) == V(2, 1.5));
50 assert(*next(m.begin(), 5) == V(2, 2));
51 assert(*next(m.begin(), 6) == V(3, 1));
52 assert(*next(m.begin(), 7) == V(3, 1.5));
53 assert(*next(m.begin(), 8) == V(3, 2));
76 assert(*next(m.begin()) == V(1, 1.5));
77 assert(*next(
[all...]
H A Diter_iter_comp_alloc.pass.cpp49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2));
81 assert(*next(m.begin()) == V(1, 1.5));
82 assert(*next(
[all...]
/external/lldb/test/python_api/value/linked_list/
H A Dmain.cpp14 Task *next; member in class:Task
17 next(n)
32 task1->next = task2;
33 task2->next = task4;
34 task4->next = task5;
41 t = t->next;
51 task_evil->next = task_2;
52 task_2->next = task_3;
53 task_3->next = task_evil; // In order to cause inifinite loop. :-)
/external/mockito/cglib-and-asm/src/org/mockito/asm/
H A DEdge.java71 * The next edge in the list of successors of the originating basic block.
74 Edge next; field in class:Edge
/external/skia/src/core/
H A DSkAutoKern.h15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
/external/skia/src/pathops/
H A DSkAddIntersections.h15 bool AddIntersectTs(SkOpContour* test, SkOpContour* next, SkOpCoincidence* coincidence,
/external/mesa3d/src/glsl/
H A Dlist.h11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
75 struct exec_node *next; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
229 void next() function in class:iterator
251 void next() function in class:exec_list_iterator
[all...]
/external/v8/test/mjsunit/es6/
H A Darguments-iterator.js41 assertIteratorResult(a, false, iterator.next());
42 assertIteratorResult(b, false, iterator.next());
43 assertIteratorResult(c, false, iterator.next());
44 assertIteratorResult(undefined, true, iterator.next());
52 assertIteratorResult(a, false, iterator.next());
53 assertIteratorResult(b, false, iterator.next());
54 assertIteratorResult(c, false, iterator.next());
55 assertIteratorResult(undefined, true, iterator.next());
62 assertIteratorResult(a, false, iterator.next());
63 assertIteratorResult(b, false, iterator.next());
[all...]
H A Dcollection-iterator.js18 assertArrayEquals(['next'], propertyNames);
32 assertEquals({value: 1, done: false}, iter.next());
33 assertEquals({value: 2, done: false}, iter.next());
34 assertEquals({value: 3, done: false}, iter.next());
35 assertEquals({value: undefined, done: true}, iter.next());
36 assertEquals({value: undefined, done: true}, iter.next());
52 assertEquals({value: [1, 1], done: false}, iter.next());
53 assertEquals({value: [2, 2], done: false}, iter.next());
54 assertEquals({value: [3, 3], done: false}, iter.next());
55 assertEquals({value: undefined, done: true}, iter.next());
[all...]
H A Darray-iterator.js62 assertIteratorResult('a', false, iterator.next());
63 assertIteratorResult('b', false, iterator.next());
64 assertIteratorResult('c', false, iterator.next());
65 assertIteratorResult(void 0, true, iterator.next());
68 assertIteratorResult(void 0, true, iterator.next());
76 assertIteratorResult('a', false, iterator.next());
77 assertIteratorResult('b', false, iterator.next());
78 assertIteratorResult('c', false, iterator.next());
80 assertIteratorResult('d', false, iterator.next());
81 assertIteratorResult(void 0, true, iterator.next());
[all...]
H A Dgenerators-iteration.js39 assertIteratorResult(undefined, true, iter.next());
40 assertDoesNotThrow(function() { iter.next(); });
53 var result = iter.next();
70 // var v3 = iter.next();
71 assertIteratorResult(v1, v2, iter.next());
80 iter.next(send_val));
90 iter.next());
367 assertIteratorResult(1, false, iter.next());
368 assertIteratorResult(2, false, iter.next());
369 assertIteratorResult(3, false, iter.next());
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/
H A DBitsStreamGenerator.java48 /** Generate next pseudorandom number.
53 * {@link #next(int)} and {@link #nextLong()}.</p>
57 protected abstract int next(int bits); method in class:BitsStreamGenerator
61 return next(1) != 0;
69 final int random = next(32);
76 int random = next(32);
85 final long high = ((long) next(26)) << 26;
86 final int low = next(26);
92 return next(23) * 0x1.0p-23f;
119 return next(3
[all...]
/external/dhcpcd/
H A Deloop.c46 struct event *next; member in struct:event
55 struct timeout *next; member in struct:timeout
68 for (e = events; e; e = e->next) {
80 free_events = e->next;
86 e->next = NULL;
88 last->next = e;
98 for (e = events; e; e = e->next) {
101 last->next = e->next;
103 events = e->next;
[all...]
/external/vboot_reference/firmware/stub/
H A Dvboot_api_stub_sf.c26 struct alloc_node *next; member in struct:alloc_node
57 node->next = alloc_head;
70 for (nodep = &alloc_head; *nodep; nodep = &(*nodep)->next)
79 struct alloc_node **nodep, *next; local
83 next = (*nodep)->next;
85 *nodep = next;
107 struct alloc_node *node, *next; local
117 for (node = alloc_head; node; node = next) {
118 next
[all...]
/external/clang/test/CodeGen/
H A D2002-02-14-EntryNodePreds.c11 struct edge_rec *next; member in struct:edge_rec
33 return (int)basel->next;
H A Dtypes.c4 struct FileName *next; member in struct:FileName
9 struct ieeeExternal *next; member in struct:ieeeExternal
/external/linux-tools-perf/src/tools/perf/util/include/linux/
H A Dtypes.h18 struct list_head *next, *prev; member in struct:list_head
26 struct hlist_node *next, **pprev; member in struct:hlist_node
/external/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/
H A DNDC.java68 int next = getDepth();
69 if (next == 0) {
72 int last = next - 1;
80 int next = getDepth();
81 if (next == 0) {
84 int last = next - 1;
91 int next = getDepth();
92 MDC.put(PREFIX + next, message);
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/
H A Demplace_after.pass.cpp35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == Emplaceable(1, 2.5));
40 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == Emplaceable(1, 2.5));
44 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == Emplaceable(3, 4.5));
51 assert(*next(c.begin(), 2) == Emplaceable(1, 2.5));
52 assert(*next(
[all...]
H A Dinsert_after_const.pass.cpp33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
38 i = c.insert_after(next(c.cbegin()), 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
46 assert(i == next(c.begin()));
48 assert(*next(c.begin(), 1) == 3);
49 assert(*next(c.begin(), 2) == 1);
50 assert(*next(
[all...]
H A Dinsert_after_rv.pass.cpp35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == 1);
40 i = c.insert_after(next(c.cbegin()), 2);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == 1);
44 assert(*next(c.begin(), 2) == 2);
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == 3);
51 assert(*next(c.begin(), 2) == 1);
52 assert(*next(
[all...]
/external/mockito/src/org/mockito/internal/configuration/injection/filter/
H A DTypeBasedCandidateFilter.java14 MockCandidateFilter next; field in class:TypeBasedCandidateFilter
16 public TypeBasedCandidateFilter(MockCandidateFilter next) { argument
17 this.next = next;
28 return next.filterCandidate(mockTypeMatches, field, fieldInstance);
/external/mesa3d/src/glx/
H A Dglxconfig.c12 * The above copyright notice and this permission notice (including the next
228 struct glx_config **next; local
231 next = &base;
233 *next = (struct glx_config *) malloc(size);
234 if (*next == NULL) {
240 (void) memset(*next, 0, size);
241 (*next)->visualID = GLX_DONT_CARE;
242 (*next)->visualType = GLX_DONT_CARE;
243 (*next)->visualRating = GLX_NONE;
244 (*next)
270 struct glx_config *const next = configs->next; local
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_cfg.cpp11 * The above copyright notice and this permission notice (including the next
81 fs_bblock *next; local
114 next = new_block();
115 next->start = (fs_inst *)inst->next;
116 cur_if->add_successor(mem_ctx, next);
118 set_next_block(next);
124 next = new_block();
125 next->start = (fs_inst *)inst->next;
[all...]

Completed in 5088 milliseconds

1234567891011>>