Home
last modified time | relevance | path

Searched refs:Less (Results 1 – 25 of 87) sorted by relevance

1234

/llvm-project/libcxx/test/libcxx/algorithms/
H A Dranges_robust_against_copying_comparators.pass.cpp23 struct Less {
25 constexpr explicit Less(int *copies) : copies_(copies) {} in Less() argument
26 constexpr Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; }
27 constexpr Less& operator=(const Less&) = default; in operator ()() argument
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( in all_the_algorithms()
22 struct Less { global() struct
24 LessLess Less() argument
[all...]
H A Drobust_against_copying_comparators.pass.cpp20 struct Less {
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; }
24 TEST_CONSTEXPR_CXX14 Less& operator=(const Less&) = default; in operator ()() argument
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< in all_the_algorithms()
19 struct Less { global() struct
21 LessLess Less() argument
[all...]
H A Dranges_robust_against_copying_projections.pass.cpp33 struct Less { in operator ()() argument
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)); assert(copies == 0); 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(), Pro in all_the_algorithms()
32 struct Less { global() struct
[all...]
/llvm-project/flang/include/flang/Evaluate/
H A Dcommon.h41 ENUM_CLASS(Ordering, Less, Equal, Greater) in ENUM_CLASS()
42 ENUM_CLASS(Relation, Less, Equal, Greater, Unordered) in ENUM_CLASS()
47 return Ordering::Less; in ENUM_CLASS()
67 return Ordering::Less; in Compare()
76 if (ordering == Ordering::Less) { in Reverse()
79 return Ordering::Less; in Reverse()
86 if (ordering == Ordering::Less) { in RelationFromOrdering()
87 return Relation::Less; in RelationFromOrdering()
96 if (relation == Relation::Less) { in Reverse()
99 return Relation::Less; in Reverse()
38 ENUM_CLASS(Ordering,Less,Equal,Greater) ENUM_CLASS() argument
[all...]
H A Dinteger.h193 return CompareSigned(that) == Ordering::Less;
205 return CompareSigned(that) != Ordering::Less;
394 return Ordering::Less; in CompareToZeroSigned()
456 return Ordering::Less;
463 return CompareUnsigned(y) != Ordering::Less; in BLE()
474 return isNegative ? Ordering::Less : Ordering::Greater; in ToUInt()
757 if (CompareSigned(y) == Ordering::Less) { in MAX()
765 if (CompareSigned(y) == Ordering::Less) { in MIN()
900 bool nextBit{remainder.CompareUnsigned(divisor) != Ordering::Less}; in MultiplyUnsigned()
916 if (divisorOrdering == Ordering::Less) { in MultiplyUnsigned()
[all...]
/llvm-project/clang/include/clang/Basic/
H A DThunk.h63 bool Less(const VirtualAdjustment &RHS) const { in Less() function
87 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
130 bool Less(const VirtualAdjustment &RHS) const { in Less() function
151 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
/llvm-project/libcxx/test/std/iterators/predef.iterators/counted.iterator/
H A Dthree_way_compare.pass.cpp50 auto& Less = std::strong_ordering::less; in test() local
62 assert((iter2 <=> iter1) == Less); in test()
72 assert((iter2 <=> iter1) == Less); in test()
/llvm-project/libc/benchmarks/automemcpy/lib/
H A DResultAnalyzerMain.cpp
/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DSTLAlgorithmModeling.cpp173 SVal Less = SVB.evalBinOp(StateFound, BO_LT, in Find() local
177 assert(isa<DefinedSVal>(Less) && in Find()
179 StateFound = StateFound->assume(Less.castAs<DefinedSVal>(), true); in Find()
/llvm-project/flang/lib/Evaluate/
H A Dreal.cpp25 return y.IsNegative() ? Relation::Equal : Relation::Less; in Compare()
30 return IsNegative() ? Relation::Less : Relation::Greater; in Compare()
33 return y.IsNegative() ? Relation::Greater : Relation::Less; in Compare()
40 return isNegative ? Relation::Less : Relation::Greater; in Compare()
94 if (order == Ordering::Less) { in Add()
314 if (cmp == Ordering::Less) { in SQRT()
388 } else if (ABS().Compare(y.ABS()) == Relation::Less) { in HYPOT()
434 result.value.Compare(pAbs) != Relation::Less; in MOD()
436 if (result.value.Compare(adj) != Relation::Less) { in MOD()
/llvm-project/flang/unittests/Evaluate/
H A Dinteger.cpp104 ord = Ordering::Less; in exhaustiveTesting()
144 ord = Ordering::Less; in exhaustiveTesting()
156 ord = Ordering::Less; in exhaustiveTesting()
245 TEST(Reverse(Ordering::Less) == Ordering::Greater); in main()
246 TEST(Reverse(Ordering::Greater) == Ordering::Less); in main()
/llvm-project/clang/include/clang/AST/
H A DComparisonCategories.h70 Less, enumerator
163 return getValueInfo(ComparisonCategoryResult::Less); in getLess()
/llvm-project/llvm/utils/TableGen/Basic/
H A DSequenceToOffsetTable.h45 /// @tparam Less A stable comparator for SeqT elements.
46 template <typename SeqT, typename Less = std::less<typename SeqT::value_type>>
53 Less L;
/llvm-project/libcxx/test/std/language.support/cmp/cmp.weakord/
H A Dweakord.pass.cpp83 auto& Less = std::weak_ordering::less; in test_constexpr() local
93 {Less, false, true, true, false}, in test_constexpr()
/llvm-project/clang/lib/AST/Interp/
H A DPrimitives.h
H A DIntegralAP.h
/llvm-project/libcxx/test/std/language.support/cmp/cmp.partialord/
H A Dpartialord.pass.cpp63 auto& Less = std::partial_ordering::less; in test_constexpr() local
74 {Less, false, true, true, false}, in test_constexpr()
/llvm-project/clang/lib/AST/
H A DComparisonCategories.cpp192 case CCVT::Less: in getResultString()
210 Values.push_back(CCR::Less); in getPossibleResultsForType()
/llvm-project/libcxx/test/std/language.support/cmp/cmp.strongord/
H A Dstrongord.pass.cpp103 auto& Less = std::strong_ordering::less; in test_constexpr() local
114 {Less, false, true, true, false}, in test_constexpr()
/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUTargetMachine.cpp1086 if (isPassEnabled(EnableVOPD, CodeGenOptLevel::Less)) in addIRPasses()
1204 (TM.getOptLevel() >= CodeGenOptLevel::Less) && in addPreISel()
1233 if (TM.getOptLevel() > CodeGenOptLevel::Less) in addMachineSSAOptimization()
1377 if (TM->getOptLevel() > CodeGenOptLevel::Less) in createSGPRAllocPass()
1509 if (TM->getOptLevel() > CodeGenOptLevel::Less) in registerMachineRegisterInfoCallback()
1656 if (isPassEnabled(EnableVOPD, CodeGenOptLevel::Less)) in parseMachineFunctionInfo()
1667 if (isPassEnabled(EnableSetWavePriority, CodeGenOptLevel::Less)) in parseMachineFunctionInfo()
1681 if (isPassEnabled(EnableInsertDelayAlu, CodeGenOptLevel::Less)) in parseMachineFunctionInfo()
1970 if (TM.getOptLevel() >= CodeGenOptLevel::Less &&
2073 if (TM.getOptLevel() > CodeGenOptLevel::Less)
[all...]
/llvm-project/llvm/test/MC/RISCV/
H A Drv32zbkc-invalid.s9 …CK: :[[@LINE]]:1: error: instruction requires the following: 'Zbc' (Carry-Less Multiplication){{$}}
/llvm-project/clang/lib/Parse/
H A DParseTemplate.cpp1722 bool Parser::diagnoseUnknownTemplateId(ExprResult LHS, SourceLocation Less) {
1730 ParseGreaterThanInTemplateList(Less, Greater, true, false); in diagnoseUnknownTemplateId()
1732 Less, Greater); in diagnoseUnknownTemplateId()
1757 SourceLocation Less = ConsumeToken(); in checkPotentialAngleBracket()
1759 ParseGreaterThanInTemplateList(Less, Greater, true, false); in checkPotentialAngleBracket()
1761 getCurScope(), PotentialTemplateName, Less, Greater); in checkPotentialAngleBracket()
1772 SourceLocation Less = ConsumeToken(); in checkPotentialAngleBracket()
1774 diagnoseUnknownTemplateId(PotentialTemplateName, Less)) { in checkPotentialAngleBracket()
1727 diagnoseUnknownTemplateId(ExprResult LHS,SourceLocation Less) diagnoseUnknownTemplateId() argument
1762 SourceLocation Less = ConsumeToken(); checkPotentialAngleBracket() local
1777 SourceLocation Less = ConsumeToken(); checkPotentialAngleBracket() local
/llvm-project/llvm/include/llvm/Support/
H A DCodeGen.h56 Less = 1, ///< -O1 enumerator
/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DJITTargetMachineBuilder.cpp130 case CodeGenOptLevel::Less: in print()
131 OS << "Less"; in print()
/llvm-project/libcxx/benchmarks/
H A Dstring.bench.cpp

1234