| /external/libcxx/test/std/numerics/numeric.ops/accumulate/ |
| 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(ia), Iter(ia), 0, 0)
[all...] |
| 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(ia), 1, 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numeric.ops/accumulate/ |
| 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(ia), Iter(ia), 0, 0)
[all...] |
| 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(ia), 1, 1)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| 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(ia+sa))
[all...] |
| 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(ia+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 22 template <class Iter>
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa))
[all...] |
| search_n_pred.pass.cpp | 32 template <class Iter>
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| 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);
23 template <class Iter>
34 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // max_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::max_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| min_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // min_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::min_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| 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);
22 template <class Iter>
24 test(Iter first, Iter last)
26 std::pair<Iter, Iter> p = std::minmax_element(first, last)
[all...] |
| 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);
23 template <class Iter>
25 test(Iter first, Iter last)
27 Iter i = std::max_element(first, last, std::greater<int>());
30 for (Iter j = first; j != last; ++j
[all...] |
| 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);
23 template <class Iter>
25 test(Iter first, Iter last)
27 Iter i = std::min_element(first, last, std::greater<int>());
30 for (Iter j = first; j != last; ++j
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| 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(a), Iter(a+sa)) == Iter(a+sa))
[all...] |
| 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(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| 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(a), Iter(a+sa)) == Iter(a+sa))
[all...] |
| 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(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| partial_sort_copy.pass.cpp | 25 template <class Iter>
34 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M);
44 template <class Iter>
48 test_larger_sorts<Iter>(N, 0);
49 test_larger_sorts<Iter>(N, 1);
50 test_larger_sorts<Iter>(N, 2);
51 test_larger_sorts<Iter>(N, 3);
52 test_larger_sorts<Iter>(N, N/2-1);
53 test_larger_sorts<Iter>(N, N/2)
[all...] |
| partial_sort_copy_comp.pass.cpp | 28 template <class Iter>
37 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M,
48 template <class Iter>
52 test_larger_sorts<Iter>(N, 0);
53 test_larger_sorts<Iter>(N, 1);
54 test_larger_sorts<Iter>(N, 2);
55 test_larger_sorts<Iter>(N, 3);
56 test_larger_sorts<Iter>(N, N/2-1);
57 test_larger_sorts<Iter>(N, N/2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| partial_sort_copy.pass.cpp | 25 template <class Iter>
34 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M);
44 template <class Iter>
48 test_larger_sorts<Iter>(N, 0);
49 test_larger_sorts<Iter>(N, 1);
50 test_larger_sorts<Iter>(N, 2);
51 test_larger_sorts<Iter>(N, 3);
52 test_larger_sorts<Iter>(N, N/2-1);
53 test_larger_sorts<Iter>(N, N/2)
[all...] |
| partial_sort_copy_comp.pass.cpp | 28 template <class Iter>
37 int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M,
48 template <class Iter>
52 test_larger_sorts<Iter>(N, 0);
53 test_larger_sorts<Iter>(N, 1);
54 test_larger_sorts<Iter>(N, 2);
55 test_larger_sorts<Iter>(N, 3);
56 test_larger_sorts<Iter>(N, N/2-1);
57 test_larger_sorts<Iter>(N, N/2)
[all...] |
| /external/clang/test/SemaTemplate/ |
| instantiate-overloaded-arrow.cpp | 9 struct Iter {
15 (void)Iter()->x;
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| 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);
22 template <class Iter>
24 test(Iter first, Iter last)
26 std::pair<Iter, Iter> p = std::minmax_element(first, last)
[all...] |
| 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);
23 template <class Iter>
25 test(Iter first, Iter last)
29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp)
[all...] |
