| /llvm-project-15.0.7/clang/lib/Tooling/ |
| H A D | FileMatchTrie.cpp | 104 StringRef findEquivalent(const PathComparator& Comparator, in findEquivalent() argument
114 Comparator.equivalent(StringRef(Path), FileName)) in findEquivalent()
124 Comparator, FileName, IsAmbiguous, in findEquivalent()
140 if (Comparator.equivalent(Child, FileName)) { in findEquivalent()
183 : Root(new FileMatchTrieNode), Comparator(new DefaultPathComparator()) {} in FileMatchTrie()
185 FileMatchTrie::FileMatchTrie(PathComparator *Comparator) in FileMatchTrie() argument
186 : Root(new FileMatchTrieNode), Comparator(Comparator) {} in FileMatchTrie()
203 StringRef Result = Root->findEquivalent(*Comparator, FileName, IsAmbiguous); in findEquivalent()
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 81 template <class RandomAccessIterator, class Comparator>
84 const Comparator &Comp) { in medianOf3()
93 template <class RandomAccessIterator, class Comparator>
95 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort()
119 template <class RandomAccessIterator, class Comparator>
121 const Comparator &Comp) { in parallel_sort()
183 class Comparator = std::less<
186 const Comparator &Comp = Comparator()) {
221 class Comparator = std::less<decltype(*std::begin(RangeTy()))>>
222 void parallelSort(RangeTy &&R, const Comparator &Comp = Comparator()) {
|
| /llvm-project-15.0.7/clang/include/clang/Tooling/ |
| H A D | FileMatchTrie.h | 63 FileMatchTrie(PathComparator* Comparator);
82 std::unique_ptr<PathComparator> Comparator; variable
|
| /llvm-project-15.0.7/flang/lib/Semantics/ |
| H A D | check-case.cpp | 32 cases_.sort(Comparator{}); in Check()
176 struct Comparator { struct in Fortran::semantics::CaseValues
190 if (++next != endIter && !Comparator{}(*iter, *next)) { in AreCasesDisjoint()
203 !Comparator{}(*p, *iter) && !Comparator{}(*iter, *p)) { in ReportConflictingCases()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/SPIRV/ |
| H A D | AtomicCompareExchange.ll | 15 ; CHECK-SPIRV: %[[#Comparator:]] = OpFunctionParameter %[[#]]
19 … %[[#MemSemEqual_SeqCst]] %[[#MemSemUnequal_Acquire]] %[[#Value]] %[[#Comparator]]
20 ; CHECK-SPIRV: %[[#Success:]] = OpIEqual %[[#]] %[[#Res]] %[[#Comparator]]
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachineFunctionSplitter.cpp | 145 auto Comparator = [](const MachineBasicBlock &X, const MachineBasicBlock &Y) { in runOnMachineFunction() local
148 llvm::sortBasicBlocksAndUpdateBranches(MF, Comparator); in runOnMachineFunction()
|
| H A D | BasicBlockSections.cpp | 365 auto Comparator = [&](const MachineBasicBlock &X, in runOnMachineFunction() local
379 sortBasicBlocksAndUpdateBranches(MF, Comparator); in runOnMachineFunction()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | set_symmetric_difference_comp.pass.cpp | 36 …_difference(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result), typename T::Comparator()); in test4()
45 …_difference(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result), typename T::Comparator()); in test4()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | set_union_comp.pass.cpp | 36 …::set_union(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result), typename T::Comparator()); in test4()
45 …::set_union(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result), typename T::Comparator()); in test4()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | set_intersection_comp.pass.cpp | 36 …ntersection(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result), typename T::Comparator()); in test4()
45 …ntersection(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result), typename T::Comparator()); in test4()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | set_difference_comp.pass.cpp | 36 …_difference(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result), typename T::Comparator()); in test4()
45 …_difference(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result), typename T::Comparator()); in test4()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | merge_comp.pass.cpp | 36 … std::merge(Iter1(a), Iter1(a+4), Iter2(b), Iter2(b+5), OutIter(result), typename T::Comparator()); in test4()
45 … std::merge(Iter1(b), Iter1(b+5), Iter2(a), Iter2(a+4), OutIter(result), typename T::Comparator()); in test4()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/ |
| H A D | sortable_helpers.h | 53 struct Comparator { struct
69 struct Comparator { struct
|
| /llvm-project-15.0.7/clang/test/SemaCXX/ |
| H A D | cxx0x-initializer-constructor.cpp | 232 template<int N, class Comparator> bool g(const string<N>& s, Comparator cmp) { in g()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | CFLAndersAliasAnalysis.cpp | 551 auto Comparator = [](OffsetValue LHS, OffsetValue RHS) { in mayAlias() local
555 assert(llvm::is_sorted(Itr->second, Comparator)); in mayAlias()
558 OffsetValue{RHS, 0}, Comparator); in mayAlias()
|
| /llvm-project-15.0.7/llvm/lib/Target/Mips/MCTargetDesc/ |
| H A D | MipsELFObjectWriter.cpp | 110 template <class InputIt, class UnaryPredicate, class Comparator>
112 Comparator BetterThan) { in find_best()
|
| /llvm-project-15.0.7/libcxx/docs/DesignDocs/ |
| H A D | DebugMode.rst | 30 Comparator consistency checks
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTraverse.h | 310 class Comparator {
327 class EqualsComparator : public Comparator<EqualsComparator> {
361 class MatchComparator : public Comparator<MatchComparator> {
|
| /llvm-project-15.0.7/mlir/include/mlir/Dialect/SPIRV/IR/ |
| H A D | SPIRVAtomicOps.td | 106 2) get a New Value from Value only if Original Value equals Comparator,
110 equaled Comparator.
126 must also match the type of Comparator.
|
| /llvm-project-15.0.7/llvm/utils/unittest/googlemock/include/gmock/ |
| H A D | gmock-matchers.h | 2170 template <typename Comparator, typename ContainerMatcher>
2173 WhenSortedByMatcher(const Comparator& comparator,
2194 Impl(const Comparator& comparator, const ContainerMatcher& matcher)
2233 const Comparator comparator_;
2240 const Comparator comparator_;
4072 template <typename Comparator, typename ContainerMatcher>
4073 inline internal::WhenSortedByMatcher<Comparator, ContainerMatcher>
4074 WhenSortedBy(const Comparator& comparator,
4076 return internal::WhenSortedByMatcher<Comparator, ContainerMatcher>(
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | GlobalISelEmitter.cpp | 1998 AOComparator Comparator; member in __anoncee47b830111::AtomicOrderingMMOPredicateMatcher
2002 AOComparator Comparator = AO_Exactly) in AtomicOrderingMMOPredicateMatcher() argument
2004 Order(Order), Comparator(Comparator) {} in AtomicOrderingMMOPredicateMatcher()
2014 return Order == R.Order && Comparator == R.Comparator; in isIdentical()
2021 if (Comparator == AO_OrStronger) in emitPredicateOpcodes()
2023 if (Comparator == AO_WeakerThan) in emitPredicateOpcodes()
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | AttrTypeBase.td | 301 // Comparator used to compare two instances for equality. By default, it uses
|
| /llvm-project-15.0.7/mlir/lib/Rewrite/ |
| H A D | ByteCode.cpp | 1194 template <typename T, typename RangeT, typename Comparator = std::equal_to<T>>
1195 void handleSwitch(const T &value, RangeT &&cases, Comparator cmp = {}) { in handleSwitch()
|
| /llvm-project-15.0.7/clang/lib/Sema/ |
| H A D | SemaLookup.cpp | 76 struct Comparator { struct in __anon5c0384df0111::UnqualUsingEntry
192 void done() { llvm::sort(list, UnqualUsingEntry::Comparator()); } in done()
203 UnqualUsingEntry::Comparator())); in getNamespacesFor()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | __tree | 1787 "Comparator must be copy-constructible.");
|