| /external/fmtlib/doc/bootstrap/ |
| D | bootstrap.less | 2 @import "variables.less";
3 @import "mixins.less";
6 @import "normalize.less";
7 @import "print.less";
8 @import "glyphicons.less";
11 @import "scaffolding.less";
12 @import "type.less";
13 @import "code.less";
14 @import "grid.less";
15 @import "tables.less";
[all …]
|
| D | mixins.less | 5 @import "mixins/hide-text.less";
6 @import "mixins/opacity.less";
7 @import "mixins/image.less";
8 @import "mixins/labels.less";
9 @import "mixins/reset-filter.less";
10 @import "mixins/resize.less";
11 @import "mixins/responsive-visibility.less";
12 @import "mixins/size.less";
13 @import "mixins/tab-focus.less";
14 @import "mixins/text-emphasis.less";
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/types/ |
| D | compare_test.cc | 30 EXPECT_TRUE(Identity(partial_ordering::less < 0)); in TEST()
31 EXPECT_TRUE(Identity(0 > partial_ordering::less)); in TEST()
32 EXPECT_TRUE(Identity(partial_ordering::less <= 0)); in TEST()
33 EXPECT_TRUE(Identity(0 >= partial_ordering::less)); in TEST()
51 partial_ordering::less, partial_ordering::equivalent, in TEST()
63 EXPECT_TRUE(Identity(weak_ordering::less < 0)); in TEST()
64 EXPECT_TRUE(Identity(0 > weak_ordering::less)); in TEST()
65 EXPECT_TRUE(Identity(weak_ordering::less <= 0)); in TEST()
66 EXPECT_TRUE(Identity(0 >= weak_ordering::less)); in TEST()
74 weak_ordering::less, weak_ordering::equivalent, weak_ordering::greater}; in TEST()
[all …]
|
| /external/abseil-cpp/absl/types/ |
| D | compare_test.cc | 30 EXPECT_TRUE(Identity(partial_ordering::less < 0)); in TEST()
31 EXPECT_TRUE(Identity(0 > partial_ordering::less)); in TEST()
32 EXPECT_TRUE(Identity(partial_ordering::less <= 0)); in TEST()
33 EXPECT_TRUE(Identity(0 >= partial_ordering::less)); in TEST()
51 partial_ordering::less, partial_ordering::equivalent, in TEST()
63 EXPECT_TRUE(Identity(weak_ordering::less < 0)); in TEST()
64 EXPECT_TRUE(Identity(0 > weak_ordering::less)); in TEST()
65 EXPECT_TRUE(Identity(weak_ordering::less <= 0)); in TEST()
66 EXPECT_TRUE(Identity(0 >= weak_ordering::less)); in TEST()
74 weak_ordering::less, weak_ordering::equivalent, weak_ordering::greater}; in TEST()
[all …]
|
| /external/go-cmp/cmp/cmpopts/ |
| D | sort.go | 17 // The less function must be of the form "func(T, T) bool" which is used to
20 // The less function must be:
21 // - Deterministic: less(x, y) == less(x, y)
22 // - Irreflexive: !less(x, x)
23 // - Transitive: if !less(x, y) and !less(y, z), then !less(x, z)
25 // The less function does not have to be "total". That is, if !less(x, y) and
26 // !less(y, x) for two elements x and y, their relative order is maintained.
31 if !function.IsType(vf.Type(), function.Less) || vf.IsNil() {
32 panic(fmt.Sprintf("invalid less function: %T", lessFunc))
52 ok1 := sort.SliceIsSorted(x, func(i, j int) bool { return ss.less(vx, i, j) })
[all …]
|
| /external/cronet/third_party/libc++/src/test/libcxx/algorithms/ |
| D | ranges_robust_against_copying_comparators.pass.cpp | 21 struct Less { struct
23 constexpr explicit Less(int *copies) : copies_(copies) {} in Less() argument
24 constexpr Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
25 constexpr Less& operator=(const Less&) = default;
98 (void)std::ranges::binary_search(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
99 (void)std::ranges::binary_search(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
100 (void)std::ranges::clamp(value, value, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
111 (void)std::ranges::equal_range(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
112 (void)std::ranges::equal_range(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
127 (void)std::ranges::includes(first, last, first2, last2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_projections.pass.cpp | 31 struct Less { struct
80 … (void)std::ranges::binary_search(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
81 (void)std::ranges::binary_search(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
82 (void)std::ranges::clamp(T(), T(), T(), Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
95 (void)std::ranges::equal_range(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
96 (void)std::ranges::equal_range(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
110 …(void)std::ranges::includes(first, last, first2, last2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
111 (void)std::ranges::includes(a, b, Less(), Proj(&copies), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
112 (void)std::ranges::is_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
113 (void)std::ranges::is_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | robust_against_copying_comparators.pass.cpp | 19 struct Less { struct
21 TEST_CONSTEXPR explicit Less(int *copies) : copies_(copies) {} in Less() argument
22 TEST_CONSTEXPR_CXX14 Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
23 TEST_CONSTEXPR_CXX14 Less& operator=(const Less&) = default;
112 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
114 (void)std::clamp(value, value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
122 (void)std::equal_range(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
133 (void)std::includes(first, last, first2, last2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
134 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
135 (void)std::is_heap_until(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /external/cronet/third_party/libc++/src/test/std/language.support/cmp/cmp.alg/ |
| D | weak_order.pass.cpp | 40 std::strong_ordering weak_order(const A&, const A&) { return std::strong_ordering::less; } in weak_order()
66 std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
75 explicit operator std::weak_ordering() const { return std::weak_ordering::less; } in operator std::weak_ordering()
91 assert(std::weak_order(a, std::move(a)) == std::weak_ordering::less); in test_1_2()
100 assert(std::weak_order(c1, c2) == std::weak_ordering::less); in test_1_2()
149 assert(std::weak_order(v[0], v[1]) == std::weak_ordering::less); in test_1_3()
150 assert(std::weak_order(v[0], v[2]) == std::weak_ordering::less); in test_1_3()
151 assert(std::weak_order(v[0], v[3]) == std::weak_ordering::less); in test_1_3()
152 assert(std::weak_order(v[0], v[4]) == std::weak_ordering::less); in test_1_3()
153 assert(std::weak_order(v[0], v[5]) == std::weak_ordering::less); in test_1_3()
[all …]
|
| D | compare_strong_order_fallback.pass.cpp | 44 std::strong_ordering strong_order(const A&, const A&) { return std::strong_ordering::less; } in strong_order()
70 std::strong_ordering strong_order(A&, A&&) { return std::strong_ordering::less; } in strong_order()
79 explicit operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
95 assert(std::compare_strong_order_fallback(a, std::move(a)) == std::strong_ordering::less); in test_1_2()
104 assert(std::compare_strong_order_fallback(c1, c2) == std::strong_ordering::less); in test_1_2()
150 assert(std::compare_strong_order_fallback(v[0], v[1]) == std::strong_ordering::less); in test_1_3()
151 assert(std::compare_strong_order_fallback(v[0], v[2]) == std::strong_ordering::less); in test_1_3()
152 assert(std::compare_strong_order_fallback(v[0], v[3]) == std::strong_ordering::less); in test_1_3()
153 assert(std::compare_strong_order_fallback(v[0], v[4]) == std::strong_ordering::less); in test_1_3()
154 assert(std::compare_strong_order_fallback(v[0], v[5]) == std::strong_ordering::less); in test_1_3()
[all …]
|
| D | strong_order.pass.cpp | 44 std::strong_ordering strong_order(const A&, const A&) { return std::strong_ordering::less; } in strong_order()
70 std::strong_ordering strong_order(A&, A&&) { return std::strong_ordering::less; } in strong_order()
79 explicit operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
95 assert(std::strong_order(a, std::move(a)) == std::strong_ordering::less); in test_1_2()
104 assert(std::strong_order(c1, c2) == std::strong_ordering::less); in test_1_2()
150 assert(std::strong_order(v[0], v[1]) == std::strong_ordering::less); in test_1_3()
151 assert(std::strong_order(v[0], v[2]) == std::strong_ordering::less); in test_1_3()
152 assert(std::strong_order(v[0], v[3]) == std::strong_ordering::less); in test_1_3()
153 assert(std::strong_order(v[0], v[4]) == std::strong_ordering::less); in test_1_3()
154 assert(std::strong_order(v[0], v[5]) == std::strong_ordering::less); in test_1_3()
[all …]
|
| D | compare_weak_order_fallback.pass.cpp | 40 std::strong_ordering weak_order(const A&, const A&) { return std::strong_ordering::less; } in weak_order()
66 std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
75 explicit operator std::weak_ordering() const { return std::weak_ordering::less; } in operator std::weak_ordering()
91 assert(std::compare_weak_order_fallback(a, std::move(a)) == std::weak_ordering::less); in test_1_2()
100 assert(std::compare_weak_order_fallback(c1, c2) == std::weak_ordering::less); in test_1_2()
149 assert(std::compare_weak_order_fallback(v[0], v[1]) == std::weak_ordering::less); in test_1_3()
150 assert(std::compare_weak_order_fallback(v[0], v[2]) == std::weak_ordering::less); in test_1_3()
151 assert(std::compare_weak_order_fallback(v[0], v[3]) == std::weak_ordering::less); in test_1_3()
152 assert(std::compare_weak_order_fallback(v[0], v[4]) == std::weak_ordering::less); in test_1_3()
153 assert(std::compare_weak_order_fallback(v[0], v[5]) == std::weak_ordering::less); in test_1_3()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/libtextclassifier/abseil-cpp/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/cronet/third_party/abseil-cpp/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/webrtc/third_party/abseil-cpp/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/types/ |
| D | compare_test.cc | 69 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 …]
|
| /external/cronet/third_party/libc++/src/test/std/language.support/cmp/compare.syn/ |
| D | named_functions.pass.cpp | 27 assert(!std::is_eq(std::strong_ordering::less)); in test()
30 assert(!std::is_eq(std::weak_ordering::less)); in test()
33 assert(!std::is_eq(std::partial_ordering::less)); in test()
38 assert( std::is_neq(std::strong_ordering::less)); in test()
41 assert( std::is_neq(std::weak_ordering::less)); in test()
44 assert( std::is_neq(std::partial_ordering::less)); in test()
49 assert( std::is_lt(std::strong_ordering::less)); in test()
52 assert( std::is_lt(std::weak_ordering::less)); in test()
55 assert( std::is_lt(std::partial_ordering::less)); in test()
60 assert( std::is_lteq(std::strong_ordering::less)); in test()
[all …]
|
| /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
| D | p5.cpp | 3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for …
4 alignas(1) alignas(2) int n2; // expected-error {{less than minimum alignment}}
6 alignas(1) alignas(2) alignas(0) int n4; // expected-error {{less than minimum alignment}}
9 alignas(1) int n7 alignas(2), // expected-error {{less than minimum alignment}}
12 alignas(1) extern int n10; // expected-error {{less than minimum alignment}}
14 enum alignas(1) E1 {}; // expected-error {{requested alignment is less than minimum alignment of 4 …
17 enum alignas(4) E4 { e4 = 1ull << 33 }; // expected-error {{requested alignment is less than minimu…
28 struct alignas(2) S2 { // expected-error {{requested alignment is less than minimum alignment of 4 …
31 struct alignas(2) S3 { // expected-error {{requested alignment is less than minimum alignment of 8 …
34 struct alignas(2) S4 : S1 { // expected-error {{requested alignment is less than minimum alignment …
[all …]
|
| /external/cronet/third_party/libc++/src/test/std/algorithms/ |
| D | robust_against_adl.compile.pass.cpp | 62 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
65 (void)std::clamp(value, value, value, std::less<void*>()); in all_the_algorithms()
80 (void)std::equal_range(first, last, value, std::less<void*>()); in all_the_algorithms()
95 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
97 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
99 (void)std::is_heap_until(first, last, std::less<void*>()); in all_the_algorithms()
108 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
110 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
112 // RELIES ON ADL SWAP (void)std::inplace_merge(first, mid, last, std::less<void*>()); in all_the_algorithms()
115 (void)std::lexicographical_compare(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
[all …]
|
| D | robust_re_difference_type.compile.pass.cpp | 94 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
97 (void)std::clamp(value, value, value, std::less<void*>()); in all_the_algorithms()
112 (void)std::equal_range(first, last, value, std::less<void*>()); in all_the_algorithms()
127 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
129 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
131 (void)std::is_heap_until(first, last, std::less<void*>()); in all_the_algorithms()
140 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
142 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
144 if (!TEST_IS_CONSTANT_EVALUATED) (void)std::inplace_merge(first, mid, last, std::less<void*>()); in all_the_algorithms()
147 (void)std::lexicographical_compare(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | cwise_op_less.cc | 19 REGISTER5(BinaryOp, CPU, "Less", functor::less, float, Eigen::half, double,
21 REGISTER7(BinaryOp, CPU, "Less", functor::less, uint8, uint16, uint32, uint64,
26 REGISTER9(BinaryOp, GPU, "Less", functor::less, float, Eigen::half, double,
28 REGISTER(BinaryOp, GPU, "Less", functor::less, int16);
34 REGISTER_KERNEL_BUILDER(Name("Less")
40 BinaryOp<CPUDevice, functor::less<int32>>);
42 REGISTER_KERNEL_BUILDER(Name("Less")
48 BinaryOp<CPUDevice, functor::less<int32>>);
|
| /external/pcre/maint/Unicode.tables/ |
| D | BidiMirroring.txt | 76 003C; 003E # LESS-THAN SIGN
119 2264; 2265 # LESS-THAN OR EQUAL TO
121 2266; 2267 # LESS-THAN OVER EQUAL TO
123 2268; 2269 # [BEST FIT] LESS-THAN BUT NOT EQUAL TO
125 226A; 226B # MUCH LESS-THAN
127 226E; 226F # [BEST FIT] NOT LESS-THAN
129 2270; 2271 # [BEST FIT] NEITHER LESS-THAN NOR EQUAL TO
131 2272; 2273 # [BEST FIT] LESS-THAN OR EQUIVALENT TO
133 2274; 2275 # [BEST FIT] NEITHER LESS-THAN NOR EQUIVALENT TO
135 2276; 2277 # LESS-THAN OR GREATER-THAN
[all …]
|