Home
last modified time | relevance | path

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

12345

/llvm-project/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/
H A Ddeduct.pass.cpp122 typedef std::greater<T> Comp; in main() typedef
130 Comp comp; in main()
133 static_assert(std::is_same_v<decltype(pri), std::priority_queue<T, Cont, Comp>>); in main()
137 Comp comp; in main()
140 static_assert(std::is_same_v<decltype(pri), std::priority_queue<T, Cont, Comp>>); in main()
144 Comp comp; in main()
147 static_assert(std::is_same_v<decltype(pri), std::priority_queue<T, Cont, Comp>>); in main()
151 Comp comp; in main()
154 static_assert(std::is_same_v<decltype(pri), std::priority_queue<T, Cont, Comp>>); in main()
161 typedef std::greater<T> Comp; in main() typedef
[all …]
/llvm-project/libcxx/test/libcxx/algorithms/
H A Dlifetimebound.verify.cpp16 struct Comp { struct
28 …auto&& v3 = std::min(0, i, Comp{}); // expected-warning {{temporary bound to local reference 'v3' … in func() argument
29 …auto&& v4 = std::min(i, 0, Comp{}); // expected-warning {{temporary bound to local reference 'v4' … in func()
34 …auto&& v3 = std::max(0, i, Comp{}); // expected-warning {{temporary bound to local reference 'v3' … in func()
35 …auto&& v4 = std::max(i, 0, Comp{}); // expected-warning {{temporary bound to local reference 'v4' … in func()
40 …auto&& v3 = std::minmax(0, i, Comp{}); // expected-warning {{temporary bound to local reference 'v… in func()
41 …auto&& v4 = std::minmax(i, 0, Comp{}); // expected-warning {{temporary bound to local reference 'v… in func()
44 …auto v7 = std::minmax(0, i, Comp{}); // expected-warning {{temporary whose address is used as va… in func()
45 …auto v8 = std::minmax(i, 0, Comp{}); // expected-warning {{temporary whose address is used as va… in func()
52 …auto&& v4 = std::clamp(1, i, i, Comp{}); // expected-warning {{temporary bound to local reference … in func()
[all …]
/llvm-project/llvm/include/llvm/Support/
H A DParallel.h116 const Comparator &Comp) { in medianOf3()
118 return Comp(*Start, *(End - 1)) in medianOf3() argument
119 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3()
121 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3()
127 const Comparator &Comp, TaskGroup &TG, size_t Depth) {
130 llvm::sort(Start, End, Comp); in parallel_quick_sort()
135 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort()
138 Pivot = std::partition(Start, End - 1, [&Comp, En in parallel_quick_sort()
129 parallel_quick_sort(RandomAccessIterator Start,RandomAccessIterator End,const Comparator & Comp,TaskGroup & TG,size_t Depth) parallel_quick_sort() argument
155 parallel_sort(RandomAccessIterator Start,RandomAccessIterator End,const Comparator & Comp) parallel_sort() argument
[all...]
/llvm-project/libcxx/include/
H A Dalgorithm49 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
53 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
54 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
58 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
62 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
131 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
132 constexpr const T& min(const T& a, const T& b, Comp com
[all...]
/llvm-project/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/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/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/libcxx/test/std/containers/associative/multimap/multimap.cons/
H A Dcompare_copy_constructible.compile.fail.cpp17 struct Comp { struct
20 Comp () {} in Comp() function
22 Comp (const Comp &); // declared but not defined
27 std::multimap<int, int, Comp<int> > m; in main()
/llvm-project/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() function
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/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() function
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/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/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()
/llvm-project/libcxx/test/std/containers/associative/
H A Dfrom_range_associative_containers.h58 class Comp,
72 Comp comp; in test_associative_map_with_input()
73 Container<K, V, Comp> c(std::from_range, in, comp); in test_associative_map_with_input()
92 Comp comp; in test_associative_map_with_input()
94 Container<K, V, Comp, Alloc> c(std::from_range, in, comp, alloc); in test_associative_map_with_input()
108 class Comp, in test_associative_map()
111 auto test_with_input = &test_associative_map_with_input<Container, K, V, Iter, Sent, Comp, Alloc>; in test_associative_map()
201 class Comp, in test_associative_set_with_input()
214 Comp comp; in test_associative_set_with_input()
215 Container<T, Comp> in test_associative_set_with_input()
[all...]
/llvm-project/libc/src/string/memory_utils/
H A Dinline_strcmp.h17 template <typename Comp> in inline_strcmp()
19 Comp &&comp) { in inline_strcmp()
27 template <typename Comp> in inline_strncmp()
29 size_t n, Comp &&comp) { in inline_strncmp()
/llvm-project/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/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/
H A Dranges_is_heap.pass.cpp34 template <class Iter = int*, class Sent = int*, class Comp = std::ranges::less>
36 requires(Iter&& iter, Sent&& sent, Comp&& comp) {
37 …std::ranges::is_heap(std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Comp>(comp));
57 template <class Range, class Comp = std::ranges::less>
59 requires(Range&& range, Comp&& comp) {
60 std::ranges::is_heap(std::forward<Range>(range), std::forward<Comp>(comp));
/llvm-project/libcxx/test/std/containers/container.adaptors/
H A Dfrom_range_container_adaptors.h87 class Comp,
104 Comp comp; in test_priority_queue_with_input()
106 std::priority_queue<T, C, Comp> adaptor(std::from_range, in, comp); in test_priority_queue_with_input()
107 UnwrapAdaptor<std::priority_queue<T, C, Comp>> unwrap_adaptor(std::move(adaptor)); in test_priority_queue_with_input()
134 Comp comp; in test_priority_queue_with_input()
137 std::priority_queue<T, C, Comp> adaptor(std::from_range, in, comp, alloc); in test_priority_queue_with_input()
138 UnwrapAdaptor<std::priority_queue<T, C, Comp>> unwrap_adaptor(std::move(adaptor)); in test_priority_queue_with_input()
170 class Comp,
173 auto test_with_input = &test_priority_queue_with_input<UnderlyingContainer, T, Iter, Sent, Comp, Alloc>;
/llvm-project/libcxx/test/support/
H A Ddeduction_guides_sfinae_checks.h170 using Comp = std::less<int>; in AssociativeContainerDeductionGuidesSfinaeAway() local
193 static_assert(SFINAEs_away<Container, BadIter, BadIter, Comp>); in AssociativeContainerDeductionGuidesSfinaeAway()
194 LIBCPP_STATIC_ASSERT(SFINAEs_away<Container, OutputIter, OutputIter, Comp>); in AssociativeContainerDeductionGuidesSfinaeAway()
199 static_assert(SFINAEs_away<Container, BadIter, BadIter, Comp, Alloc>); in AssociativeContainerDeductionGuidesSfinaeAway()
201 SFINAEs_away<Container, OutputIter, OutputIter, Comp, Alloc>); in AssociativeContainerDeductionGuidesSfinaeAway()
205 static_assert(SFINAEs_away<Container, Iter, Iter, Comp, BadAlloc>); in AssociativeContainerDeductionGuidesSfinaeAway()
221 static_assert(SFINAEs_away<Container, InitList, Comp, BadAlloc>); in AssociativeContainerDeductionGuidesSfinaeAway()
243 static_assert(!SFINAEs_away<Container, std::from_range_t, Range, Comp>); in AssociativeContainerDeductionGuidesSfinaeAway()
245 static_assert(SFINAEs_away<Container, std::from_range_t, BadRange, Comp>); in AssociativeContainerDeductionGuidesSfinaeAway()
250 static_assert(!SFINAEs_away<Container, std::from_range_t, Range, Comp, Alloc>); in AssociativeContainerDeductionGuidesSfinaeAway()
[all …]
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/
H A Dranges_sort_heap.pass.cpp13 // template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
15 // requires sortable<I, Comp, Proj>
17 // ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
19 // template<random_access_range R, class Comp = ranges::less, class Proj = identity>
20 // requires sortable<iterator_t<R>, Comp, Proj>
22 // ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
41 template <class Iter, class Sent = sentinel_wrapper<Iter>, class Comp = std::ranges::less>
42 concept HasSortHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, last, comp); };
52 template <class Range, class Comp = std::ranges::less>
53 concept HasSortHeapR = requires(Range range, Comp com
220 static bool Comp(const MyInt& a, const MyInt& b) { Comp() function
[all...]

12345