/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/accumulate/ |
H A D | accumulate.pass.cpp | 12 // template <InputIterator Iter, MoveConstructible T> 13 // requires HasPlus<T, Iter::reference> 14 // && HasAssign<T, HasPlus<T, Iter::reference>::result_type> 16 // accumulate(Iter first, Iter last, T init); 23 template <class Iter, class T> 25 test(Iter first, Iter last, T init, T x) 30 template <class Iter> 36 test(Iter(i [all...] |
H A D | accumulate_op.pass.cpp | 12 // template <InputIterator Iter, MoveConstructible T, 13 // Callable<auto, const T&, Iter::reference> BinaryOperation> 17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op); 25 template <class Iter, class T> 27 test(Iter first, Iter last, T init, T x) 32 template <class Iter> 38 test(Iter(ia), Iter(i [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/accumulate/ |
H A D | accumulate.pass.cpp | 12 // template <InputIterator Iter, MoveConstructible T> 13 // requires HasPlus<T, Iter::reference> 14 // && HasAssign<T, HasPlus<T, Iter::reference>::result_type> 16 // accumulate(Iter first, Iter last, T init); 23 template <class Iter, class T> 25 test(Iter first, Iter last, T init, T x) 30 template <class Iter> 36 test(Iter(i [all...] |
H A D | accumulate_op.pass.cpp | 12 // template <InputIterator Iter, MoveConstructible T, 13 // Callable<auto, const T&, Iter::reference> BinaryOperation> 17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op); 25 template <class Iter, class T> 27 test(Iter first, Iter last, T init, T x) 32 template <class Iter> 38 test(Iter(ia), Iter(i [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_n.pass.cpp | 23 template <class Iter> 29 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); 30 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); 31 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(i [all...] |
H A D | search_n_pred.pass.cpp | 34 template <class Iter> 41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); 44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); 47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(i [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_n.pass.cpp | 23 template <class Iter> 29 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); 30 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); 31 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(i [all...] |
H A D | search_n_pred.pass.cpp | 34 template <class Iter> 41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); 44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); 47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(i [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
H A D | is_sorted_until.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // Iter 15 // is_sorted_until(Iter first, Iter last); 22 template <class Iter> 29 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); 30 assert(std::is_sorted_until(Iter( [all...] |
H A D | is_sorted_until_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 14 // Iter 15 // is_sorted_until(Iter first, Iter last, Compare comp); 23 template <class Iter> 30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 31 assert(std::is_sorted_until(Iter( [all...] |
H A D | is_sorted.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 15 // is_sorted(Iter first, Iter last); 22 template <class Iter> 29 assert(std::is_sorted(Iter(a), Iter(a))); 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 36 assert(std::is_sorted(Iter( [all...] |
H A D | is_sorted_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 15 // is_sorted(Iter first, Iter last, Compare comp); 23 template <class Iter> 30 assert(std::is_sorted(Iter(a), Iter(a))); 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 37 assert(std::is_sorted(Iter( [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
H A D | is_sorted_until.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // Iter 15 // is_sorted_until(Iter first, Iter last); 22 template <class Iter> 29 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); 30 assert(std::is_sorted_until(Iter( [all...] |
H A D | is_sorted_until_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 14 // Iter 15 // is_sorted_until(Iter first, Iter last, Compare comp); 23 template <class Iter> 30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 31 assert(std::is_sorted_until(Iter( [all...] |
H A D | is_sorted.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 15 // is_sorted(Iter first, Iter last); 22 template <class Iter> 29 assert(std::is_sorted(Iter(a), Iter(a))); 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 36 assert(std::is_sorted(Iter( [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/reduce/ |
H A D | reduce_init.pass.cpp | 21 template <class Iter, class T> 23 test(Iter first, Iter last, T init, T x) 29 template <class Iter> 35 test(Iter(ia), Iter(ia), 0, 0); 36 test(Iter(ia), Iter(ia), 1, 1); 37 test(Iter(ia), Iter(i [all...] |
H A D | reduce_init_op.pass.cpp | 21 template <class Iter, class T, class Op> 23 test(Iter first, Iter last, T init, Op op, T x) 29 template <class Iter> 35 test(Iter(ia), Iter(ia), 0, std::plus<>(), 0); 36 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), 1); 37 test(Iter(ia), Iter(i [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/reduce/ |
H A D | reduce_init.pass.cpp | 21 template <class Iter, class T> 23 test(Iter first, Iter last, T init, T x) 29 template <class Iter> 35 test(Iter(ia), Iter(ia), 0, 0); 36 test(Iter(ia), Iter(ia), 1, 1); 37 test(Iter(ia), Iter(i [all...] |
H A D | reduce_init_op.pass.cpp | 21 template <class Iter, class T, class Op> 23 test(Iter first, Iter last, T init, Op op, T x) 29 template <class Iter> 35 test(Iter(ia), Iter(ia), 0, std::plus<>(), 0); 36 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), 1); 37 test(Iter(ia), Iter(i [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
H A D | partial_sort_copy.pass.cpp | 28 template <class Iter> 37 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M); 47 template <class Iter> 51 test_larger_sorts<Iter>(N, 0); 52 test_larger_sorts<Iter>(N, 1); 53 test_larger_sorts<Iter>(N, 2); 54 test_larger_sorts<Iter>(N, 3); 55 test_larger_sorts<Iter>(N, N/2-1); 56 test_larger_sorts<Iter>( [all...] |
H A D | partial_sort_copy_comp.pass.cpp | 31 template <class Iter> 40 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M, 51 template <class Iter> 55 test_larger_sorts<Iter>(N, 0); 56 test_larger_sorts<Iter>(N, 1); 57 test_larger_sorts<Iter>(N, 2); 58 test_larger_sorts<Iter>(N, 3); 59 test_larger_sorts<Iter>(N, N/2-1); 60 test_larger_sorts<Iter>( [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
H A D | partial_sort_copy.pass.cpp | 28 template <class Iter> 37 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M); 47 template <class Iter> 51 test_larger_sorts<Iter>(N, 0); 52 test_larger_sorts<Iter>(N, 1); 53 test_larger_sorts<Iter>(N, 2); 54 test_larger_sorts<Iter>(N, 3); 55 test_larger_sorts<Iter>(N, N/2-1); 56 test_larger_sorts<Iter>( [all...] |
H A D | partial_sort_copy_comp.pass.cpp | 31 template <class Iter> 40 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M, 51 template <class Iter> 55 test_larger_sorts<Iter>(N, 0); 56 test_larger_sorts<Iter>(N, 1); 57 test_larger_sorts<Iter>(N, 2); 58 test_larger_sorts<Iter>(N, 3); 59 test_larger_sorts<Iter>(N, N/2-1); 60 test_larger_sorts<Iter>( [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | minmax_element.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // pair<Iter, Iter> 15 // minmax_element(Iter first, Iter last); 25 template <class Iter> 27 test(Iter first, Iter last) 29 std::pair<Iter, Ite [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | minmax_element.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // pair<Iter, Iter> 15 // minmax_element(Iter first, Iter last); 25 template <class Iter> 27 test(Iter first, Iter last) 29 std::pair<Iter, Ite [all...] |