| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| H A D | insert_after_init.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 0);
33 assert(distance(c.begin(), c.end()) == 3);
34 assert(*next(c.begin(), 0) == 0);
35 assert(*next(c.begin(), 1) == 1);
36 assert(*next(c.begin(), 2) == 2);
38 i = c.insert_after(c.begin(), {3, 4});
39 assert(i == next(c.begin(), 2));
40 assert(distance(c.begin(), c.end()) == 5);
41 assert(*next(c.begin(), 0) == 0);
42 assert(*next(c.begin(),
[all...] |
| H A D | insert_after_range.pass.cpp | 33 assert(distance(c.begin(), c.end()) == 0);
37 assert(distance(c.begin(), c.end()) == 3);
38 assert(*next(c.begin(), 0) == 0);
39 assert(*next(c.begin(), 1) == 1);
40 assert(*next(c.begin(), 2) == 2);
42 i = c.insert_after(c.begin(), J(t+3), J(t+5));
43 assert(i == next(c.begin(), 2));
44 assert(distance(c.begin(), c.end()) == 5);
45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(),
[all...] |
| H A D | insert_after_size_value.pass.cpp | 28 assert(distance(c.begin(), c.end()) == 0);
32 assert(distance(c.begin(), c.end()) == 3);
33 assert(*next(c.begin(), 0) == 3);
34 assert(*next(c.begin(), 1) == 3);
35 assert(*next(c.begin(), 2) == 3);
37 i = c.insert_after(c.begin(), 2, 2);
38 assert(i == next(c.begin(), 2));
39 assert(distance(c.begin(), c.end()) == 5);
40 assert(*next(c.begin(), 0) == 3);
41 assert(*next(c.begin(),
[all...] |
| /external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| H A D | insert_iter_iter.pass.cpp | 43 assert(m.begin()->first == 1);
44 assert(m.begin()->second == 1);
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(),
[all...] |
| /external/libcxx/test/containers/associative/multiset/ |
| H A D | 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(),
[all...] |
| H A D | erase_iter_iter.pass.cpp | 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);
50 assert(*next(m.begin(), 7) == 8);
54 assert(i == next(m.begin(),
[all...] |
| /external/libusb-compat/libusb/ |
| H A D | usbi.h | 25 #define LIST_ADD(begin, ent) \
27 if (begin) { \
28 ent->next = begin; \
33 begin = ent; \
36 #define LIST_DEL(begin, ent) \
41 begin = ent->next; \
|
| /external/libcxx/test/containers/associative/map/map.ops/ |
| H A D | equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 1));
46 assert(r.first == next(m.begin(), 1));
47 assert(r.second == next(m.begin(), 2));
49 assert(r.first == next(m.begin(), 2));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 4));
55 assert(r.first == next(m.begin(), 4));
56 assert(r.second == next(m.begin(),
[all...] |
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| H A D | member_swap.pass.cpp | 27 C c1(std::begin(t1), std::end(t1), A(1));
29 C c2(std::begin(t2), std::end(t2), A(2));
32 assert(distance(c1.begin(), c1.end()) == 3);
33 assert(*next(c1.begin(), 0) == 10);
34 assert(*next(c1.begin(), 1) == 11);
35 assert(*next(c1.begin(), 2) == 12);
38 assert(distance(c2.begin(), c2.end()) == 6);
39 assert(*next(c2.begin(), 0) == 0);
40 assert(*next(c2.begin(), 1) == 1);
41 assert(*next(c2.begin(),
[all...] |
| H A D | non_member_swap.pass.cpp | 28 C c1(std::begin(t1), std::end(t1), A(1));
30 C c2(std::begin(t2), std::end(t2), A(2));
33 assert(distance(c1.begin(), c1.end()) == 3);
34 assert(*next(c1.begin(), 0) == 10);
35 assert(*next(c1.begin(), 1) == 11);
36 assert(*next(c1.begin(), 2) == 12);
39 assert(distance(c2.begin(), c2.end()) == 6);
40 assert(*next(c2.begin(), 0) == 0);
41 assert(*next(c2.begin(), 1) == 1);
42 assert(*next(c2.begin(),
[all...] |
| /external/libcxx/test/containers/associative/map/map.cons/ |
| H A D | assign_initializer_list.pass.cpp | 43 assert(distance(m.begin(), m.end()) == 3);
44 assert(*m.begin() == V(1, 1));
45 assert(*next(m.begin()) == V(2, 1));
46 assert(*next(m.begin(), 2) == V(3, 1));
68 assert(distance(m.begin(), m.end()) == 3);
69 assert(*m.begin() == V(1, 1));
70 assert(*next(m.begin()) == V(2, 1));
71 assert(*next(m.begin(), 2) == V(3, 1));
|
| H A D | initializer_list.pass.cpp | 39 assert(distance(m.begin(), m.end()) == 3);
40 assert(*m.begin() == V(1, 1));
41 assert(*next(m.begin()) == V(2, 1));
42 assert(*next(m.begin(), 2) == V(3, 1));
60 assert(distance(m.begin(), m.end()) == 3);
61 assert(*m.begin() == V(1, 1));
62 assert(*next(m.begin()) == V(2, 1));
63 assert(*next(m.begin(), 2) == V(3, 1));
|
| /external/libcxx/test/containers/associative/map/map.modifiers/ |
| H A D | insert_initializer_list.pass.cpp | 41 assert(distance(m.begin(), m.end()) == 3);
42 assert(*m.begin() == V(1, 1));
43 assert(*next(m.begin()) == V(2, 1));
44 assert(*next(m.begin(), 2) == V(3, 1));
64 assert(distance(m.begin(), m.end()) == 3);
65 assert(*m.begin() == V(1, 1));
66 assert(*next(m.begin()) == V(2, 1));
67 assert(*next(m.begin(), 2) == V(3, 1));
|
| /external/libcxx/test/containers/associative/set/ |
| H A D | erase_iter_iter.pass.cpp | 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);
50 assert(*next(m.begin(), 7) == 8);
54 assert(i == next(m.begin(),
[all...] |
| /external/libcxx/test/containers/associative/set/set.cons/ |
| H A D | iter_iter.pass.cpp | 42 assert(distance(m.begin(), m.end()) == 3);
43 assert(*m.begin() == 1);
44 assert(*next(m.begin()) == 2);
45 assert(*next(m.begin(), 2) == 3);
65 assert(distance(m.begin(), m.end()) == 3);
66 assert(*m.begin() == 1);
67 assert(*next(m.begin()) == 2);
68 assert(*next(m.begin(), 2) == 3);
|
| /external/libcxx/test/re/re.traits/ |
| H A D | isctype.pass.cpp | 25 assert( t.isctype('_', t.lookup_classname(s.begin(), s.end())));
26 assert( t.isctype('a', t.lookup_classname(s.begin(), s.end())));
27 assert( t.isctype('Z', t.lookup_classname(s.begin(), s.end())));
28 assert( t.isctype('5', t.lookup_classname(s.begin(), s.end())));
29 assert(!t.isctype(' ', t.lookup_classname(s.begin(), s.end())));
30 assert(!t.isctype('-', t.lookup_classname(s.begin(), s.end())));
31 assert(!t.isctype('@', t.lookup_classname(s.begin(), s.end())));
34 assert(!t.isctype('_', t.lookup_classname(s.begin(), s.end())));
35 assert( t.isctype('a', t.lookup_classname(s.begin(), s.end())));
36 assert( t.isctype('Z', t.lookup_classname(s.begin(),
[all...] |
| /external/valgrind/main/none/tests/ |
| H A D | pth_mutexspeed.stdout.exp | 0 begin 100000 lock--unlocks
|
| /external/chromium_org/third_party/icu/source/common/ |
| H A D | chariter.cpp | 22 : textLength(0), pos(0), begin(0), end(0) {
26 : textLength(length), pos(0), begin(0), end(length) {
33 : textLength(length), pos(position), begin(0), end(length) {
45 : textLength(length), pos(position), begin(textBegin), end(textEnd) {
49 if(begin < 0) {
50 begin = 0;
51 } else if(begin > textLength) {
52 begin = textLength;
54 if(end < begin) {
55 end = begin;
[all...] |
| /external/icu/icu4c/source/common/ |
| H A D | chariter.cpp | 22 : textLength(0), pos(0), begin(0), end(0) {
26 : textLength(length), pos(0), begin(0), end(length) {
33 : textLength(length), pos(position), begin(0), end(length) {
45 : textLength(length), pos(position), begin(textBegin), end(textEnd) {
49 if(begin < 0) {
50 begin = 0;
51 } else if(begin > textLength) {
52 begin = textLength;
54 if(end < begin) {
55 end = begin;
[all...] |
| /external/libcxx/test/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter.pass.cpp | 24 std::list<int>::const_iterator i = l1.begin();
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
35 assert(distance(l1.begin(), l1.end()) == 1);
36 assert(*l1.begin() == 1);
37 j = l1.erase(l1.begin());
40 assert(distance(l1.begin(), l1.end()) == 0);
46 std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l
[all...] |
| /external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| H A D | erase_iter.pass.cpp | 24 std::vector<int>::const_iterator i = l1.begin();
28 assert(distance(l1.begin(), l1.end()) == 2);
30 assert(*l1.begin() == 1);
31 assert(*next(l1.begin()) == 3);
35 assert(distance(l1.begin(), l1.end()) == 1);
36 assert(*l1.begin() == 1);
37 j = l1.erase(l1.begin());
40 assert(distance(l1.begin(), l1.end()) == 0);
46 std::vector<int, min_allocator<int>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l
[all...] |
| /external/libcxx/test/containers/sequences/vector.bool/ |
| H A D | erase_iter.pass.cpp | 25 std::vector<bool>::const_iterator i = l1.begin();
29 assert(distance(l1.begin(), l1.end()) == 2);
31 assert(*l1.begin() == 1);
32 assert(*next(l1.begin()) == true);
36 assert(distance(l1.begin(), l1.end()) == 1);
37 assert(*l1.begin() == true);
38 j = l1.erase(l1.begin());
41 assert(distance(l1.begin(), l1.end()) == 0);
46 std::vector<bool, min_allocator<bool>>::const_iterator i = l1.begin();
50 assert(distance(l1.begin(), l
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
| H A D | list.h | 10 * @begin: first element in the range to delete from the list.
15 static inline void list_del_range(struct list_head *begin, argument
18 begin->prev->next = end->next;
19 end->next->prev = begin->prev;
|
| /external/libcxx/test/containers/sequences/list/list.ops/ |
| H A D | splice_pos_list_iter.pass.cpp | 30 l1.splice(l1.end(), l2, l2.begin());
32 assert(distance(l1.begin(), l1.end()) == 1);
34 assert(distance(l2.begin(), l2.end()) == 0);
35 std::list<int>::const_iterator i = l1.begin();
41 l1.splice(l1.end(), l2, l2.begin());
43 assert(distance(l1.begin(), l1.end()) == 1);
45 assert(distance(l2.begin(), l2.end()) == 1);
46 std::list<int>::const_iterator i = l1.begin();
48 i = l2.begin();
54 l1.splice(l1.end(), l2, next(l2.begin()));
[all...] |
| H A D | splice_pos_list_iter_iter.pass.cpp | 29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
31 assert(distance(l1.begin(), l1.end()) == 3);
32 std::list<int>::const_iterator i = l1.begin();
41 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
43 assert(distance(l1.begin(), l1.end()) == 3);
44 std::list<int>::const_iterator i = l1.begin();
[all...] |