| /external/tensorflow/tensorflow/compiler/xla/ |
| D | comparison_util.cc | 24 case Comparison::Direction::kEq: in ComparisonDirectionToString()
45 {"EQ", Comparison::Direction::kEq}, in StringToComparisonDirection()
137 case Direction::kEq: in IsReflexive()
155 case Direction::kEq: in IsAntireflexive()
165 case Comparison::Direction::kEq: in Converse()
166 return Comparison::Direction::kEq; in Converse()
183 case Direction::kEq: in Inverse()
186 return Direction::kEq; in Inverse()
|
| D | comparison_util.h | 39 kEq, enumerator
54 inline bool IsEq() const { return dir_ == Direction::kEq; } in IsEq()
87 case Direction::kEq: in GetComparator()
|
| /external/perfetto/src/trace_processor/dynamic/ |
| D | experimental_slice_layout_generator_unittest.cc | 107 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1")}}, {}); in TEST()
125 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1")}}, {}); in TEST()
148 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1")}}, {}); in TEST()
178 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1,2")}}, {}); in TEST()
213 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1,2")}}, {}); in TEST()
245 {Constraint{kColumn, FilterOp::kEq, SqlValue::String("1,2")}}, {}); in TEST()
|
| D | experimental_flamegraph_generator.cc | 36 c.op == FilterOp::kEq; in GetFlamegraphInputValues()
40 c.op == FilterOp::kEq; in GetFlamegraphInputValues()
44 c.op == FilterOp::kEq; in GetFlamegraphInputValues()
48 c.op == FilterOp::kEq; in GetFlamegraphInputValues()
|
| D | describe_slice_generator.cc | 33 c.op == FilterOp::kEq; in GetDescribeSliceInputValues()
|
| D | descendant_slice_generator.cc | 56 return c.col_idx == slice.GetColumnCount() && c.op == FilterOp::kEq; in ComputeTable()
|
| D | ancestor_generator.cc | 107 return c.col_idx == column && c.op == FilterOp::kEq; in ComputeTable()
|
| D | connected_flow_generator.cc | 206 return c.col_idx == flow.GetColumnCount() && c.op == FilterOp::kEq; in ComputeTable()
|
| D | experimental_annotated_stack_generator.cc | 132 return c.col_idx == constraint_col && c.op == FilterOp::kEq; in ComputeTable()
|
| D | experimental_slice_layout_generator.cc | 83 bool is_equal = c.op == FilterOp::kEq; in ComputeTable()
|
| /external/perfetto/src/trace_processor/db/ |
| D | column.h | 49 kEq, enumerator
278 if (IsId() && op == FilterOp::kEq) { in FilterInto()
364 return Constraint{col_idx_in_table_, FilterOp::kEq, value}; in eq_value()
492 case FilterOp::kEq: { in FilterIntoSorted()
|
| D | column.cc | 220 case FilterOp::kEq: in FilterIntoNumericWithComparatorSlow()
305 case FilterOp::kEq: in FilterIntoStringSlow()
365 case FilterOp::kEq: in FilterIntoIdSlow()
|
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| D | cusolver_rewriter.cc | 110 info, zeros, ComparisonDirection::kEq)); in CreateCholesky()
|
| /external/deqp-deps/amber/src/ |
| D | executor.cc | 169 case CompareBufferCommand::Comparator::kEq: in ExecuteCommand()
|
| D | command.h | 269 enum class Comparator { kEq, kRmse, kHistogramEmd }; enumerator
289 Comparator comparator_ = Comparator::kEq;
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | stable_sort_expander.cc | 184 scalar_pred, old_root, cloned_root, ComparisonDirection::kEq)); in ExpandInstruction()
|
| D | stable_sort_expander_test.cc | 69 ASSERT_EQ(root->operand(0)->comparison_direction(), ComparisonDirection::kEq); in CheckComputationHasTieBreaker()
|
| D | flatten_call_graph_test.cc | 164 ComparisonDirection::kEq)); in TEST_F()
|
| D | hlo_matchers_test.cc | 243 ComparisonDirection::kEq); in TEST_F()
|
| /external/perfetto/src/trace_processor/sqlite/ |
| D | db_sqlite_table.cc | 33 return FilterOp::kEq; in SqliteOpToFilterOp()
459 case FilterOp::kEq: in Filter()
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | btree.h | 410 enum class MatchKind : uint8_t { kEq, kNe };
418 bool IsEq() const { return match == MatchKind::kEq; }
730 return {s, MatchKind::kEq};
775 exact_match = MatchKind::kEq;
789 return {mid, MatchKind::kEq};
2486 return {iter, MatchKind::kEq};
2520 if (res.IsEq()) return {iter, MatchKind::kEq};
2521 return {internal_last(iter), seen_eq ? MatchKind::kEq : MatchKind::kNe};
|
| /external/abseil-cpp/absl/container/internal/ |
| D | btree.h | 339 enum class MatchKind : uint8_t { kEq, kNe };
347 bool IsEq() const { return match == MatchKind::kEq; }
648 return {s, MatchKind::kEq};
693 exact_match = MatchKind::kEq;
707 return {mid, MatchKind::kEq};
2514 if (res.match == MatchKind::kEq) {
2515 return {iter, MatchKind::kEq};
|
| /external/webrtc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 339 enum class MatchKind : uint8_t { kEq, kNe };
347 bool IsEq() const { return match == MatchKind::kEq; }
648 return {s, MatchKind::kEq};
693 exact_match = MatchKind::kEq;
707 return {mid, MatchKind::kEq};
2514 if (res.match == MatchKind::kEq) {
2515 return {iter, MatchKind::kEq};
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 378 enum class MatchKind : uint8_t { kEq, kNe };
386 bool IsEq() const { return match == MatchKind::kEq; }
687 return {s, MatchKind::kEq};
732 exact_match = MatchKind::kEq;
746 return {mid, MatchKind::kEq};
2536 if (res.match == MatchKind::kEq) {
2537 return {iter, MatchKind::kEq};
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | btree.h | 378 enum class MatchKind : uint8_t { kEq, kNe };
386 bool IsEq() const { return match == MatchKind::kEq; }
687 return {s, MatchKind::kEq};
732 exact_match = MatchKind::kEq;
746 return {mid, MatchKind::kEq};
2536 if (res.match == MatchKind::kEq) {
2537 return {iter, MatchKind::kEq};
|