| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/algorithms/alg.random.sample/ |
| sample.fail.cpp | 27 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; local
28 const unsigned is = sizeof(ia) / sizeof(ia[0]);
32 std::experimental::sample(PopulationIterator(ia), PopulationIterator(ia + is),
|
| /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...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/partial.sum/ |
| partial_sum.pass.cpp | 29 int ia[] = {1, 2, 3, 4, 5}; local
31 const unsigned s = sizeof(ia) / sizeof(ia[0]);
33 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib));
|
| partial_sum_op.pass.cpp | 31 int ia[] = {1, 2, 3, 4, 5}; local
33 const unsigned s = sizeof(ia) / sizeof(ia[0]);
35 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib), std::minus<int>());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/reduce/ |
| reduce.pass.cpp | 35 int ia[] = {1, 2, 3, 4, 5, 6}; local
36 unsigned sa = sizeof(ia) / sizeof(ia[0]);
37 test(Iter(ia), Iter(ia), 0);
38 test(Iter(ia), Iter(ia+1), 1);
39 test(Iter(ia), Iter(ia+2), 3);
40 test(Iter(ia), Iter(ia+sa), 21)
[all...] |
| reduce_init.pass.cpp | 33 int ia[] = {1, 2, 3, 4, 5, 6}; local
34 unsigned sa = sizeof(ia) / sizeof(ia[0]);
35 test(Iter(ia), Iter(ia), 0, 0);
36 test(Iter(ia), Iter(ia), 1, 1);
37 test(Iter(ia), Iter(ia+1), 0, 1);
38 test(Iter(ia), Iter(ia+1), 2, 3)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/transform.reduce/ |
| transform_reduce_iter_iter_iter_init.pass.cpp | 36 int ia[] = {1, 2, 3, 4, 5, 6}; local
38 unsigned sa = sizeof(ia) / sizeof(ia[0]);
41 test(SIter(ia), SIter(ia), UIter(ua), 0, 0);
42 test(UIter(ua), UIter(ua), SIter(ia), 1, 1);
43 test(SIter(ia), SIter(ia+1), UIter(ua), 0, 2);
44 test(UIter(ua), UIter(ua+1), SIter(ia), 2, 4);
45 test(SIter(ia), SIter(ia+2), UIter(ua), 0, 10)
[all...] |
| transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 38 int ia[] = {1, 2, 3, 4, 5, 6}; local
40 unsigned sa = sizeof(ia) / sizeof(ia[0]);
43 test(SIter(ia), SIter(ia), UIter(ua), 0, std::plus<>(), std::multiplies<>(), 0);
44 test(UIter(ua), UIter(ua), SIter(ia), 1, std::multiplies<>(), std::plus<>(), 1);
45 test(SIter(ia), SIter(ia+1), UIter(ua), 0, std::multiplies<>(), std::plus<>(), 0);
46 test(UIter(ua), UIter(ua+1), SIter(ia), 2, std::plus<>(), std::multiplies<>(), 4);
47 test(SIter(ia), SIter(ia+2), UIter(ua), 0, std::plus<>(), std::multiplies<>(), 10)
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| copy_if.pass.cpp | 26 // int ia[] = {2, 4, 6, 8, 6};
29 // auto p = std::copy_if(std::begin(ia), std::end(ia), std::begin(ic), is6);
46 int ia[N]; local
48 ia[i] = i;
51 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.random.sample/ |
| sample.stable.pass.cpp | 31 int ia[kPopulationSize]; local
33 ia[i] = i;
34 PopulationIterator first(ia);
35 PopulationIterator last(ia + kPopulationSize);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| replace_copy.pass.cpp | 29 int ia[] = {0, 1, 2, 3, 4}; local
33 auto it = std::replace_copy(std::begin(ia), std::end(ia), std::begin(ib), 2, 5);
35 return it == (std::begin(ib) + std::size(ia))
46 int ia[] = {0, 1, 2, 3, 4}; local
47 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
49 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
|
| replace_copy_if.pass.cpp | 32 int ia[] = {0, 1, 2, 3, 4}; local
36 auto it = std::replace_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo, 5);
38 return it == (std::begin(ib) + std::size(ia))
49 int ia[] = {0, 1, 2, 3, 4}; local
50 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
52 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa),
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 26 int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 std::reverse(Iter(ia), Iter(ia));
29 assert(ia[0] == 0);
30 std::reverse(Iter(ia), Iter(ia+sa));
31 assert(ia[0] == 0);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| binary_transform.pass.cpp | 27 const int ia[] = {1, 3, 6, 7}; local
32 auto it = std::transform(std::begin(ia), std::end(ia),
35 return it == (std::begin(ic) + std::size(ia))
47 int ia[] = {0, 1, 2, 3, 4}; local
48 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
50 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
|
| unary_transform.pass.cpp | 30 int ia[] = {1, 3, 6, 7}; local
34 auto it = std::transform(std::begin(ia), std::end(ia), std::begin(ib), plusOne);
36 return it == (std::begin(ib) + std::size(ia))
48 int ia[] = {0, 1, 2, 3, 4}; local
49 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
51 OutIter r = std::transform(InIter(ia), InIter(ia+sa),
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.count/ |
| count_if.pass.cpp | 32 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
34 return (std::count_if(std::begin(ia), std::end(ia), eq(2)) == 3)
42 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; local
43 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
44 assert(std::count_if(input_iterator<const int*>(ia),
45 input_iterator<const int*>(ia + sa),
47 assert(std::count_if(input_iterator<const int*>(ia),
48 input_iterator<const int*>(ia + sa)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 30 int ia[] = {1, 3, 6, 7}; local
36 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic))
37 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic))
50 int ia[] = {0, 1, 2, 3, 4, 5}; local
51 const unsigned s = sizeof(ia)/sizeof(ia[0]);
53 assert(std::equal(input_iterator<const int*>(ia),
54 input_iterator<const int*>(ia+s)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find/ |
| find_if.pass.cpp | 32 int ia[] = {1, 3, 5, 2, 4, 6}; local
35 return (std::find_if(std::begin(ia), std::end(ia), c) == ia+4)
43 int ia[] = {0, 1, 2, 3, 4, 5}; local
44 const unsigned s = sizeof(ia)/sizeof(ia[0]);
45 input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia),
46 input_iterator<const int*>(ia+s),
49 r = std::find_if(input_iterator<const int*>(ia),
[all...] |
| find_if_not.pass.cpp | 32 int ia[] = {1, 3, 5, 2, 4, 6}; local
35 return (std::find_if_not(std::begin(ia), std::end(ia), c) == ia+4)
43 int ia[] = {0, 1, 2, 3, 4, 5}; local
44 const unsigned s = sizeof(ia)/sizeof(ia[0]);
45 input_iterator<const int*> r = std::find_if_not(input_iterator<const int*>(ia),
46 input_iterator<const int*>(ia+s),
49 r = std::find_if_not(input_iterator<const int*>(ia),
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 25 int ia[] = {1, 2, 3}; local
32 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+1))
34 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+1))
36 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == RI(ic+1))
44 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
45 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| find_first_of_pred.pass.cpp | 27 int ia[] = {1, 2, 3}; local
34 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)), eq) == FI(ic+1))
36 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) == BI(ic+1))
38 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) == RI(ic+1))
46 int ia[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
47 const unsigned sa = sizeof(ia)/sizeof(ia[0])
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
| test.pass.cpp | 25 int ia[] = {1, 3, 6, 7}; local
28 std::for_each(std::begin(ia), std::end(ia), [](int &a) { a += 2; });
29 return std::equal(std::begin(ia), std::end(ia), std::begin(expected))
43 int ia[] = {0, 1, 2, 3, 4, 5}; local
44 const unsigned s = sizeof(ia)/sizeof(ia[0]);
45 for_each_test f = std::for_each(input_iterator<int*>(ia),
46 input_iterator<int*>(ia+s)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 26 int ia[] = {0, 0, 1, 1, 2, 2}; local
27 return (std::search_n(std::begin(ia), std::end(ia), 1, 0) == ia)
28 && (std::search_n(std::begin(ia), std::end(ia), 2, 1) == ia+2)
29 && (std::search_n(std::begin(ia), std::end(ia), 1, 3) == std::end(ia))
38 int ia[] = {0, 1, 2, 3, 4, 5}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range_comp.pass.cpp | 29 int ia[] = {1, 3, 3, 6, 7}; local
31 return (std::equal_range(std::begin(ia), std::end(ia), 1, lt) == std::pair<int *, int *>(ia+0, ia+1))
32 && (std::equal_range(std::begin(ia), std::end(ia), 3, lt) == std::pair<int *, int *>(ia+1, ia+3))
33 && (std::equal_range(std::begin(ia), std::end(ia), 9, lt) == std::pair<int *, int *>(std::end(ia), std::end(ia))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound_comp.pass.cpp | 29 int ia[] = {1, 3, 6, 7}; local
31 return (std::lower_bound(std::begin(ia), std::end(ia), 2, lt) == ia+1)
32 && (std::lower_bound(std::begin(ia), std::end(ia), 3, lt) == ia+1)
33 && (std::lower_bound(std::begin(ia), std::end(ia), 9, lt) == std::end(ia))
[all...] |
