Home
last modified time | relevance | path

Searched refs:Comp (Results 1 – 25 of 92) sorted by relevance

1234

/llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/
H A Ddeduct.pass.cpp108 typedef std::greater<T> Comp; in main() typedef
116 Comp comp; in main()
123 Comp comp; in main()
130 Comp comp; in main()
137 Comp comp; in main()
147 typedef std::greater<T> Comp; in main() typedef
155 std::priority_queue<T, Cont, Comp> source; in main()
161 std::priority_queue<T, Cont, Comp> source; in main()
167 std::priority_queue<T, Cont, Comp> source; in main()
173 std::priority_queue<T, Cont, Comp> source; in main()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DGCNVOPDUtils.cpp74 for (ComponentInfo &Comp : CInfo) { in checkVOPDRegConstraints()
75 switch (Comp.MI.getOpcode()) { in checkVOPDRegConstraints()
78 addLiteral(Comp.MI.getOperand(2)); in checkVOPDRegConstraints()
79 Comp.Reg2 = Comp.MI.getOperand(3).getReg(); in checkVOPDRegConstraints()
84 Comp.Reg1 = Comp.MI.getOperand(2).getReg(); in checkVOPDRegConstraints()
89 Comp.Reg1 = Comp.MI.getOperand(2).getReg(); in checkVOPDRegConstraints()
90 Comp.Reg2 = Comp.MI.getOperand(0).getReg(); in checkVOPDRegConstraints()
94 Comp.Reg1 = Comp.MI.getOperand(2).getReg(); in checkVOPDRegConstraints()
99 Comp.Reg1 = Comp.MI.getOperand(2).getReg(); in checkVOPDRegConstraints()
103 Comp.Dst = Comp.MI.getOperand(0).getReg(); in checkVOPDRegConstraints()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DParallel.h86 return Comp(*Start, *(End - 1)) in medianOf3()
87 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3()
89 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3()
98 llvm::sort(Start, End, Comp); in parallel_quick_sort()
103 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort()
107 return Comp(V, *(End - 1)); in parallel_quick_sort()
113 TG.spawn([=, &Comp, &TG] { in parallel_quick_sort()
121 const Comparator &Comp) { in parallel_sort() argument
123 parallel_quick_sort(Start, End, Comp, TG, in parallel_sort()
193 llvm::sort(Start, End, Comp);
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.cons/
H A Dcompare_copy_constructible.compile.fail.cpp17 struct Comp { struct
20 Comp () {} in Comp() argument
22 Comp (const Comp &); // declared but not defined
27 std::multimap<int, int, Comp<int> > m; in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/set.cons/
H A Dcompare_copy_constructible.compile.fail.cpp17 struct Comp { struct
20 Comp () {} in Comp() argument
22 Comp (const Comp &); // declared but not defined
27 std::set<int, Comp<int> > m; in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.cons/
H A Dcompare_copy_constructible.compile.fail.cpp17 struct Comp { struct
20 Comp () {} in Comp() argument
22 Comp (const Comp &); // declared but not defined
27 std::map<int, int, Comp<int> > m; in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/multiset.cons/
H A Dcompare_copy_constructible.compile.fail.cpp17 struct Comp { struct
20 Comp () {} in Comp() argument
22 Comp (const Comp &); // declared but not defined
27 std::multiset<int, Comp<int> > m; in main()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/
H A Dcompare_copy_constructible.compile.fail.cpp20 struct Comp { struct
23 Comp () {} in Comp() argument
25 Comp (const Comp &); // declared but not defined
30 std::unordered_multimap<int, int, std::hash<int>, Comp<int> > m; in main()
H A Dallocator.pass.cpp91 typedef test_equal_to<T> Comp; in main() typedef
92 typedef std::unordered_multimap<T, T, HF, Comp, A> C; in main()
98 assert(c.key_eq() == Comp()); in main()
110 typedef test_equal_to<T> Comp; in main() typedef
111 typedef std::unordered_multimap<T, T, HF, Comp, A> C; in main()
119 assert(c.key_eq() == Comp()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/
H A Dcompare_copy_constructible.compile.fail.cpp18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::unordered_set<int, std::hash<int>, Comp<int> > m; in main()
H A Dallocator.pass.cpp68 typedef test_equal_to<T> Comp; in main() typedef
70 typedef std::unordered_set<T, HF, Comp, A> C; in main()
76 assert(c.key_eq() == Comp ()); in main()
88 typedef test_equal_to<T> Comp; in main() typedef
90 typedef std::unordered_set<T, HF, Comp, A> C; in main()
98 assert(c.key_eq() == Comp ()); in main()
H A Dinit.pass.cpp97 typedef test_equal_to<T> Comp; in main() typedef
99 typedef std::unordered_set<T, HF, Comp, A> C; in main()
118 assert(c.key_eq() == Comp()); in main()
130 typedef test_equal_to<T> Comp; in main() typedef
132 typedef std::unordered_set<T, HF, Comp, A> C; in main()
153 assert(c.key_eq() == Comp()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
H A Dcompare_copy_constructible.compile.fail.cpp20 struct Comp { struct
23 Comp () {} in Comp() argument
25 Comp (const Comp &); // declared but not defined
30 std::unordered_map<int, int, std::hash<int>, Comp<int> > m; in main()
H A Dallocator.pass.cpp91 typedef test_equal_to<T> Comp; in main() typedef
92 typedef std::unordered_map<T, T, HF, Comp, A> C; in main()
98 assert(c.key_eq() == Comp()); in main()
110 typedef test_equal_to<T> Comp; in main() typedef
111 typedef std::unordered_map<T, T, HF, Comp, A> C; in main()
119 assert(c.key_eq() == Comp()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Dcompare_copy_constructible.compile.fail.cpp18 struct Comp { struct
21 Comp () {} in Comp() argument
23 Comp (const Comp &); // declared but not defined
28 std::unordered_multiset<int, std::hash<int>, Comp<int> > m; in main()
H A Dallocator.pass.cpp68 typedef test_equal_to<T> Comp; in main() typedef
70 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
76 assert(c.key_eq() == Comp ()); in main()
88 typedef test_equal_to<T> Comp; in main() typedef
90 typedef std::unordered_multiset<T, HF, Comp, A> C; in main()
98 assert(c.key_eq() == Comp ()); in main()
/llvm-project-15.0.7/libcxx/include/
H A Dalgorithm292 requires sortable<I, Comp, Proj>
303 requires sortable<I, Comp, Proj>
314 requires sortable<I, Comp, Proj>
325 requires sortable<I, Comp, Proj>
361 requires sortable<I, Comp, Proj>
372 requires sortable<I, Comp, Proj>
382 requires sortable<I, Comp, Proj>
487 requires sortable<I, Comp, Proj>
918 requires sortable<I, Comp, Proj>
1028 requires sortable<I, Comp, Proj>
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.clamp/
H A Dranges.clamp.pass.cpp27 template <class T, class Comp = std::ranges::less, class Proj = std::identity>
29 requires(T&& val, T&& low, T&& high, Comp&& comp, Proj&& proj) {
31 std::forward<Comp>(comp), std::forward<Proj>(proj));
79 struct Comp { in test() struct
88 assert(&std::ranges::clamp(val, low, high, Comp{}, &S::lvalue_proj) == &low); in test()
89 assert(&std::ranges::clamp(val, high, low, Comp{}, &S::prvalue_proj) == &low); in test()
/llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons.alloc/
H A Dctor_iter_iter_comp_alloc.pass.cpp22 template<class T, class Cont, class Comp = std::less<T> >
23 struct PQ : std::priority_queue<T, Cont, Comp> {
24 typedef std::priority_queue<T, Cont, Comp> base;
27 …explicit PQ(It first, It last, const Comp& compare, const Alloc& a) : base(first, last, compare, a… in PQ()
H A Dctor_iter_iter_comp_cont_alloc.pass.cpp21 template<class T, class Cont, class Comp = std::less<T> >
22 struct PQ : std::priority_queue<T, Cont, Comp> {
23 typedef std::priority_queue<T, Cont, Comp> base;
26 …explicit PQ(It first, It last, const Comp& compare, const Cont& v, const Alloc& a) : base(first, l… in PQ()
H A Dctor_iter_iter_comp_rcont_alloc.pass.cpp24 template<class T, class Cont, class Comp = std::less<T> >
25 struct PQ : std::priority_queue<T, Cont, Comp> {
26 typedef std::priority_queue<T, Cont, Comp> base;
29 …explicit PQ(It first, It last, const Comp& compare, Cont&& v, const Alloc& a) : base(first, last, … in PQ()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/
H A Dranges_is_heap.pass.cpp35 template <class Iter = int*, class Sent = int*, class Comp = std::ranges::less>
37 requires(Iter&& iter, Sent&& sent, Comp&& comp) {
38 …std::ranges::is_heap(std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Comp>(comp));
58 template <class Range, class Comp = std::ranges::less>
60 requires(Range&& range, Comp&& comp) {
61 std::ranges::is_heap(std::forward<Range>(range), std::forward<Comp>(comp));
H A Dranges_is_heap_until.pass.cpp35 template <class Iter = int*, class Sent = int*, class Comp = std::ranges::less>
37 requires(Iter&& iter, Sent&& sent, Comp&& comp) {
38 …anges::is_heap_until(std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Comp>(comp));
58 template <class Range, class Comp = std::ranges::less>
60 requires(Range&& range, Comp&& comp) {
61 std::ranges::is_heap_until(std::forward<Range>(range), std::forward<Comp>(comp));
/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.ops/
H A Dcontains_transparent.pass.cpp18 struct Comp { struct
44 test<std::map<std::pair<int, int>, int, Comp> >(); in main() argument
45 test<std::multimap<std::pair<int, int>, int, Comp> >(); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/
H A Dcontains_transparent.pass.cpp21 struct Comp { struct
47 test<std::set<std::pair<int, int>, Comp> >(); in main() argument
48 test<std::multiset<std::pair<int, int>, Comp> >(); in main()

1234