| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| inplace_merge_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // inplace_merge(Iter first, Iter middle, Iter last, Compare comp);
35 template <class Iter>
46 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::greater<int>())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| 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.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...] |
| 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...] |
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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...] |
| 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(a), Iter(a+sa)))
[all...] |
| 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(a), Iter(a+sa), std::greater<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/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;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 12 // template<ForwardIterator Iter, Callable Generator>
13 // requires OutputIterator<Iter, Generator::result_type>
16 // generate(Iter first, Iter last, Generator gen);
28 template <class Iter>
34 std::generate(Iter(ia), Iter(ia+n), gen_test());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.reverse/ |
| 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(ia+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 12 // template<ShuffleIterator Iter>
13 // Iter
14 // rotate(Iter first, Iter middle, Iter last);
24 template <class Iter>
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
16 // binary_search(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value, bool x)
31 template <class Iter>
47 test(Iter(v.data()), Iter(v.data()+v.size()), x, true)
[all...] |
| binary_search_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T, CopyConstructible Compare>
13 // requires Predicate<Compare, T, Iter::value_type>
14 // && Predicate<Compare, Iter::value_type, T>
16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
25 template <class Iter, class T>
27 test(Iter first, Iter last, const T& value, bool x)
32 template <class Iter>
48 test(Iter(v.data()), Iter(v.data()+v.size()), x, true)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill(Iter first, Iter last, const T& value);
22 template <class Iter>
28 std::fill(Iter(ca), Iter(ca+n), char(1));
35 template <class Iter>
41 std::fill(Iter(ia), Iter(ia+n), 1)
[all...] |
| fill_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill_n(Iter first, Size n, const T& value);
22 template <class Iter>
28 assert(std::fill_n(Iter(ca), n, char(1)) == std::next(Iter(ca), n));
35 template <class Iter>
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
|
