| /external/elfutils/lib/ |
| list.h | 36 assert (_newp->next == NULL); \
39 (first) = _newp->next = _newp->previous = _newp; \
42 _newp->next = (first); \
44 _newp->previous->next = _newp->next->previous = _newp; \
55 || ({ __typeof (elem) _runp = first->next; \
60 _runp = _runp->next; \
62 if (unlikely (_elem->next == _elem)) \
66 _elem->next->previous = _elem->previous; \
67 _elem->previous->next = _elem->next;
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 2);
53 assert(*next(m.begin(), 2) == 3);
54 assert(*next(m.begin(), 3) == 5);
55 assert(*next(m.begin(), 4) == 6);
56 assert(*next(m.begin(), 5) == 7);
57 assert(*next(m.begin(), 6) == 8);
59 i = m.erase(next(m.cbegin(), 0))
[all...] |
| erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(m.begin(), 0) == 3)
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 2);
53 assert(*next(m.begin(), 2) == 3);
54 assert(*next(m.begin(), 3) == 5);
55 assert(*next(m.begin(), 4) == 6);
56 assert(*next(m.begin(), 5) == 7);
57 assert(*next(m.begin(), 6) == 8);
59 i = m.erase(next(m.cbegin(), 0))
[all...] |
| /hardware/intel/common/libwsbm/src/ |
| wsbm_util.h | 18 struct _WsbmListHead *next; member in struct:_WsbmListHead
24 (__item)->next = (__item); \
30 (__item)->next = (__list)->next; \
31 (__list)->next->prev = (__item); \
32 (__list)->next = (__item); \
37 (__item)->next = (__list); \
39 (__list)->prev->next = (__item); \
45 (__item)->prev->next = (__item)->next; \
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 2);
53 assert(*next(m.begin(), 2) == 3);
54 assert(*next(m.begin(), 3) == 5);
55 assert(*next(m.begin(), 4) == 6);
56 assert(*next(m.begin(), 5) == 7);
57 assert(*next(m.begin(), 6) == 8);
59 i = m.erase(next(m.cbegin(), 0))
[all...] |
| erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(m.begin(), 0) == 3)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
51 assert(*next(m.begin(), 0) == 1);
52 assert(*next(m.begin(), 1) == 2);
53 assert(*next(m.begin(), 2) == 3);
54 assert(*next(m.begin(), 3) == 5);
55 assert(*next(m.begin(), 4) == 6);
56 assert(*next(m.begin(), 5) == 7);
57 assert(*next(m.begin(), 6) == 8);
59 i = m.erase(next(m.cbegin(), 0))
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
53 assert(next(m.begin())->first == 2);
54 assert(next(m.begin())->second == 2.5);
55 assert(next(m.begin(), 2)->first == 3);
56 assert(next(m.begin(), 2)->second == 3.5);
57 assert(next(m.begin(), 3)->first == 5);
58 assert(next(m.begin(), 3)->second == 5.5);
59 assert(next(m.begin(), 4)->first == 6);
60 assert(next(m.begin(), 4)->second == 6.5)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3));
50 assert(i == next(m.begin(), 3));
53 assert(next(m.begin())->first == 2);
54 assert(next(m.begin())->second == 2.5);
55 assert(next(m.begin(), 2)->first == 3);
56 assert(next(m.begin(), 2)->second == 3.5);
57 assert(next(m.begin(), 3)->first == 5);
58 assert(next(m.begin(), 3)->second == 5.5);
59 assert(next(m.begin(), 4)->first == 6);
60 assert(next(m.begin(), 4)->second == 6.5)
[all...] |
| /device/google/contexthub/firmware/os/inc/ |
| list.h | 24 struct link_t *prev, *next; member in struct:link_t
28 for ((cur_link) = (list)->next, \
29 (tmp_link) = (cur_link) ? (cur_link)->next : NULL; \
31 (cur_link) = (tmp_link), (tmp_link) = (cur_link)->next)
34 link_t list = { .prev = &list, .next = &list }
38 list->prev = list->next = list;
43 if (!list->next)
47 item->next = list;
48 list->prev->next = item;
54 item->prev->next = item->next
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(m.begin(), 4)->second == 1.5)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.modifiers/ |
| erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(m.begin(), 4)->second == 1.5)
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 1));
48 assert(r.first == next(m.begin(), 1));
49 assert(r.second == next(m.begin(), 2));
51 assert(r.first == next(m.begin(), 2));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 4));
57 assert(r.first == next(m.begin(), 4));
58 assert(r.second == next(m.begin(), 5))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.ops/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 1));
48 assert(r.first == next(m.begin(), 1));
49 assert(r.second == next(m.begin(), 2));
51 assert(r.first == next(m.begin(), 2));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 4));
57 assert(r.first == next(m.begin(), 4));
58 assert(r.second == next(m.begin(), 5))
[all...] |
| /external/mesa3d/src/util/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
70 (elem)->next = (list)->next; \
71 (list)->next->prev = elem; \
72 (list)->next = elem; \
83 (elem)->next = list; \
85 (list)->prev->next = elem;
[all...] |
| /system/core/libcutils/include/cutils/ |
| list.h | 28 struct listnode *next; member in struct:listnode
37 .next = &(name), \
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
48 for ((node) = (list)->next, (n) = (node)->next; \
50 (node) = (n), (n) = (node)->next)
54 node->next = node;
60 item->next = head;
62 head->prev->next = item
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| copy.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...] |
| 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);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/multiset.cons/ |
| copy.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...] |
| 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);
|
| /libcore/ojluni/src/main/java/java/io/ |
| StringReader.java | 40 private int next = 0; field in class:StringReader
70 if (next >= length)
72 return str.charAt(next++);
97 if (next >= length)
99 int n = Math.min(length - next, len);
100 str.getChars(next, next + n, cbuf, off);
101 next += n;
125 if (next >= length)
128 long n = Math.min(length - next, ns)
[all...] |
| /libcore/ojluni/src/main/java/java/nio/file/ |
| FileTreeIterator.java | 43 * Event ev = iterator.next();
53 private Event next; field in class:FileTreeIterator
72 this.next = walker.walk(start);
73 assert next.type() == FileTreeWalker.EventType.ENTRY ||
74 next.type() == FileTreeWalker.EventType.START_DIRECTORY;
77 IOException ioe = next.ioeException();
83 if (next == null) {
84 FileTreeWalker.Event ev = walker.next();
92 next = ev;
95 ev = walker.next();
109 public Event next() { method in class:FileTreeIterator
[all...] |
