| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| partition_point.pass.cpp | 30 int ia[] = {1, 3, 5, 2, 4, 6}; local
32 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3)
42 const int ia[] = {2, 4, 6, 8, 10}; local
43 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
44 forward_iterator<const int*>(std::end(ia)),
45 is_odd()) == forward_iterator<const int*>(ia));
48 const int ia[] = {1, 2, 4, 6, 8}; local
49 assert(std::partition_point(forward_iterator<const int*>(std::begin(ia)),
54 const int ia[] = {1, 3, 2, 4, 6}; local
60 const int ia[] = {1, 3, 5, 2, 4, 6}; local
66 const int ia[] = {1, 3, 5, 7, 2, 4}; local
72 const int ia[] = {1, 3, 5, 7, 9, 2}; local
78 const int ia[] = {1, 3, 5, 7, 9, 11}; local
84 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle_rand.pass.cpp | 35 int ia[] = {1, 2, 3, 4}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 std::random_shuffle(ia, ia+sa, r);
40 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
41 assert(std::is_permutation(ia, ia+sa, ia1));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 26 int* ia = new int [N]; local
28 ia[i] = i;
29 std::shuffle(ia, ia+N, randomness);
32 std::push_heap(ia, ia+i);
33 assert(std::is_heap(ia, ia+i));
35 delete [] ia;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle_rand.pass.cpp | 35 int ia[] = {1, 2, 3, 4}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 std::random_shuffle(ia, ia+sa, r);
40 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
41 assert(std::is_permutation(ia, ia+sa, ia1));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 26 int* ia = new int [N]; local
28 ia[i] = i;
29 std::shuffle(ia, ia+N, randomness);
32 std::push_heap(ia, ia+i);
33 assert(std::is_heap(ia, ia+i));
35 delete [] ia;
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ |
| count.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
27 return (std::count(std::begin(ia), std::end(ia), 2) == 3)
35 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
36 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
37 assert(std::count(input_iterator<const int*>(ia),
38 input_iterator<const int*>(ia + sa), 2) == 3);
39 assert(std::count(input_iterator<const int*>(ia),
40 input_iterator<const int*>(ia + sa), 7) == 0)
[all...] |
| /external/libcxx/test/std/iterators/stream.iterators/iterator.range/ |
| begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
23 assert(ia[0] == 2);
|
| end_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
21 int* e = std::end(ia);
22 assert(e == ia + 3);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| adjacent_find_pred.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
27 assert(std::adjacent_find(forward_iterator<const int*>(ia),
28 forward_iterator<const int*>(ia + sa),
30 forward_iterator<const int*>(ia+2));
31 assert(std::adjacent_find(forward_iterator<const int*>(ia),
32 forward_iterator<const int*>(ia),
34 forward_iterator<const int*>(ia));
35 assert(std::adjacent_find(forward_iterator<const int*>(ia+3)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/stream.iterators/iterator.range/ |
| begin_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
23 assert(ia[0] == 2);
|
| end_array.pass.cpp | 19 int ia[] = {1, 2, 3}; local
20 int* i = std::begin(ia);
21 int* e = std::end(ia);
22 assert(e == ia + 3);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.all_of/ |
| all_of.pass.cpp | 32 int ia[] = {2, 4, 6, 8}; local
34 return std::all_of(std::begin(ia), std::end(ia), test1())
43 int ia[] = {2, 4, 6, 8}; local
44 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
45 assert(std::all_of(input_iterator<const int*>(ia),
46 input_iterator<const int*>(ia + sa), test1()) == true);
47 assert(std::all_of(input_iterator<const int*>(ia),
48 input_iterator<const int*>(ia), test1()) == true)
51 const int ia[] = {2, 4, 5, 8}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 27 int ia[] = {1, 3, 5, 2, 5, 6}; local
29 auto it = std::remove(std::begin(ia), std::end(ia), 5);
31 return (std::begin(ia) + std::size(ia) - 2) == it // we removed two elements
32 && std::none_of(std::begin(ia), it, [](int a) {return a == 5; })
41 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2};
42 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
43 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2)
[all...] |
| /external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| compare.pass.cpp | 24 const char ia[] = "1234"; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1)
37 const wchar_t ia[] = L"1234"; local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| compare.pass.cpp | 24 const char ia[] = "1234"; local
25 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1)
37 const wchar_t ia[] = L"1234"; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| adjacent_find.pass.cpp | 25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
28 return (std::adjacent_find(std::begin(ia), std::end(ia)) == ia+2)
36 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38 assert(std::adjacent_find(forward_iterator<const int*>(ia),
39 forward_iterator<const int*>(ia + sa)) ==
40 forward_iterator<const int*>(ia+2))
[all...] |
| adjacent_find_pred.pass.cpp | 29 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
32 return (std::adjacent_find(std::begin(ia), std::end(ia), eq) == ia+2)
40 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
41 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
42 assert(std::adjacent_find(forward_iterator<const int*>(ia),
43 forward_iterator<const int*>(ia + sa),
45 forward_iterator<const int*>(ia+2))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap.pass.cpp | 25 int* ia = new int [N]; local
27 ia[i] = i;
28 std::shuffle(ia, ia+N, randomness);
29 std::make_heap(ia, ia+N);
30 std::sort_heap(ia, ia+N);
31 assert(std::is_sorted(ia, ia+N))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap.pass.cpp | 25 int* ia = new int [N]; local
27 ia[i] = i;
28 std::shuffle(ia, ia+N, randomness);
29 std::make_heap(ia, ia+N);
30 std::sort_heap(ia, ia+N);
31 assert(std::is_sorted(ia, ia+N))
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 51 int ia[] = {0, 1, 2, 3, 4, 5}; local
52 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia))
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia))
[all...] |
| make_default_searcher.pred.pass.cpp | 48 int ia[] = {0, 1, 2, 3, 4, 5}; local
49 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| default.pass.cpp | 51 int ia[] = {0, 1, 2, 3, 4, 5}; local
52 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia));
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia))
[all...] |
| default.pred.pass.cpp | 63 int ia[] = {0, 1, 2, 3, 4, 5}; local
64 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0);
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia))
[all...] |
