| /external/cronet/stable/third_party/libc++/src/test/libcxx/algorithms/ |
| D | ranges_robust_against_copying_comparators.pass.cpp | 23 struct Less { struct
25 constexpr explicit Less(int *copies) : copies_(copies) {} in Less() argument
26 constexpr Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
27 constexpr Less& operator=(const Less&) = default;
100 (void)std::ranges::binary_search(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
101 (void)std::ranges::binary_search(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
102 (void)std::ranges::clamp(value, value, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
113 (void)std::ranges::equal_range(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
114 (void)std::ranges::equal_range(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
139 (void)std::ranges::includes(first, last, first2, last2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | robust_against_copying_comparators.pass.cpp | 20 struct Less { struct
22 TEST_CONSTEXPR explicit Less(int *copies) : copies_(copies) {} in Less() argument
23 TEST_CONSTEXPR_CXX14 Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
24 TEST_CONSTEXPR_CXX14 Less& operator=(const Less&) = default;
113 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
115 (void)std::clamp(value, value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::equal_range(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
134 (void)std::includes(first, last, first2, last2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
135 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
136 (void)std::is_heap_until(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_projections.pass.cpp | 33 struct Less { struct
82 … (void)std::ranges::binary_search(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
83 (void)std::ranges::binary_search(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
84 (void)std::ranges::clamp(T(), T(), T(), Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
107 (void)std::ranges::equal_range(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
108 (void)std::ranges::equal_range(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
136 …(void)std::ranges::includes(first, last, first2, last2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
137 (void)std::ranges::includes(a, b, Less(), Proj(&copies), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
138 (void)std::ranges::is_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
139 (void)std::ranges::is_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/libcxx/algorithms/ |
| D | ranges_robust_against_copying_comparators.pass.cpp | 23 struct Less { struct
25 constexpr explicit Less(int *copies) : copies_(copies) {} in Less() function
26 constexpr Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
27 constexpr Less& operator=(const Less&) = default;
100 (void)std::ranges::binary_search(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
101 (void)std::ranges::binary_search(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
102 (void)std::ranges::clamp(value, value, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
113 (void)std::ranges::equal_range(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
114 (void)std::ranges::equal_range(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
139 (void)std::ranges::includes(first, last, first2, last2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | robust_against_copying_comparators.pass.cpp | 20 struct Less { struct
22 TEST_CONSTEXPR explicit Less(int *copies) : copies_(copies) {} in Less() argument
23 TEST_CONSTEXPR_CXX14 Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() function
24 TEST_CONSTEXPR_CXX14 Less& operator=(const Less&) = default;
113 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
115 (void)std::clamp(value, value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::equal_range(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
134 (void)std::includes(first, last, first2, last2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
135 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
136 (void)std::is_heap_until(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_projections.pass.cpp | 33 struct Less { struct
82 … (void)std::ranges::binary_search(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
83 (void)std::ranges::binary_search(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
84 (void)std::ranges::clamp(T(), T(), T(), Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
107 (void)std::ranges::equal_range(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
108 (void)std::ranges::equal_range(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
136 …(void)std::ranges::includes(first, last, first2, last2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
137 (void)std::ranges::includes(a, b, Less(), Proj(&copies), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
138 (void)std::ranges::is_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
139 (void)std::ranges::is_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/mlir_generated/ |
| D | gpu_op_less.cc | 23 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_HALF, DT_BOOL);
24 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_FLOAT, DT_BOOL);
25 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_DOUBLE, DT_BOOL);
26 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_INT8, DT_BOOL);
27 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_INT16, DT_BOOL);
29 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_INT64, DT_BOOL);
30 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_UINT8, DT_BOOL);
31 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_UINT16, DT_BOOL);
32 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_UINT32, DT_BOOL);
33 GENERATE_AND_REGISTER_BINARY_GPU_KERNEL2(Less, DT_UINT64, DT_BOOL);
|
| /external/deqp-deps/glslang/Test/baseResults/ |
| D | loops.frag.out | 21 0:59 Compare Less Than ( temp bool)
40 0:63 Compare Less Than ( temp bool)
67 0:73 Compare Less Than ( temp bool)
80 0:78 Compare Less Than ( temp bool)
93 0:80 Compare Less Than ( temp bool)
106 0:87 Compare Less Than ( temp bool)
120 0:92 Compare Less Than ( temp bool)
126 0:92 Compare Less Than ( temp bool)
139 0:97 Compare Less Than ( temp bool)
152 0:99 Compare Less Than ( temp bool)
[all …]
|
| D | loopsArtificial.frag.out | 15 0:71 Compare Less Than ( temp bool)
28 0:60 Compare Less Than ( temp bool)
45 0:62 Compare Less Than ( temp bool)
61 0:67 Compare Less Than ( temp bool)
83 0:74 Compare Less Than ( temp bool)
93 0:75 Compare Less Than ( temp bool)
110 0:81 Compare Less Than ( temp bool)
127 0:83 Compare Less Than ( temp bool)
143 0:88 Compare Less Than ( temp bool)
232 0:71 Compare Less Than ( temp bool)
[all …]
|
| /external/angle/third_party/glslang/src/Test/baseResults/ |
| D | loops.frag.out | 21 0:59 Compare Less Than ( temp bool)
40 0:63 Compare Less Than ( temp bool)
67 0:73 Compare Less Than ( temp bool)
80 0:78 Compare Less Than ( temp bool)
93 0:80 Compare Less Than ( temp bool)
106 0:87 Compare Less Than ( temp bool)
120 0:92 Compare Less Than ( temp bool)
126 0:92 Compare Less Than ( temp bool)
139 0:97 Compare Less Than ( temp bool)
152 0:99 Compare Less Than ( temp bool)
[all …]
|
| D | loopsArtificial.frag.out | 15 0:71 Compare Less Than ( temp bool)
28 0:60 Compare Less Than ( temp bool)
45 0:62 Compare Less Than ( temp bool)
61 0:67 Compare Less Than ( temp bool)
83 0:74 Compare Less Than ( temp bool)
93 0:75 Compare Less Than ( temp bool)
110 0:81 Compare Less Than ( temp bool)
127 0:83 Compare Less Than ( temp bool)
143 0:88 Compare Less Than ( temp bool)
232 0:71 Compare Less Than ( temp bool)
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/costs/graph_properties_testdata/ |
| D | function_switch.pbtxt | 29 name: "Less/x"
50 name: "Less/y"
71 name: "Less"
72 op: "Less"
73 input: "Less/x"
74 input: "Less/y"
85 input: "Less"
86 input: "Less"
119 input: "Less"
|
| D | function_switch_2.pbtxt | 29 name: "Less/x"
50 name: "Less/y"
71 name: "Less"
72 op: "Less"
73 input: "Less/x"
74 input: "Less/y"
85 input: "Less"
86 input: "Less"
119 input: "Less"
|
| D | function_switch_shapes.pbtxt | 29 name: "Less/x"
50 name: "Less/y"
71 name: "Less"
72 op: "Less"
73 input: "Less/x"
74 input: "Less/y"
85 input: "Less"
86 input: "Less"
119 input: "Less"
|
| /external/sdv/vsomeip/third_party/boost/icl/test/cmp_clang_ttp_passing_/ |
| D | cmp_clang_ttp_passing.cpp | 21 template<class>class Less = sep::less
26 typedef interv<T,Less> type;
32 template<class>class Less = sep::less,
33 class I = typename sep::interv<T,Less>::type
|
| /external/cronet/stable/third_party/rust/chromium_crates_io/vendor/semver-1.0.23/src/ |
| D | impls.rs | 58 false if rhs.is_empty() => return Ordering::Less, in cmp()
86 (true, false) => return Ordering::Less, in cmp()
101 Ordering::Less in cmp()
130 (true, false) => return Ordering::Less, in cmp()
143 Ordering::Less in cmp()
|
| /external/cronet/tot/third_party/rust/chromium_crates_io/vendor/semver-1.0.23/src/ |
| D | impls.rs | 58 false if rhs.is_empty() => return Ordering::Less, in cmp()
86 (true, false) => return Ordering::Less, in cmp()
101 Ordering::Less in cmp()
130 (true, false) => return Ordering::Less, in cmp()
143 Ordering::Less in cmp()
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/tests/ |
| D | legalize_tfg_with_control_flow.mlir | 17 …%Const_3, %ctl_4 = Const [%ctl_2] name("while/Less/y") {dtype = i32, value = dense<10> : tensor<i3…
18 …%Less, %ctl_5 = Less(%Merge#0, %Const_3) name("while/Less") {T = i32} : (tensor<*xi32>, tensor<i32…
19 %LoopCond, %ctl_6 = LoopCond(%Less) name("while/LoopCond") : (tensor<*xi1>) -> (tensor<*xi1>)
|
| D | legalize_tfg_arg_control_dep.mlir | 16 …%Less, %ctl_5 = Less(%Merge#0, %Const) [%arg.ctl] name("while/Less") {T = i32} : (tensor<*xi32>, t…
17 …%LoopCond, %ctl_6 = LoopCond(%Less) [%arg.ctl] name("while/LoopCond") : (tensor<*xi1>) -> (tensor<…
|
| /external/tensorflow/tensorflow/core/ir/importexport/tests/roundtrip/ |
| D | graph-while-loop.pbtxt | 70 name: "while/Less/y"
92 name: "while/Less"
93 op: "Less"
95 input: "while/Less/y"
106 input: "while/Less"
|
| /external/rust/android-crates-io/crates/semver/src/ |
| D | impls.rs | 61 false if rhs.is_empty() => return Ordering::Less, in cmp()
89 (true, false) => return Ordering::Less, in cmp()
104 Ordering::Less in cmp()
137 (true, false) => return Ordering::Less, in cmp()
150 Ordering::Less in cmp()
|
| /external/rust/android-crates-io/crates/coset/src/common/ |
| D | tests.rs | 85 assert_eq!(value_cmp, Ordering::Less, "{:?} < {:?}", left, right); in test_label_sort()
88 Some(Ordering::Less), in test_label_sort()
95 Ordering::Less, in test_label_sort()
139 Ordering::Less, in test_label_canonical_sort()
149 Ordering::Less, in test_label_canonical_sort()
159 Ordering::Less, in test_label_canonical_sort()
231 assert_eq!(value_cmp, Ordering::Less, "{:?} < {:?}", left, right); in test_registered_label_sort()
234 Some(Ordering::Less), in test_registered_label_sort()
241 Ordering::Less, in test_registered_label_sort()
341 assert_eq!(value_cmp, Ordering::Less, "{:?} < {:?}", left, right); in test_registered_label_with_private_sort()
[all …]
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/tests/graphdef2mlir/ |
| D | graph-while-loop.pbtxt | 81 name: "while/Less/y"
103 name: "while/Less"
104 op: "Less"
106 input: "while/Less/y"
117 input: "while/Less"
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | Less.pbtxt | 2 name: "Less"
34 name: "Less"
68 name: "Less"
103 name: "Less"
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v2/ |
| D | Less.pbtxt | 2 name: "Less"
34 name: "Less"
68 name: "Less"
103 name: "Less"
|