| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| copy_alloc.pass.cpp | 45 assert(*next(m.begin(), 0) == 1);
46 assert(*next(m.begin(), 1) == 1);
47 assert(*next(m.begin(), 2) == 1);
48 assert(*next(m.begin(), 3) == 2);
49 assert(*next(m.begin(), 4) == 2);
50 assert(*next(m.begin(), 5) == 2);
51 assert(*next(m.begin(), 6) == 3);
52 assert(*next(m.begin(), 7) == 3);
53 assert(*next(m.begin(), 8) == 3);
59 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter_alloc.pass.cpp | 51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 1);
53 assert(*next(m.begin(), 2) == 1);
54 assert(*next(m.begin(), 3) == 2);
55 assert(*next(m.begin(), 4) == 2);
56 assert(*next(m.begin(), 5) == 2);
57 assert(*next(m.begin(), 6) == 3);
58 assert(*next(m.begin(), 7) == 3);
59 assert(*next(m.begin(), 8) == 3);
83 assert(*next(m.begin(), 0) == 1)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/multiset.cons/ |
| copy_alloc.pass.cpp | 45 assert(*next(m.begin(), 0) == 1);
46 assert(*next(m.begin(), 1) == 1);
47 assert(*next(m.begin(), 2) == 1);
48 assert(*next(m.begin(), 3) == 2);
49 assert(*next(m.begin(), 4) == 2);
50 assert(*next(m.begin(), 5) == 2);
51 assert(*next(m.begin(), 6) == 3);
52 assert(*next(m.begin(), 7) == 3);
53 assert(*next(m.begin(), 8) == 3);
59 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter_alloc.pass.cpp | 51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 1);
53 assert(*next(m.begin(), 2) == 1);
54 assert(*next(m.begin(), 3) == 2);
55 assert(*next(m.begin(), 4) == 2);
56 assert(*next(m.begin(), 5) == 2);
57 assert(*next(m.begin(), 6) == 3);
58 assert(*next(m.begin(), 7) == 3);
59 assert(*next(m.begin(), 8) == 3);
83 assert(*next(m.begin(), 0) == 1)
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 * the prev/next entries already!
42 struct list_head * next)
44 next->prev = add;
45 add->next = next;
47 prev->next = add;
60 __list_add(add, head, head->next);
[all...] |
| /hardware/interfaces/tv/cec/1.0/ |
| IHdmiCec.hal | 39 @callflow(next={"*"})
49 @callflow(next="addLogicalAddress")
66 @callflow(next="*")
84 @callflow(next="*")
94 @callflow(next={"addLogicalAddress"})
103 @callflow(next={"*"})
113 @callflow(next={"*"})
121 @callflow(next={"*"})
132 @callflow(next="*")
143 @callflow(next="*"
[all...] |
| /external/expat/xmlwf/ |
| ct.c | 118 const char *next, *p; local
121 next = buf;
122 p = getTok(&next);
123 if (matchkey(p, next, "text"))
125 else if (!matchkey(p, next, "application"))
127 p = getTok(&next);
130 p = getTok(&next);
131 if (matchkey(p, next, "xml"))
133 p = getTok(&next);
136 p = getTok(&next);
[all...] |
| xmlmime.c | 122 const char *next, *p; local
125 next = buf;
126 p = getTok(&next);
127 if (matchkey(p, next, "text"))
129 else if (!matchkey(p, next, "application"))
131 p = getTok(&next);
134 p = getTok(&next);
136 if (!matchkey(p, next, "xml") && charset[0] == '\0')
139 p = getTok(&next);
142 p = getTok(&next);
[all...] |
| /external/fio/lib/ |
| flist_sort.c | 23 tail->next = a;
24 a = a->next;
26 tail->next = b;
27 b = b->next;
29 tail = tail->next;
31 tail->next = a?:b;
32 return head.next;
53 tail->next = a;
55 a = a->next;
57 tail->next = b
[all...] |
| /external/clang/test/CodeGen/ |
| disable-tail-calls.c | 4 struct List *next; member in struct:List
15 return find(head->next, data);
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1);
46 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->first == 1);
48 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->first == 2);
50 assert(next(m.begin(), 3)->second == 1);
51 assert(next(m.begin(), 4)->first == 2);
52 assert(next(m.begin(), 4)->second == 1.5);
53 assert(next(m.begin(), 5)->first == 2);
54 assert(next(m.begin(), 5)->second == 2)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
33 assert(*next(c.begin(), 3) == 3);
35 i = c.erase_after(next(c.cbefore_begin(), 0));
38 assert(*next(c.begin(), 0) == 1);
39 assert(*next(c.begin(), 1) == 2);
40 assert(*next(c.begin(), 2) == 3);
42 i = c.erase_after(next(c.cbefore_begin(), 1))
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_job_queue.h | 30 // Pointer to the next link in the job queue
31 void *next; member in struct:__anon26237
39 // Pointer to the next link in the job queue
40 void *next; member in struct:__anon26238
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
148 struct draw_stage *next = draw->pipeline.rasterize; local
154 /* Set the validate's next stage to the rasterize stage, so that it
157 stage->next = next;
183 draw->pipeline.aaline->next = next;
184 next = draw->pipeline.aaline;
189 draw->pipeline.aapoint->next = next;
[all...] |
| /frameworks/base/services/accessibility/java/com/android/server/accessibility/ |
| BaseEventStreamTransformation.java | 23 public void setNext(EventStreamTransformation next) {
24 mNext = next;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1);
46 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->first == 1);
48 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->first == 2);
50 assert(next(m.begin(), 3)->second == 1);
51 assert(next(m.begin(), 4)->first == 2);
52 assert(next(m.begin(), 4)->second == 1.5);
53 assert(next(m.begin(), 5)->first == 2);
54 assert(next(m.begin(), 5)->second == 2)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
33 assert(*next(c.begin(), 3) == 3);
35 i = c.erase_after(next(c.cbefore_begin(), 0));
38 assert(*next(c.begin(), 0) == 1);
39 assert(*next(c.begin(), 1) == 2);
40 assert(*next(c.begin(), 2) == 3);
42 i = c.erase_after(next(c.cbefore_begin(), 1))
[all...] |
| /external/annotation-tools/asmx/src/org/objectweb/asm/ |
| Edge.java | 53 * The next edge in the list of successors of the originating basic block.
56 Edge next; field in class:Edge
|
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/serialization/ |
| FwdRef.java | 28 FwdRef next; field in class:FwdRef
|
| /external/skia/src/pathops/ |
| SkAddIntersections.h | 15 bool AddIntersectTs(SkOpContour* test, SkOpContour* next, SkOpCoincidence* coincidence);
|
| /external/skqp/src/pathops/ |
| SkAddIntersections.h | 15 bool AddIntersectTs(SkOpContour* test, SkOpContour* next, SkOpCoincidence* coincidence);
|
| /external/tcpdump/ |
| cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than
59 const uint8_t *next; local
62 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize);
65 if (next - cs->c_buf + wordsize > cs->c_len)
68 return next;
98 const uint8_t *next; local
100 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL)
103 *u = EXTRACT_LE_64BITS(next);
106 cs->c_next = next + sizeof(*u);
114 const uint8_t *next; local
130 const uint8_t *next; local
[all...] |
| /external/adhd/cras/src/common/ |
| utlist.h | 38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
66 (add)->next = head; \
75 while (_tmp->next) \
76 _tmp = _tmp->next; \
77 _tmp->next = (head2); \
85 (add)->next = NULL; \
88 while (_tmp->next) \
89 _tmp = _tmp->next; \
[all...] |
| /external/mesa3d/src/gallium/state_trackers/nine/ |
| nine_shader.h | 11 * The above copyright notice and this permission notice (including the next
38 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */
124 struct nine_shader_variant *next; member in struct:nine_shader_variant
132 while (list->key != key && list->next)
133 list = list->next;
143 while (list->next) {
145 list = list->next;
147 list->next = MALLOC_STRUCT(nine_shader_variant);
148 if (!list->next)
150 list->next->next = NULL
168 struct nine_shader_variant_so *next; member in struct:nine_shader_variant_so
[all...] |
| /external/turbine/java/com/google/turbine/parse/ |
| VariableInitializerParser.java | 84 private void next() { method in class:VariableInitializerParser
85 token = lexer.next();
95 next(); method
105 next(); method
117 next(); method
121 next(); method
126 next(); method
131 next(); method
136 next(); method
141 next(); method
153 next(); method
157 next(); method
169 next(); method
174 next(); method
178 next(); method
181 next(); method
189 next(); method
192 next(); method
199 next(); method
227 next(); method
232 next(); method
237 next(); method
249 next(); method
254 next(); method
259 next(); method
307 next(); method
313 next(); method
317 next(); method
321 next(); method
325 next(); method
328 next(); method
[all...] |
