Home
last modified time | relevance | path

Searched refs:less (Results 1 – 25 of 2987) sorted by relevance

12345678910>>...120

/third_party/abseil-cpp/absl/types/
Dcompare_test.cc69 EXPECT_TRUE(Identity(partial_ordering::less < 0)); in TEST()
70 EXPECT_TRUE(Identity(0 > partial_ordering::less)); in TEST()
71 EXPECT_TRUE(Identity(partial_ordering::less <= 0)); in TEST()
72 EXPECT_TRUE(Identity(0 >= partial_ordering::less)); in TEST()
90 partial_ordering::less, partial_ordering::equivalent, in TEST()
102 EXPECT_TRUE(Identity(weak_ordering::less < 0)); in TEST()
103 EXPECT_TRUE(Identity(0 > weak_ordering::less)); in TEST()
104 EXPECT_TRUE(Identity(weak_ordering::less <= 0)); in TEST()
105 EXPECT_TRUE(Identity(0 >= weak_ordering::less)); in TEST()
113 weak_ordering::less, weak_ordering::equivalent, weak_ordering::greater}; in TEST()
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/types/
Dcompare_test.cc69 EXPECT_TRUE(Identity(partial_ordering::less < 0)); in TEST()
70 EXPECT_TRUE(Identity(0 > partial_ordering::less)); in TEST()
71 EXPECT_TRUE(Identity(partial_ordering::less <= 0)); in TEST()
72 EXPECT_TRUE(Identity(0 >= partial_ordering::less)); in TEST()
90 partial_ordering::less, partial_ordering::equivalent, in TEST()
102 EXPECT_TRUE(Identity(weak_ordering::less < 0)); in TEST()
103 EXPECT_TRUE(Identity(0 > weak_ordering::less)); in TEST()
104 EXPECT_TRUE(Identity(weak_ordering::less <= 0)); in TEST()
105 EXPECT_TRUE(Identity(0 >= weak_ordering::less)); in TEST()
113 weak_ordering::less, weak_ordering::equivalent, weak_ordering::greater}; in TEST()
[all …]
/third_party/boost/tools/build/src/build/
Dversion.jam67 # Returns "true" if the first version is less than the second one.
69 rule version-less ( lhs + : rhs + )
79 if [ numbers.less $(lhs[1]) $(rhs[1]) ]
84 else if [ numbers.less $(rhs[1]) $(lhs[1]) ]
125 if [ version-less [ modules.peek : JAM_VERSION ] : $(version) ]
145 assert.true version-less 0 : 1 ;
146 assert.false version-less 0 : 0 ;
147 assert.true version-less 1 : 2 ;
148 assert.false version-less 1 : 1 ;
149 assert.false version-less 2 : 1 ;
[all …]
/third_party/boost/libs/hana/test/_include/laws/
Dorderable.hpp60 hana::less(a, b) ^iff^ hana::not_(hana::less_equal(b, a)) in TestOrderable()
64 hana::greater(a, b) ^iff^ hana::less(b, a) in TestOrderable()
68 hana::greater_equal(a, b) ^iff^ hana::not_(hana::less(a, b)) in TestOrderable()
72 BOOST_HANA_CHECK(hana::less.than(a)(b) ^iff^ hana::less(b, a)); in TestOrderable()
80 hana::ordering(f)(a, b) ^iff^ hana::less(f(a), f(b)) in TestOrderable()
103 hana::value(hana::less(a, b)) ^iff^ in __anon2390d1e50402()
104 hana::less(hana::value(a), hana::value(b)) in __anon2390d1e50402()
121 hana::less(x, y) ^iff^ in __anon2390d1e50502()
123 hana::less(hana::first(x), hana::first(y)), in __anon2390d1e50502()
126 hana::less(hana::second(x), hana::second(y)) in __anon2390d1e50502()
[all …]
/third_party/boost/libs/ratio/test/ratio_extensions/
Dmpl_less_pass.cpp26 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
31 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
36 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
41 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
46 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
51 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
56 BOOST_RATIO_STATIC_ASSERT((boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
61 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
66 BOOST_RATIO_STATIC_ASSERT((boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
71 BOOST_RATIO_STATIC_ASSERT((!boost::mpl::less<R1, R2>::value), NOTHING, ()); in test()
[all …]
/third_party/boost/libs/container/test/
Dflat_tree_test.cpp34 , std::less<test::movable_and_copyable_int>
41 , std::less<test::movable_and_copyable_int>
48 , std::less<test::movable_and_copyable_int>
55 , std::less<test::movable_and_copyable_int>
62 , std::less<test::movable_and_copyable_int>
69 , std::less<test::movable_and_copyable_int>
76 , std::less<test::movable_and_copyable_int>
83 , std::less<test::movable_and_copyable_int>
90 , std::less<test::movable_and_copyable_int>
107 , std::less<test::movable_and_copyable_int>
[all …]
Dtree_test.cpp35 , std::less<test::movable_and_copyable_int>
43 , std::less<test::movable_and_copyable_int>
51 , std::less<test::movable_and_copyable_int>
59 , std::less<test::movable_and_copyable_int>
67 , std::less<test::movable_and_copyable_int>
75 , std::less<test::movable_and_copyable_int>
91 typedef boost::container::dtl::tree<int, void, std::less<int>, void, void> tree; in main()
105 … typedef boost::container::dtl::tree<int, void, std::less<int>, std::allocator<int>, void> tree; in main()
/third_party/boost/libs/hana/test/
Dorderable.cpp64 BOOST_HANA_CONSTEXPR_CHECK(hana::less(5, 6)); in main()
65 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(6, 6))); in main()
66 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(7, 6))); in main()
69 BOOST_HANA_CONSTEXPR_CHECK(hana::less(ord1{0}, ord1{1})); in main()
70 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(ord1{0}, ord1{0}))); in main()
71 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(ord1{1}, ord1{0}))); in main()
73 BOOST_HANA_CONSTEXPR_CHECK(hana::less(ord1{0}, ord2{1})); in main()
74 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(ord1{0}, ord2{0}))); in main()
75 BOOST_HANA_CONSTEXPR_CHECK(hana::not_(hana::less(ord1{1}, ord2{0}))); in main()
77 BOOST_HANA_CONSTEXPR_CHECK(hana::less(ord2{0}, ord1{1})); in main()
[all …]
/third_party/boost/libs/mpl/doc/src/refmanual/
Dless.rst1 .. Metafunctions/Comparisons//less |10
3 less title
15 struct less
25 Returns a true-valued |Integral Constant| if ``T1`` is less than ``T2``.
33 #include <boost/mpl/less.hpp>
63 typedef less<c1,c2>::type r;
80 typedef less<c1,c2> r;
90 struct r : less<c1,c2>::type {};
105 BOOST_MPL_ASSERT(( less< int_<0>, int_<10> > ));
106 BOOST_MPL_ASSERT_NOT(( less< long_<10>, int_<0> > ));
[all …]
/third_party/boost/libs/interprocess/test/
Dtree_test.cpp66 typedef set<int, std::less<int>, shmem_allocator_t> MyShmSet;
67 typedef multiset<int, std::less<int>, shmem_allocator_t> MyShmMultiSet;
68 typedef map<int, int, std::less<int>, shmem_node_pair_allocator_t> MyShmMap;
69 typedef multimap<int, int, std::less<int>, shmem_node_pair_allocator_t> MyShmMultiMap;
72 typedef set<test::movable_int, std::less<test::movable_int>
75 std::less<test::movable_int>,
78 std::less<test::movable_int>,
81 std::less<test::movable_int>,
85 ,std::less<test::movable_and_copyable_int>
88 std::less<test::movable_and_copyable_int>,
[all …]
Dflat_tree_test.cpp67 typedef flat_set<int, std::less<int>, shmem_allocator_t> MyShmSet;
68 typedef flat_multiset<int, std::less<int>, shmem_allocator_t> MyShmMultiSet;
69 typedef flat_map<int, int, std::less<int>, shmem_pair_allocator_t> MyShmMap;
70 typedef flat_multimap<int, int, std::less<int>, shmem_pair_allocator_t> MyShmMultiMap;
72 typedef flat_set<test::movable_int, std::less<test::movable_int>
74 typedef flat_multiset<test::movable_int,std::less<test::movable_int>
77 ,std::less<test::movable_int>
80 ,std::less<test::movable_int>
83 typedef flat_set<test::movable_and_copyable_int, std::less<test::movable_and_copyable_int>
85 typedef flat_multiset<test::movable_and_copyable_int,std::less<test::movable_and_copyable_int>
[all …]
/third_party/boost/boost/container/
Dcontainer_fwd.hpp139 ,class Compare = std::less<Key>
145 ,class Compare = std::less<Key>
152 ,class Compare = std::less<Key>
159 ,class Compare = std::less<Key>
165 ,class Compare = std::less<Key>
170 ,class Compare = std::less<Key>
176 ,class Compare = std::less<Key>
182 ,class Compare = std::less<Key>
192 , class Compare = std::less<Key>
199 , class Compare = std::less<Key>
[all …]
/third_party/boost/libs/compute/test/
Dtest_merge_sort_gpu.cpp39 ::boost::compute::less<char_> less; in BOOST_AUTO_TEST_CASE()
48 vector.begin(), vector.end(), less, queue in BOOST_AUTO_TEST_CASE()
51 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
73 ::boost::compute::less<int_> less; in BOOST_AUTO_TEST_CASE()
87 vector.begin(), vector.end(), less, queue in BOOST_AUTO_TEST_CASE()
90 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
110 ::boost::compute::less<ulong_> less; in BOOST_AUTO_TEST_CASE()
124 vector.begin(), vector.end(), less, queue in BOOST_AUTO_TEST_CASE()
127 boost::compute::is_sorted(vector.begin(), vector.end(), less, queue) in BOOST_AUTO_TEST_CASE()
148 ::boost::compute::less<float_> less; in BOOST_AUTO_TEST_CASE()
[all …]
/third_party/boost/libs/hana/test/string/
Dless.cpp17 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
22 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
27 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
32 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
37 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
42 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
47 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
/third_party/boost/libs/bimap/test/
Dtest_bimap_sequenced.cpp144 c.sort(std::less<bm_type::value_type>()); in test_bimap()
145 b.sort(std::less<bm_type::value_type>()); in test_bimap()
146 c.merge(b,std::less<bm_type::value_type>()); in test_bimap()
152 c.left.sort(std::less<std::string>()); in test_bimap()
153 b.left.sort(std::less<std::string>()); in test_bimap()
154 c.left.merge(b.left,std::less<std::string>()); in test_bimap()
160 c.right.sort(std::less<long>()); in test_bimap()
161 b.right.sort(std::less<long>()); in test_bimap()
162 c.right.merge(b.right,std::less<long>()); in test_bimap()
200 c.sort(std::less<bm_type::value_type>()); in test_bimap()
[all …]
/third_party/boost/libs/range/test/
Dalgorithm.cpp129 boost::sort(rng, std::less<value_type>()); in test_random_algorithms()
132 boost::stable_sort(rng, std::less<value_type>()); in test_random_algorithms()
135 boost::partial_sort(rng, boost::begin(rng), std::less<value_type>()); in test_random_algorithms()
138 boost::nth_element(rng, boost::begin(rng), std::less<value_type>()); in test_random_algorithms()
141 boost::push_heap(rng, std::less<value_type>()); in test_random_algorithms()
144 boost::pop_heap(rng, std::less<value_type>()); in test_random_algorithms()
147 boost::make_heap(rng, std::less<value_type>()); in test_random_algorithms()
150 boost::sort_heap(rng, std::less<value_type>()); in test_random_algorithms()
277 i = boost::lower_bound(rng, val, std::less<value_type>()); in test_algorithms()
280 i = boost::upper_bound(rng, val, std::less<value_type>()); in test_algorithms()
[all …]
/third_party/boost/tools/build/src/util/
Dnumbers.jam54 while [ less $(start) $(finish) ] || $(start) = $(finish)
64 rule less ( n1 n2 )
142 assert.true less 1 2 ;
143 assert.true less 1 12 ;
144 assert.true less 1 21 ;
145 assert.true less 005 217 ;
146 assert.false less 0 0 ;
147 assert.false less 03 3 ;
148 assert.false less 3 03 ;
149 assert.true less 005 217 ;
[all …]
/third_party/boost/libs/hana/test/experimental/view/transformed/
Dless.cpp23 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
30 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
34 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
38 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
45 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
49 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
53 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
/third_party/boost/libs/multi_index/test/
Dtest_range.cpp59 BIND1ST(std::less<int>(),5), /* 5 < x */ in test_range()
75 BIND2ND(std::less<int>(),8)); /* x < 8 */ in test_range()
89 BIND1ST(std::less<int>(),6), /* 6 < x */ in test_range()
95 BIND2ND(std::less<int>(),5)); /* x < 5 */ in test_range()
104 BIND1ST(std::less<int>(),0), /* 0 < x */ in test_range()
105 BIND2ND(std::less<int>(),11)); /* x < 11 */ in test_range()
109 BIND1ST(std::less<int>(),7), /* 7 < x */ in test_range()
116 BIND2ND(std::less<int>(),2)); /* x < 2 */ in test_range()
121 BIND1ST(std::less<int>(),4), /* 4 < x */ in test_range()
122 BIND2ND(std::less<int>(),5)); /* x < 5 */ in test_range()
/third_party/boost/boost/log/expressions/predicates/
Dchannel_severity_filter.hpp54 typename ChannelOrderT = less,
228 typename ChannelOrderT = less,
321 …elDescriptorT::value_type, SeverityT, fallback_to_none, fallback_to_none, less, greater_equal, std…
324 …elDescriptorT::value_type, SeverityT, fallback_to_none, fallback_to_none, less, greater_equal, std… in channel_severity_filter()
332 …name SeverityDescriptorT::value_type, fallback_to_none, fallback_to_none, less, greater_equal, std…
335 …name SeverityDescriptorT::value_type, fallback_to_none, fallback_to_none, less, greater_equal, std… in channel_severity_filter()
343 …name SeverityDescriptorT::value_type, fallback_to_none, fallback_to_none, less, greater_equal, std…
346 …name SeverityDescriptorT::value_type, fallback_to_none, fallback_to_none, less, greater_equal, std… in channel_severity_filter()
354 …ty_filter_actor< ChannelT, SeverityT, ChannelFallbackT, fallback_to_none, less, greater_equal, std…
357 …ty_filter_actor< ChannelT, SeverityT, ChannelFallbackT, fallback_to_none, less, greater_equal, std… in channel_severity_filter()
[all …]
/third_party/boost/libs/container/bench/
Dbench_set_avl.cpp24 …launch_tests< set<int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree… in main()
26 …launch_tests< set<string, std::less<string>, std::allocator<string>, tree_assoc_options< tree_type… in main()
30 …launch_tests< set<int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree… in main()
31 …, set<int, std::less<int>, std::allocator<int>, tree_assoc_options< tree_type<avl_tree>, optimize_… in main()
33 …launch_tests< set<string, std::less<string>, std::allocator<string>, tree_assoc_options< tree_type… in main()
34 …, set<string, std::less<string>, std::allocator<string>, tree_assoc_options< tree_type<avl_tree>, … in main()
/third_party/mindspore/mindspore/ops/composite/multitype_ops/
Dless_impl.py22 less = base.MultitypeFuncGraph("less", True) variable
25 @less.register("Number", "Number")
40 @less.register("Tensor", "Number")
41 @less.register("Number", "Tensor")
42 @less.register("Tensor", "Tensor")
/third_party/boost/libs/algorithm/test/
Dordered_test.cpp32 BOOST_CXX14_CONSTEXPR bool less( int x, int y ) { return x < y; } in less() function
46 BOOST_CHECK ( ba::is_sorted (b_e(strictlyIncreasingValues), std::less<int>())); in test_ordered()
52 BOOST_CHECK ( ba::is_sorted (a_range(strictlyIncreasingValues), std::less<int>())); in test_ordered()
56 …BOOST_CHECK ( ba::is_sorted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == … in test_ordered()
58 …BOOST_CHECK ( ba::is_sorted_until ( a_range(strictlyIncreasingValues), std::less<int>()) == boost… in test_ordered()
61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered()
62 …BOOST_CHECK ( ba::is_sorted_until ( a_range(constantValues), std::less<int>()) == boost::end(con… in test_ordered()
63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
64 …BOOST_CHECK ( ba::is_sorted_until ( a_range(nonConstantArray), std::less<int>()) == boost::end(non… in test_ordered()
66 …BOOST_CHECK ( ba::is_sorted_until ( b_e(randomValues), std::less<int>()) == &randomValues[2] ); in test_ordered()
[all …]
/third_party/boost/libs/hana/test/optional/
Dless.cpp27 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
31 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
35 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
40 BOOST_HANA_CONSTANT_CHECK(hana::less( in main()
44 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
48 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::less( in main()
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/duration/testdata/
Dtestdata_en.txt198 less than 1 month
199 less than 1 month and 2 weeks
200 less than 1 month, 2 weeks, and 3 days
201 less than 1 month ago
202 less than 1 month and 2 weeks ago
203 less than 1 month, 2 weeks, and 3 days ago
204 less than 1 month from now
205 less than 1 month and 2 weeks from now
206 less than 1 month, 2 weeks, and 3 days from now
225 less than 1 hour
[all …]

12345678910>>...120