| /external/libunwind/src/mi/ |
| dyn-cancel.c | 36 di->prev->next = di->next;
38 _U_dyn_info_list.first = di->next;
40 if (di->next)
41 di->next->prev = di->prev;
45 di->next = di->prev = NULL;
|
| /external/okhttp/okio/okio/src/main/java/okio/ |
| SegmentPool.java | 28 static Segment next; field in class:SegmentPool
38 if (next != null) {
39 Segment result = next;
40 next = result.next;
41 result.next = null;
50 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException();
55 segment.next = next;
57 next = segment
[all...] |
| /external/libusb-compat/libusb/ |
| usbi.h | 28 ent->next = begin; \
29 ent->next->prev = ent; \
31 ent->next = NULL; \
39 ent->prev->next = ent->next; \
41 begin = ent->next; \
42 if (ent->next) \
43 ent->next->prev = ent->prev; \
45 ent->next = NULL; \
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| insert_iter_iter.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);
74 assert(*next(m.begin(), 0) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 5);
47 assert(*next(m.begin(), 4) == 6);
48 assert(*next(m.begin(), 5) == 7);
49 assert(*next(m.begin(), 6) == 8);
51 i = m.erase(next(m.cbegin(), 0))
[all...] |
| erase_key.pass.cpp | 43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(m.begin(), 6) == 7);
50 assert(*next(m.begin(), 7) == 8);
55 assert(*next(m.begin(), 0) == 1);
56 assert(*next(m.begin(), 1) == 2)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4));
28 assert(i == 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);
34 assert(*next(c.begin(), 4) == 4);
35 assert(*next(c.begin(), 5) == 5);
36 assert(*next(c.begin(), 6) == 6)
[all...] |
| resize_size_value.pass.cpp | 30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
36 assert(*next(c.begin(), 0) == 0);
37 assert(*next(c.begin(), 1) == 1);
38 assert(*next(c.begin(), 2) == 2);
39 assert(*next(c.begin(), 3) == 10);
40 assert(*next(c.begin(), 4) == 10);
41 assert(*next(c.begin(), 5) == 10);
45 assert(*next(c.begin(), 0) == 0)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4));
28 assert(i == 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);
34 assert(*next(c.begin(), 4) == 4);
35 assert(*next(c.begin(), 5) == 5);
36 assert(*next(c.begin(), 6) == 6)
[all...] |
| resize_size_value.pass.cpp | 30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
36 assert(*next(c.begin(), 0) == 0);
37 assert(*next(c.begin(), 1) == 1);
38 assert(*next(c.begin(), 2) == 2);
39 assert(*next(c.begin(), 3) == 10);
40 assert(*next(c.begin(), 4) == 10);
41 assert(*next(c.begin(), 5) == 10);
45 assert(*next(c.begin(), 0) == 0)
[all...] |
| /external/ImageMagick/MagickCore/ |
| linked-list.c | 66 *next;
78 *next;
117 *next;
123 next=(ElementInfo *) AcquireMagickMemory(sizeof(*next));
124 if (next == (ElementInfo *) NULL)
126 next->value=(void *) value;
127 next->next=(ElementInfo *) NULL;
129 if (list_info->next == (ElementInfo *) NULL)
64 *next; member in struct:_ElementInfo
76 *next; member in struct:_LinkedListInfo
114 *next; local
171 *next; local
225 *next; local
385 *next; local
450 *next; local
555 *next; local
669 *next; local
761 *next; local
833 *next; local
921 *next; local
[all...] |
| /external/libdrm/ |
| libdrm_lists.h | 23 * next paragraph) shall be included in all copies or substantial portions
37 struct _drmMMListHead *next; member in struct:_drmMMListHead
43 (__item)->next = (__item); \
49 (__item)->next = (__list)->next; \
50 (__list)->next->prev = (__item); \
51 (__list)->next = (__item); \
56 (__item)->next = (__list); \
58 (__list)->prev->next = (__item); \
64 (__item)->prev->next = (__item)->next;
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| insert_iter_iter.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);
74 assert(*next(m.begin(), 0) == 1)
[all...] |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
42 assert(i == next(m.begin(), 5));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(m.begin(), 6) == 7)
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| iter_iter.pass.cpp | 43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 1);
45 assert(*next(m.begin(), 2) == 1);
46 assert(*next(m.begin(), 3) == 2);
47 assert(*next(m.begin(), 4) == 2);
48 assert(*next(m.begin(), 5) == 2);
49 assert(*next(m.begin(), 6) == 3);
50 assert(*next(m.begin(), 7) == 3);
51 assert(*next(m.begin(), 8) == 3);
72 assert(*next(m.begin(), 0) == 1)
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| erase_key.pass.cpp | 43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(m.begin(), 6) == 7);
50 assert(*next(m.begin(), 7) == 8);
55 assert(*next(m.begin(), 0) == 1);
56 assert(*next(m.begin(), 1) == 2)
[all...] |
| erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5));
42 assert(i == next(m.begin(), 5));
43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 2);
45 assert(*next(m.begin(), 2) == 3);
46 assert(*next(m.begin(), 3) == 4);
47 assert(*next(m.begin(), 4) == 5);
48 assert(*next(m.begin(), 5) == 6);
49 assert(*next(m.begin(), 6) == 7)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| iter_iter.pass.cpp | 43 assert(*next(m.begin(), 0) == 1);
44 assert(*next(m.begin(), 1) == 1);
45 assert(*next(m.begin(), 2) == 1);
46 assert(*next(m.begin(), 3) == 2);
47 assert(*next(m.begin(), 4) == 2);
48 assert(*next(m.begin(), 5) == 2);
49 assert(*next(m.begin(), 6) == 3);
50 assert(*next(m.begin(), 7) == 3);
51 assert(*next(m.begin(), 8) == 3);
72 assert(*next(m.begin(), 0) == 1)
[all...] |
| /libcore/ojluni/src/main/java/sun/util/ |
| ResourceBundleEnumeration.java | 55 String next = null; field in class:ResourceBundleEnumeration
58 if (next == null) {
60 next = iterator.next();
62 while (next == null && enumeration.hasMoreElements()) {
63 next = enumeration.nextElement();
64 if (set.contains(next)) {
65 next = null;
70 return next != null;
75 String result = next;
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(m.begin(), 5)->second == 6.5)
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(m.begin(), 5)->second == 6.5)
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next
41 struct intel_resolve_map **tail = &head->next;
50 tail = &(*tail)->next;
55 (*tail)->next = NULL;
70 struct intel_resolve_map *item = head->next;
76 item = item->next;
89 elem->prev->next = elem->next;
90 if (elem->next)
91 elem->next->prev = elem->prev
101 struct intel_resolve_map *next = head->next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(m.begin(), 5)->second == 6.5)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| erase_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(m.begin(), 5)->second == 6.5)
[all...] |
