Searched refs:Iter (Results 1 - 25 of 337) sorted by relevance

1234567891011>>

/external/libcxx/test/numerics/numeric.ops/accumulate/
H A Daccumulate.pass.cpp12 // 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 Daccumulate_op.pass.cpp12 // 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/clang/test/SemaTemplate/
H A Dinstantiate-overloaded-arrow.cpp9 struct Iter { struct
15 (void)Iter()->x;
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp22 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(i
[all...]
H A Dsearch_n_pred.pass.cpp32 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(i
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.merge/
H A Dinplace_merge.pass.cpp12 // 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(i
[all...]
H A Dinplace_merge_comp.pass.cpp12 // 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(i
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.min.max/
H A Dmax_element.pass.cpp12 // 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
[all...]
H A Dmax_element_comp.pass.cpp12 // 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
[all...]
H A Dmin_element.pass.cpp12 // 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
[all...]
H A Dmin_element_comp.pass.cpp12 // 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
[all...]
H A Dminmax_element.pass.cpp12 // 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, Ite
[all...]
H A Dminmax_element_comp.pass.cpp12 // 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, Ite
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/
H A Dis_sorted_until.pass.cpp12 // 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 Dis_sorted_until_comp.pass.cpp12 // 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 Dis_sorted.pass.cpp12 // 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 Dis_sorted_comp.pass.cpp12 // 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...]
/external/libcxx/test/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dpartial_sort_copy.pass.cpp25 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>(
[all...]
H A Dpartial_sort_copy_comp.pass.cpp28 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>(
[all...]
/external/chromium_org/third_party/skia/src/gpu/
H A DGrOrderedSet.h22 class Iter;
44 Iter insert(const T& t);
51 void remove(const Iter& iter);
56 Iter begin();
63 Iter end();
69 Iter last();
76 Iter find(const T& t);
85 class GrOrderedSet<T,C>::Iter { class in class:GrOrderedSet
87 Iter() {} function in class:GrOrderedSet::Iter
88 Iter(cons function in class:GrOrderedSet::Iter
112 explicit Iter(typename GrRedBlackTree<T, C>::Iter iter) { function in class:GrOrderedSet::Iter
[all...]
/external/skia/src/gpu/
H A DGrOrderedSet.h22 class Iter;
44 Iter insert(const T& t);
51 void remove(const Iter& iter);
56 Iter begin();
63 Iter end();
69 Iter last();
76 Iter find(const T& t);
85 class GrOrderedSet<T,C>::Iter { class in class:GrOrderedSet
87 Iter() {} function in class:GrOrderedSet::Iter
88 Iter(cons function in class:GrOrderedSet::Iter
112 explicit Iter(typename GrRedBlackTree<T, C>::Iter iter) { function in class:GrOrderedSet::Iter
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.generate/
H A Dgenerate.pass.cpp12 // 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());
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/
H A Dequal_range.pass.cpp12 // 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 las
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse.pass.cpp12 // 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/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp12 // 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(i
[all...]

Completed in 301 milliseconds

1234567891011>>