| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy_assign.pass.cpp | 47 assert(*next(m.begin(), 0) == 1);
48 assert(*next(m.begin(), 1) == 1);
49 assert(*next(m.begin(), 2) == 1);
50 assert(*next(m.begin(), 3) == 2);
51 assert(*next(m.begin(), 4) == 2);
52 assert(*next(m.begin(), 5) == 2);
53 assert(*next(m.begin(), 6) == 3);
54 assert(*next(m.begin(), 7) == 3);
55 assert(*next(m.begin(), 8) == 3);
61 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter_comp.pass.cpp | 44 assert(*next(m.begin(), 0) == 1);
45 assert(*next(m.begin(), 1) == 1);
46 assert(*next(m.begin(), 2) == 1);
47 assert(*next(m.begin(), 3) == 2);
48 assert(*next(m.begin(), 4) == 2);
49 assert(*next(m.begin(), 5) == 2);
50 assert(*next(m.begin(), 6) == 3);
51 assert(*next(m.begin(), 7) == 3);
52 assert(*next(m.begin(), 8) == 3);
|
| 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...] |
| /external/dhcpcd/ |
| if-pref.c | 81 if (!ifaces || !ifaces->next)
84 ifaces = ifaces->next;
85 sorted->next = NULL;
86 for (ifp = ifaces; ifp && (ifn = ifp->next, 1); ifp = ifn) {
89 ifp->next = sorted;
94 for (ift = sorted; ift->next; ift = ift->next) {
95 if (ifcmp(ifp, ift->next) == -1) {
96 ifp->next = ift->next;
[all...] |
| /external/v8/src/ |
| unbound-queue-inl.h | 39 : value(value), next(NULL) {
43 Node* next; member in struct:v8::internal::UnboundQueue::Node
63 first_ = tmp->next;
71 Node* next = reinterpret_cast<Node*>(divider_)->next; local
72 *rec = next->value;
73 OS::ReleaseStore(÷r_, reinterpret_cast<AtomicWord>(next));
79 Node*& next = reinterpret_cast<Node*>(last_)->next; local
80 next = new Node(rec)
89 Node* next = reinterpret_cast<Node*>(divider_)->next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 0));
46 assert(r.first == next(m.begin(), 0));
47 assert(r.second == next(m.begin(), 3));
49 assert(r.first == next(m.begin(), 3));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 6));
55 assert(r.first == next(m.begin(), 6));
56 assert(r.second == next(m.begin(), 6))
[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
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
[all...] |
| /external/oprofile/libutil/ |
| op_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
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/event/ |
| Event.java | 39 // A dead key, which means a character that should combine with what is coming next. Examples
64 // The next event, if any. Null if there is no next event yet.
68 private Event(final int type, final int codePoint, final Event next) {
71 mNextEvent = next;
74 public static Event createDeadEvent(final int codePoint, final Event next) {
75 return new Event(EVENT_DEAD, codePoint, next);
78 public static Event createCommittableEvent(final int codePoint, final Event next) {
79 return new Event(EVENT_COMMITTABLE, codePoint, next);
|
| /system/core/libcutils/ |
| list.c | 21 node->next = node;
27 item->next = head;
29 head->prev->next = item;
35 item->next->prev = item->prev;
36 item->prev->next = item->next;
|
| /external/chromium_org/third_party/openssl/openssl/crypto/pqueue/ |
| pqueue.c | 79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > item *
170 pitem *next; local
[all...] |
| /external/openssl/crypto/pqueue/ |
| pqueue.c | 79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > item *
170 pitem *next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| equal_range.pass.cpp | 42 assert(r.first == next(m.begin(), 0));
43 assert(r.second == next(m.begin(), 1));
45 assert(r.first == next(m.begin(), 1));
46 assert(r.second == next(m.begin(), 2));
48 assert(r.first == next(m.begin(), 2));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 4));
54 assert(r.first == next(m.begin(), 4));
55 assert(r.second == next(m.begin(), 5))
[all...] |
| upper_bound.pass.cpp | 42 assert(r == next(m.begin(), 1));
44 assert(r == next(m.begin(), 2));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 4));
50 assert(r == next(m.begin(), 5));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 7));
56 assert(r == next(m.begin(), 8));
58 assert(r == next(m.begin(), 0));
60 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 44 assert(r == next(m.begin()));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 0));
60 assert(r == next(m.begin(), 1));
62 assert(r == next(m.begin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| upper_bound.pass.cpp | 42 assert(r == next(m.begin(), 1));
44 assert(r == next(m.begin(), 2));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 4));
50 assert(r == next(m.begin(), 5));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 7));
56 assert(r == next(m.begin(), 8));
58 assert(r == next(m.begin(), 0));
60 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 44 assert(r == next(m.begin()));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 0));
60 assert(r == next(m.begin(), 1));
62 assert(r == next(m.begin(), 2))
[all...] |
| /bionic/libc/bionic/ |
| pthread_internals.cpp | 38 if (thread->next != NULL) {
39 thread->next->prev = thread->prev;
42 thread->prev->next = thread->next;
44 gThreadList = thread->next;
58 thread->next = gThreadList;
60 if (thread->next != NULL) {
61 thread->next->prev = thread;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| FontFamily.cpp | 37 for (ap = a.next(), bp = b.next(); ap != bp; ap = ap->next(), bp = bp->next()) {
|
| /external/tcpdump/ |
| cpack.c | 52 /* Advance to the next wordsize boundary. Return NULL if fewer than
59 u_int8_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;
87 u_int8_t *next; local
89 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL)
92 *u = EXTRACT_LE_64BITS(next);
95 cs->c_next = next + sizeof(*u);
103 u_int8_t *next; local
119 u_int8_t *next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
