/external/libcxx/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...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_n.pass.cpp | 34 template <class Iter> 40 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); 41 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); 42 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(i [all...] |
H A D | search_n_pred.pass.cpp | 47 template <class Iter> 54 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); 57 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); 60 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(i [all...] |
/external/clang/test/SemaTemplate/ |
H A D | instantiate-overloaded-arrow.cpp | 9 struct Iter { struct 15 (void)Iter()->x;
|
/external/libcxx/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); 31 template <class Iter> 38 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); 39 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); 32 template <class Iter> 39 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 40 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); 31 template <class Iter> 38 assert(std::is_sorted(Iter(a), Iter(a))); 39 assert(std::is_sorted(Iter(a), Iter(a+sa))); 45 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); 32 template <class Iter> 39 assert(std::is_sorted(Iter(a), Iter(a))); 40 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 46 assert(std::is_sorted(Iter( [all...] |
/external/libcxx/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...] |
H A D | reduce.pass.cpp | 22 template <class Iter, class T> 24 test(Iter first, Iter last, T x) 31 template <class Iter> 37 test(Iter(ia), Iter(ia), 0); 38 test(Iter(ia), Iter(ia+1), 1); 39 test(Iter(ia), Iter(i [all...] |
/external/libcxx/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...] |
/external/libcxx/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...] |
H A D | max_element.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // Iter 15 // max_element(Iter first, Iter last); 25 template <class Iter> 27 test(Iter first, Iter last) 29 Iter i = std::max_element(first, last); 32 for (Iter [all...] |
H A D | min_element.pass.cpp | 12 // template<ForwardIterator Iter> 13 // requires LessThanComparable<Iter::value_type> 14 // Iter 15 // min_element(Iter first, Iter last); 25 template <class Iter> 27 test(Iter first, Iter last) 29 Iter i = std::min_element(first, last); 32 for (Iter [all...] |
H A D | max_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 14 // Iter 15 // max_element(Iter first, Iter last, Compare comp); 27 template <class Iter> 29 test(Iter first, Iter last) 31 Iter i = std::max_element(first, last, std::greater<int>()); 34 for (Iter [all...] |
H A D | min_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 14 // Iter 15 // min_element(Iter first, Iter last, Compare comp); 27 template <class Iter> 29 test(Iter first, Iter last) 31 Iter i = std::min_element(first, last, std::greater<int>()); 34 for (Iter [all...] |
H A D | minmax_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 14 // pair<Iter, Iter> 15 // minmax_element(Iter first, Iter last, Compare comp); 27 template <class Iter> 29 test(Iter first, Iter last) 33 std::pair<Iter, Ite [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
H A D | inplace_merge.pass.cpp | 12 // template<BidirectionalIterator Iter> 13 // requires ShuffleIterator<Iter> 14 // && LessThanComparable<Iter::value_type> 16 // inplace_merge(Iter first, Iter middle, Iter last); 48 template <class Iter> 52 typedef typename std::iterator_traits<Iter>::value_type value_type; 60 std::inplace_merge(Iter(ia), Iter(i [all...] |
/external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
H A D | transform_reduce_iter_iter_init_bop_uop.pass.cpp | 52 template <class Iter> 59 test(Iter(ia), Iter(ia), 0, std::plus<>(), identity(), 0); 60 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), identity(), 1); 61 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), identity(), 0); 62 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), identity(), 3); 63 test(Iter(i [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
H A D | generate_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, Callable Generator> 13 // requires OutputIterator<Iter, Generator::result_type> 16 // generate_n(Iter first, Size n, Generator gen); 50 template <class Iter, class Size> 56 assert(std::generate_n(Iter(ia), Size(n), gen_test()) == Iter(ia+n)); 63 template <class Iter> 67 test2<Iter, int>(); 68 test2<Iter, unsigned int>(); 69 test2<Iter, lon [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
H A D | reverse.pass.cpp | 12 // template<BidirectionalIterator Iter> 13 // requires HasSwap<Iter::reference, Iter::reference> 15 // reverse(Iter first, Iter last); 22 template <class Iter> 28 std::reverse(Iter(ia), Iter(ia)); 30 std::reverse(Iter(ia), Iter(i [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
H A D | rotate.pass.cpp | 12 // template<ShuffleIterator Iter> 13 // Iter 14 // rotate(Iter first, Iter middle, Iter last); 23 template <class Iter> 29 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(i [all...] |