| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 34 template <class Iter>
40 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); in test()
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); in test()
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); in test()
43 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); in test()
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); in test()
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); in test()
46 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); in test()
47 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); in test()
48 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); in test()
[all …]
|
| 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)); in test()
57 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
60 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
63 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
66 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
69 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3, count_equal()) == Iter(ia+3)); in test()
72 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3, count_equal()) == Iter(ia+sa)); in test()
75 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3, count_equal()) == Iter(ia+sa)); in test()
78 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5, count_equal()) == Iter(ia)); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 31 template <class Iter>
38 assert(std::is_sorted_until(Iter(a), Iter(a)) == Iter(a)); in test()
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
50 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
55 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
60 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
66 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
71 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
76 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+2)); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 32 template <class Iter>
39 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); in test()
40 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
56 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
61 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
67 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
72 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); in test()
77 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 31 template <class Iter>
38 assert(std::is_sorted(Iter(a), Iter(a))); in test()
39 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
45 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
50 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
55 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
60 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
66 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
71 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
76 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 32 template <class Iter>
39 assert(std::is_sorted(Iter(a), Iter(a))); in test()
40 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
46 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
51 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
56 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
61 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
67 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
72 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
77 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate.pass.cpp | 23 template <class Iter>
29 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia)); in test()
32 r = std::rotate(Iter(ia), Iter(ia), Iter(ia+sa)); in test()
35 r = std::rotate(Iter(ia), Iter(ia+sa), Iter(ia+sa)); in test()
41 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb)); in test()
45 r = std::rotate(Iter(ib), Iter(ib+1), Iter(ib+sb)); in test()
49 r = std::rotate(Iter(ib), Iter(ib+sb), Iter(ib+sb)); in test()
56 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
61 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
66 r = std::rotate(Iter(ic), Iter(ic+2), Iter(ic+sc)); in test()
[all …]
|
| /external/Reactive-Extensions/RxCpp/Ix/CPP/src/cpplinq/ |
| D | linq_iterators.hpp | 18 template <class Iter>
20 std::is_convertible<Iter, use_default_iterator_operators>::value,
21 Iter
23 operator+(const Iter& it, typename std::iterator_traits<Iter>::distance_type n) { in operator +()
26 template <class Iter>
28 std::is_convertible<Iter, use_default_iterator_operators>::value,
29 Iter
31 operator-(const Iter& it, typename std::iterator_traits<Iter>::distance_type n) { in operator -()
34 template <class Iter>
36 std::is_convertible<Iter, use_default_iterator_operators>::value,
[all …]
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceRegAlloc.cpp | 386 void LinearScan::addSpillFill(IterationState &Iter) { in addSpillFill() argument
401 assert(!Iter.Cur->getLiveRange().isEmpty()); in addSpillFill()
402 InstNumberT Start = Iter.Cur->getLiveRange().getStart(); in addSpillFill()
403 InstNumberT End = Iter.Cur->getLiveRange().getEnd(); in addSpillFill()
404 CfgNode *Node = Func->getVMetadata()->getLocalUseNode(Iter.Cur); in addSpillFill()
425 Iter.RegMask[RegAlias] = false; in addSpillFill()
434 const RegNumT RegNum = *RegNumBVIter(Iter.RegMask).begin(); in addSpillFill()
435 Iter.Cur->setRegNumTmp(RegNum); in addSpillFill()
436 Variable *Preg = Target->getPhysicalRegister(RegNum, Iter.Cur->getType()); in addSpillFill()
439 Variable *SpillLoc = Func->makeVariable(Iter.Cur->getType()); in addSpillFill()
[all …]
|
| /external/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| 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); in test()
60 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), identity(), 1); in test()
61 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), identity(), 0); in test()
62 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), identity(), 3); in test()
63 test(Iter(ia), Iter(ia+2), 0, std::plus<>(), identity(), 3); in test()
64 test(Iter(ia), Iter(ia+2), 3, std::multiplies<>(), identity(), 6); in test()
65 test(Iter(ia), Iter(ia+sa), 4, std::multiplies<>(), identity(), 2880); in test()
66 test(Iter(ia), Iter(ia+sa), 4, std::plus<>(), identity(), 25); in test()
68 test(Iter(ia), Iter(ia), 0, std::plus<>(), twice(), 0); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| 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, in test_larger_sorts()
51 template <class Iter>
55 test_larger_sorts<Iter>(N, 0); in test_larger_sorts()
56 test_larger_sorts<Iter>(N, 1); in test_larger_sorts()
57 test_larger_sorts<Iter>(N, 2); in test_larger_sorts()
58 test_larger_sorts<Iter>(N, 3); in test_larger_sorts()
59 test_larger_sorts<Iter>(N, N/2-1); in test_larger_sorts()
60 test_larger_sorts<Iter>(N, N/2); in test_larger_sorts()
61 test_larger_sorts<Iter>(N, N/2+1); in test_larger_sorts()
[all …]
|
| 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); in test_larger_sorts()
47 template <class Iter>
51 test_larger_sorts<Iter>(N, 0); in test_larger_sorts()
52 test_larger_sorts<Iter>(N, 1); in test_larger_sorts()
53 test_larger_sorts<Iter>(N, 2); in test_larger_sorts()
54 test_larger_sorts<Iter>(N, 3); in test_larger_sorts()
55 test_larger_sorts<Iter>(N, N/2-1); in test_larger_sorts()
56 test_larger_sorts<Iter>(N, N/2); in test_larger_sorts()
57 test_larger_sorts<Iter>(N, N/2+1); in test_larger_sorts()
[all …]
|
| /external/libcxx/test/std/numerics/numeric.ops/accumulate/ |
| D | accumulate.pass.cpp | 23 template <class Iter, class T>
25 test(Iter first, Iter last, T init, T x) in test()
30 template <class Iter>
36 test(Iter(ia), Iter(ia), 0, 0); in test()
37 test(Iter(ia), Iter(ia), 10, 10); in test()
38 test(Iter(ia), Iter(ia+1), 0, 1); in test()
39 test(Iter(ia), Iter(ia+1), 10, 11); in test()
40 test(Iter(ia), Iter(ia+2), 0, 3); in test()
41 test(Iter(ia), Iter(ia+2), 10, 13); in test()
42 test(Iter(ia), Iter(ia+sa), 0, 21); in test()
[all …]
|
| D | accumulate_op.pass.cpp | 25 template <class Iter, class T>
27 test(Iter first, Iter last, T init, T x) in test()
32 template <class Iter>
38 test(Iter(ia), Iter(ia), 1, 1); in test()
39 test(Iter(ia), Iter(ia), 10, 10); in test()
40 test(Iter(ia), Iter(ia+1), 1, 1); in test()
41 test(Iter(ia), Iter(ia+1), 10, 10); in test()
42 test(Iter(ia), Iter(ia+2), 1, 2); in test()
43 test(Iter(ia), Iter(ia+2), 10, 20); in test()
44 test(Iter(ia), Iter(ia+sa), 1, 720); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| D | inplace_merge.pass.cpp | 48 template <class Iter>
52 typedef typename std::iterator_traits<Iter>::value_type value_type; in test_one()
60 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N)); in test_one()
70 template <class Iter>
74 test_one<Iter>(N, 0); in test()
75 test_one<Iter>(N, N/4); in test()
76 test_one<Iter>(N, N/2); in test()
77 test_one<Iter>(N, 3*N/4); in test()
78 test_one<Iter>(N, N); in test()
81 template <class Iter>
[all …]
|
| /external/libcxx/test/std/numerics/numeric.ops/reduce/ |
| D | reduce_init.pass.cpp | 21 template <class Iter, class T>
23 test(Iter first, Iter last, T init, T x) in test()
29 template <class Iter>
35 test(Iter(ia), Iter(ia), 0, 0); in test()
36 test(Iter(ia), Iter(ia), 1, 1); in test()
37 test(Iter(ia), Iter(ia+1), 0, 1); in test()
38 test(Iter(ia), Iter(ia+1), 2, 3); in test()
39 test(Iter(ia), Iter(ia+2), 0, 3); in test()
40 test(Iter(ia), Iter(ia+2), 3, 6); in test()
41 test(Iter(ia), Iter(ia+sa), 0, 21); in test()
[all …]
|
| 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) in test()
29 template <class Iter>
35 test(Iter(ia), Iter(ia), 0, std::plus<>(), 0); in test()
36 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), 1); in test()
37 test(Iter(ia), Iter(ia+1), 0, std::plus<>(), 1); in test()
38 test(Iter(ia), Iter(ia+1), 2, std::multiplies<>(), 2); in test()
39 test(Iter(ia), Iter(ia+2), 0, std::plus<>(), 3); in test()
40 test(Iter(ia), Iter(ia+2), 3, std::multiplies<>(), 6); in test()
41 test(Iter(ia), Iter(ia+sa), 0, std::plus<>(), 21); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| D | unique.pass.cpp | 38 template <class Iter>
44 Iter r = std::unique(Iter(ia), Iter(ia+sa)); in test()
50 r = std::unique(Iter(ib), Iter(ib+sb)); in test()
57 r = std::unique(Iter(ic), Iter(ic+sc)); in test()
63 r = std::unique(Iter(id), Iter(id+sd)); in test()
70 r = std::unique(Iter(ie), Iter(ie+se)); in test()
78 r = std::unique(Iter(ig), Iter(ig+sg)); in test()
85 r = std::unique(Iter(ih), Iter(ih+sh)); in test()
92 r = std::unique(Iter(ii), Iter(ii+si)); in test()
108 template <class Iter>
[all …]
|
| D | unique_pred.pass.cpp | 48 template <class Iter>
55 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal()); in test()
63 r = std::unique(Iter(ib), Iter(ib+sb), count_equal()); in test()
72 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test()
80 r = std::unique(Iter(id), Iter(id+sd), count_equal()); in test()
89 r = std::unique(Iter(ie), Iter(ie+se), count_equal()); in test()
99 r = std::unique(Iter(ig), Iter(ig+sg), count_equal()); in test()
108 r = std::unique(Iter(ih), Iter(ih+sh), count_equal()); in test()
117 r = std::unique(Iter(ii), Iter(ii+si), count_equal()); in test()
134 template <class Iter>
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_element.pass.cpp | 25 template <class Iter>
27 test(Iter first, Iter last) in test()
29 std::pair<Iter, Iter> p = std::minmax_element(first, last); in test()
32 for (Iter j = first; j != last; ++j) in test()
45 template <class Iter>
53 test(Iter(a), Iter(a+N)); in test()
57 template <class Iter>
61 test<Iter>(0); in test()
62 test<Iter>(1); in test()
63 test<Iter>(2); in test()
[all …]
|
| D | minmax_element_comp.pass.cpp | 27 template <class Iter>
29 test(Iter first, Iter last) in test()
33 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); in test()
36 for (Iter j = first; j != last; ++j) in test()
49 template <class Iter>
57 test(Iter(a), Iter(a+N)); in test()
61 template <class Iter>
65 test<Iter>(0); in test()
66 test<Iter>(1); in test()
67 test<Iter>(2); in test()
[all …]
|
| D | max_element_comp.pass.cpp | 27 template <class Iter>
29 test(Iter first, Iter last) in test()
31 Iter i = std::max_element(first, last, std::greater<int>()); in test()
34 for (Iter j = first; j != last; ++j) in test()
41 template <class Iter>
49 test(Iter(a), Iter(a+N)); in test()
53 template <class Iter>
57 test<Iter>(0); in test()
58 test<Iter>(1); in test()
59 test<Iter>(2); in test()
[all …]
|
| D | min_element_comp.pass.cpp | 27 template <class Iter>
29 test(Iter first, Iter last) in test()
31 Iter i = std::min_element(first, last, std::greater<int>()); in test()
34 for (Iter j = first; j != last; ++j) in test()
41 template <class Iter>
49 test(Iter(a), Iter(a+N)); in test()
53 template <class Iter>
57 test<Iter>(0); in test()
58 test<Iter>(1); in test()
59 test<Iter>(2); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| D | stable_partition.pass.cpp | 36 template <class Iter>
56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
85 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
98 r = std::stable_partition(Iter(array), Iter(array), odd_first()); in test()
101 r = std::stable_partition(Iter(array), Iter(array+1), odd_first()); in test()
105 r = std::stable_partition(Iter(array+4), Iter(array+5), odd_first()); in test()
125 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
154 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
183 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
212 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); in test()
[all …]
|
| /external/googletest/googletest/scripts/ |
| D | gen_gtest_pred_impl.py | 188 def Iter(n, format, sep=''): function
210 'vs' : Iter(n, 'v%s', sep=', '),
211 'vts' : Iter(n, '#v%s', sep=', '),
222 impl += Iter(n, """,
228 impl += Iter(n, """,
234 impl += Iter(n, """,
244 impl += Iter(n, """
249 impl += Iter(n, """
266 impl += Iter(n, """, \\
272 impl += Iter(n, """, \\
[all …]
|