| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| D | is_heap_comp.pass.cpp | 27 return std::is_heap(std::begin(ia), std::end(ia), std::greater<int>()) in test_constexpr()
28 && !std::is_heap(std::begin(ib), std::end(ib), std::greater<int>()); in test_constexpr()
35 assert(std::is_heap(i1, i1, std::greater<int>())); in test()
36 …assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<i… in test()
39 …assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<i… in test()
40 …assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<i… in test()
41 …assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<i… in test()
49 …assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<i… in test()
50 …assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<i… in test()
51 …assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<i… in test()
[all …]
|
| D | is_heap_until_comp.pass.cpp | 27 return (std::is_heap_until(std::begin(ia), std::end(ia), std::greater<int>()) == ia+1) in test_constexpr()
28 && (std::is_heap_until(std::begin(ib), std::end(ib), std::greater<int>()) == ib+3); in test_constexpr()
35 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1); in test()
36 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1); in test()
39 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2); in test()
40 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2); in test()
41 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1); in test()
49 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3); in test()
50 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3); in test()
51 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_comp.pass.cpp | 27 return std::is_sorted(std::begin(ia), std::end(ia), std::greater<int>()) in test_constexpr()
28 && !std::is_sorted(std::begin(ib), std::end(ib), std::greater<int>()); in test_constexpr()
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 …]
|
| D | is_sorted_until_comp.pass.cpp | 27 return (std::is_sorted_until(std::begin(ia), std::end(ia), std::greater<int>()) == ia+2) in test_constexpr()
28 && (std::is_sorted_until(std::begin(ib), std::end(ib), std::greater<int>()) == ib+3); in test_constexpr()
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()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_init_list_comp.pass.cpp | 41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
49 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); in main()
68 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
69 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
70 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
[all …]
|
| D | max_init_list_comp.pass.cpp | 26 int i = std::max({2, 3, 1}, std::greater<int>()); in main()
28 i = std::max({2, 1, 3}, std::greater<int>()); in main()
30 i = std::max({3, 1, 2}, std::greater<int>()); in main()
32 i = std::max({3, 2, 1}, std::greater<int>()); in main()
34 i = std::max({1, 2, 3}, std::greater<int>()); in main()
36 i = std::max({1, 3, 2}, std::greater<int>()); in main()
40 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, ""); in main()
41 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, ""); in main()
42 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, ""); in main()
|
| D | min_init_list_comp.pass.cpp | 26 int i = std::min({2, 3, 1}, std::greater<int>()); in main()
28 i = std::min({2, 1, 3}, std::greater<int>()); in main()
30 i = std::min({3, 1, 2}, std::greater<int>()); in main()
32 i = std::min({3, 2, 1}, std::greater<int>()); in main()
34 i = std::min({1, 2, 3}, std::greater<int>()); in main()
36 i = std::min({1, 3, 2}, std::greater<int>()); in main()
40 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, ""); in main()
41 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, ""); in main()
42 static_assert(std::min({3, 2, 1}, std::greater<int>()) == 3, ""); in main()
|
| D | max_comp.pass.cpp | 35 test(x, y, std::greater<int>(), x); in main()
36 test(y, x, std::greater<int>(), y); in main()
41 test(x, y, std::greater<int>(), x); in main()
42 test(y, x, std::greater<int>(), x); in main()
47 test(x, y, std::greater<int>(), y); in main()
48 test(y, x, std::greater<int>(), y); in main()
54 static_assert(std::max(x, y, std::greater<int>()) == y, "" ); in main()
55 static_assert(std::max(y, x, std::greater<int>()) == y, "" ); in main()
|
| D | min_comp.pass.cpp | 35 test(x, y, std::greater<int>(), x); in main()
36 test(y, x, std::greater<int>(), y); in main()
41 test(x, y, std::greater<int>(), y); in main()
42 test(y, x, std::greater<int>(), y); in main()
47 test(x, y, std::greater<int>(), x); in main()
48 test(y, x, std::greater<int>(), x); in main()
54 static_assert(std::min(x, y, std::greater<int>()) == x, "" ); in main()
55 static_assert(std::min(y, x, std::greater<int>()) == x, "" ); in main()
|
| D | minmax_comp.pass.cpp | 38 test(x, y, std::greater<int>(), x, y); in main()
39 test(y, x, std::greater<int>(), y, x); in main()
44 test(x, y, std::greater<int>(), y, x); in main()
45 test(y, x, std::greater<int>(), y, x); in main()
50 test(x, y, std::greater<int>(), x, y); in main()
51 test(y, x, std::greater<int>(), x, y); in main()
59 constexpr auto p1 = std::minmax(x, y, std::greater<>()); in main()
62 constexpr auto p2 = std::minmax(y, x, std::greater<>()); in main()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Mips/ |
| D | ase_warnings.ll | 61 ; MSA_32: warning: the 'msa' ASE requires MIPS32 revision 5 or greater
62 ; MSA_64: warning: the 'msa' ASE requires MIPS64 revision 5 or greater
63 ; MSA_32_NO_WARNING-NOT: warning: the 'msa' ASE requires MIPS32 revision 5 or greater
64 ; MSA_64_NO_WARNING-NOT: warning: the 'msa' ASE requires MIPS64 revision 5 or greater
66 ; DSPR2_32: warning: the 'dspr2' ASE requires MIPS32 revision 2 or greater
67 ; DSPR2_64: warning: the 'dspr2' ASE requires MIPS64 revision 2 or greater
68 ; DSPR2_32_NO_WARNING-NOT: warning: the 'dspr2' ASE requires MIPS32 revision 2 or greater
69 ; DSPR2_64_NO_WARNING-NOT: warning: the 'dspr2' ASE requires MIPS64 revision 2 or greater
71 ; DSP_32: warning: the 'dsp' ASE requires MIPS32 revision 2 or greater
72 ; DSP_64: warning: the 'dsp' ASE requires MIPS64 revision 2 or greater
[all …]
|
| /external/clang/test/SemaCXX/ |
| D | namespace.cpp | 81 struct greater {}; struct
84 extern op::greater const greater;
90 op::greater const greater = op::greater(); variable
95 { numeric::greater(l, r); } in f()
|
| /external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| D | deduct.pass.cpp | 48 std::priority_queue pri(std::greater<int>(), v); // priority_queue(Compare, Container) in main()
50 …(std::is_same_v<decltype(pri), std::priority_queue<int, std::vector<int>, std::greater<int>>>, ""); in main()
57 …std::priority_queue pri(std::greater<long>(), v, test_allocator<long>(2)); // priority_queue(Compa… in main()
60 … std::priority_queue<long, std::vector<long, test_allocator<long>>, std::greater<long>>>, ""); in main()
76 …std::priority_queue pri(v.begin(), v.end(), std::greater<double>()); // priority_queue(Iter, Iter,… in main()
78 …same_v<decltype(pri), std::priority_queue<double, std::vector<double>, std::greater<double>>>, ""); in main()
86 …std::priority_queue pri(v.begin(), v.end(), std::greater<double>(), deq); // priority_queue(Iter, … in main()
88 …_same_v<decltype(pri), std::priority_queue<double, std::deque<double>, std::greater<double>>>, ""); in main()
111 typedef std::greater<T> Comp; in main()
|
| D | deduct.fail.cpp | 27 …std::priority_queue pri(std::greater<int>(), std::deque<int>({1,2,3}), 45); // expected-error {{n… in main()
40 …std::priority_queue pri(15, 17, std::greater<double>()); // expected-error {{no viable constructo… in main()
46 …std::priority_queue pri(23.f, 2.f, std::greater<float>(), std::deque<float>()); // expected-erro… in main()
|
| D | ctor_copy.pass.cpp | 31 std::priority_queue<int, std::vector<int>, std::greater<int> > qo(std::greater<int>(), v); in main()
32 std::priority_queue<int, std::vector<int>, std::greater<int> > q = qo; in main()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| D | make_heap_comp.pass.cpp | 42 std::make_heap(ia, ia+N, std::greater<int>()); in test()
43 assert(std::is_heap(ia, ia+N, std::greater<int>())); in test()
48 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); in test()
58 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); in test()
68 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); in test()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | cwise_op_greater.cc | 19 REGISTER9(BinaryOp, CPU, "Greater", functor::greater, float, Eigen::half,
22 REGISTER7(BinaryOp, GPU, "Greater", functor::greater, float, Eigen::half,
34 BinaryOp<CPUDevice, functor::greater<int32>>);
37 REGISTER2(BinaryOp, SYCL, "Greater", functor::greater, float, double);
45 BinaryOp<CPUDevice, functor::greater<int32>>);
|
| /external/libcxx/test/std/utilities/function.objects/comparisons/ |
| D | greater.pass.cpp | 23 typedef std::greater<int> F; in main()
34 do_pointer_comparison_test<int, std::greater>(); in main()
37 typedef std::greater<> F2; in main()
47 constexpr bool foo = std::greater<int> () (36, 36); in main()
50 constexpr bool bar = std::greater<> () (36.0, 36); in main()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.clamp/ |
| D | clamp.comp.pass.cpp | 48 test(x, y, z, std::greater<int>(), x); in main()
49 test(y, x, z, std::greater<int>(), y); in main()
55 test(x, y, z, std::greater<int>(), x); in main()
56 test(y, x, z, std::greater<int>(), x); in main()
62 test(x, y, z, std::greater<int>(), y); in main()
63 test(y, x, z, std::greater<int>(), y); in main()
124 static_assert(std::clamp(x, y, z, std::greater<T>()) == y, "" ); in main()
125 static_assert(std::clamp(y, x, z, std::greater<T>()) == y, "" ); in main()
|
| /external/clang/lib/Parse/ |
| D | ParseTemplate.cpp | 342 if (!Tok.is(tok::greater) && !Tok.is(tok::greatergreater)) in ParseTemplateParameters()
351 Tok.setKind(tok::greater); in ParseTemplateParameters()
354 } else if (!TryConsumeToken(tok::greater, RAngleLoc) && Failed) { in ParseTemplateParameters()
355 Diag(Tok.getLocation(), diag::err_expected) << tok::greater; in ParseTemplateParameters()
379 SkipUntil(tok::comma, tok::greater, tok::greatergreater, in ParseTemplateParameterList()
386 } else if (Tok.isOneOf(tok::greater, tok::greatergreater)) { in ParseTemplateParameterList()
394 SkipUntil(tok::comma, tok::greater, tok::greatergreater, in ParseTemplateParameterList()
411 case tok::greater: in isStartOfTemplateTypeParameter()
428 case tok::greater: in isStartOfTemplateTypeParameter()
455 case tok::greater: in isStartOfTemplateTypeParameter()
[all …]
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| D | top_n_test.cc | 92 TestIntTopN(0, 5, std::greater<int>(), &random); in TEST()
93 TestIntTopN(32, 0, std::greater<int>(), &random); in TEST()
94 TestIntTopN(6, 6, std::greater<int>(), &random); in TEST()
96 TestIntTopN(1000, 999, std::greater<int>(), &random); in TEST()
97 TestIntTopN(1000, 1000, std::greater<int>(), &random); in TEST()
98 TestIntTopN(1000, 1001, std::greater<int>(), &random); in TEST()
100 TestIntTopN(30, 100, std::greater<int>(), &random); in TEST()
102 TestIntTopN(size_t(-1), 3, std::greater<int>(), &random); in TEST()
103 TestIntTopN(size_t(-1), 0, std::greater<int>(), &random); in TEST()
104 TestIntTopN(0, 5, std::greater<int>(), &random); in TEST()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| D | equal_range_comp.pass.cpp | 42 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); in test()
44 assert(std::greater<int>()(*j, value)); in test()
46 assert(!std::greater<int>()(*j, value)); in test()
48 assert(!std::greater<int>()(value, *j)); in test()
50 assert(std::greater<int>()(value, *j)); in test()
67 std::sort(v.begin(), v.end(), std::greater<int>()); in test()
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 102 std::greater<Scalar> greater; in greatestRoot() local
103 return selectComplexRoot_withRespectToNorm( greater ); in greatestRoot()
216 std::greater<Scalar> greater; variable
217 … return selectRealRoot_withRespectToAbsRealPart( greater, hasArealRoot, absImaginaryThreshold );
262 std::greater<Scalar> greater; variable
263 return selectRealRoot_withRespectToRealPart( greater, hasArealRoot, absImaginaryThreshold );
|
| /external/libcxx/test/std/language.support/cmp/cmp.strongord/ |
| D | strongord.pass.cpp | 29 DoNotOptimize(&std::strong_ordering::greater); in test_static_members()
65 std::strong_ordering::greater, in test_conversion()
86 std::strong_ordering::greater, in test_conversion()
107 auto V = std::strong_ordering::greater; in test_conversion()
125 auto V = std::strong_ordering::greater; in test_conversion()
136 auto& Greater = std::strong_ordering::greater; in test_constexpr()
184 {std::strong_ordering::greater, ER_Greater}, in test_constexpr()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 41 std::make_heap(ia, ia+N, std::greater<int>()); in test()
44 std::pop_heap(ia, ia+i, std::greater<int>()); in test()
45 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); in test()
47 std::pop_heap(ia, ia, std::greater<int>()); in test()
|