| /external/syzkaller/vendor/github.com/google/go-cmp/cmp/internal/value/ |
| D | sort.go | 38 func (vs valueSorter) Less(i, j int) bool { return isLess(vs[i], vs[j]) }
43 func isLess(x, y reflect.Value) bool { func
67 if isLess(x.Index(i), y.Index(i)) {
70 if isLess(y.Index(i), x.Index(i)) {
77 if isLess(x.Field(i), y.Field(i)) {
80 if isLess(y.Field(i), x.Field(i)) {
92 return isLess(x.Elem(), y.Elem())
|
| /external/libcxx/test/support/ |
| D | test_comparisons.h | 27 TEST_CONSTEXPR_CXX14 bool testComparisons6(const T& t1, const T& t2, bool isEqual, bool isLess) in testComparisons6() argument
44 else if (isLess) in testComparisons6()
83 const bool isLess = val1 < val2; in testComparisons6Values() local
85 return testComparisons6(T(val1), T(val2), isEqual, isLess); in testComparisons6Values()
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | ImmutableIntervalMap.h | 58 static bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
114 else if (ImutInfo::isLess(K, CurrentKey)) in Find()
131 if (ImutInfo::isLess(K, KCurrent)) in add_internal()
|
| D | ImmutableSet.h | 79 else if (ImutInfo::isLess(K,CurrentKey)) in find()
203 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
209 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
543 else if (ImutInfo::isLess(K,KCurrent)) in add_internal()
563 } else if (ImutInfo::isLess(K,KCurrent)) { in remove_internal()
888 static inline bool isLess(key_type_ref LHS, key_type_ref RHS) {
914 static inline bool isLess(key_type_ref LHS, key_type_ref RHS) {
|
| D | ImmutableMap.h | 44 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
45 return ImutContainerInfo<T>::isLess(L,R); in isLess()
|
| /external/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 79 else if (ImutInfo::isLess(K,CurrentKey)) in find()
203 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
209 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
546 else if (ImutInfo::isLess(K,KCurrent)) in add_internal()
566 } else if (ImutInfo::isLess(K,KCurrent)) { in remove_internal()
924 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
948 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
|
| D | ImmutableMap.h | 44 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
45 return ImutContainerInfo<T>::isLess(L,R); in isLess()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 81 else if (ImutInfo::isLess(K,CurrentKey)) in find()
205 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
211 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
548 else if (ImutInfo::isLess(K,KCurrent)) in add_internal()
568 } else if (ImutInfo::isLess(K,KCurrent)) { in remove_internal()
925 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
949 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
|
| D | ImmutableMap.h | 47 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
48 return ImutContainerInfo<T>::isLess(L,R); in isLess()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | RangeConstraintManager.cpp | 64 static inline bool isLess(key_type_ref lhs, key_type_ref rhs) { in isLess() function in __anon42e992be0111::RangeTrait
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 1019 bool isLess(Cost &Other, const TargetTransformInfo &TTI);
1408 bool Cost::isLess(Cost &Other, const TargetTransformInfo &TTI) { in isLess() function in Cost
4253 if (CostF.isLess(CostBest, TTI)) in FilterOutUndesirableDedicatedRegisters()
4509 return CostFA.isLess(CostFB, TTI); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4820 if (NewCost.isLess(SolutionCost, TTI)) { in SolveRecurse()
|