| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/indirectcallable/projected/ |
| H A D | projected.compile.pass.cpp | 20 using IntPtr = std::projected<int const*, std::identity>;
27 using Cpp17InputIterator = std::projected<cpp17_input_iterator<S*>, int S::*>;
32 using Cpp20InputIterator = std::projected<cpp20_input_iterator<S*>, int S::*>;
37 using ForwardIterator = std::projected<forward_iterator<S*>, int (S::*)()>;
42 using BidirectionalIterator = std::projected<bidirectional_iterator<S*>, S* (S::*)() const>;
47 using RandomAccessIterator = std::projected<random_access_iterator<S*>, S && (S::*)()>;
52 using ContiguousIterator = std::projected<contiguous_iterator<S*>, S& (S::*)() const>;
59 typename std::projected<I, F>;
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
| H A D | indirectly_comparable.compile.pass.cpp | 37 …requires std::indirect_binary_predicate<F, std::projected<int*, std::identity>, std::projected<cha…
41 …requires std::indirect_binary_predicate<F, std::projected<int*, std::identity>, std::projected<cha…
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 85 indirect_unary_predicate<projected<I, Proj>> Pred>
94 indirect_unary_predicate<projected<I, Proj>> Pred>
176 indirect_unary_predicate<projected<I, Proj>> Pred>
243 indirect_unary_predicate<projected<I, Proj>> Pred>
283 indirect_unary_predicate<projected<I, Proj>> Pred>
426 indirect_unary_predicate<projected<I, Proj>> Pred>
434 indirect_unary_predicate<projected<I, Proj>> Pred>
453 indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
564 indirect_binary_predicate<projected<I, Proj>,
603 indirect_strict_weak_order<projected<I1, Proj1>,
[all …]
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | ranges_adjacent_find.h | 52 …indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_…
60 indirect_binary_predicate<projected<iterator_t<_Range>, _Proj>,
61 … projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
|
| H A D | ranges_includes.h | 45 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
69 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, …
|
| H A D | ranges_transform.h | 89 requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<_InIter, _Proj>>>
102 …requires indirectly_writable<_OutIter, indirect_result_t<_Func, projected<iterator_t<_Range>, _Pro…
117 requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<_InIter1, _Proj1>,
118 projected<_InIter2, _Proj2>>>
140 …requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<iterator_t<_Range1>, _P…
141 … projected<iterator_t<_Range2>, _Proj2>>>
|
| H A D | ranges_lexicographical_compare.h | 57 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
75 indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>,
76 projected<iterator_t<_Range2>, _Proj2>> _Comp = ranges::less>
|
| H A D | ranges_partial_sort_copy.h | 49 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
65 indirect_strict_weak_order<_Comp, projected<iterator_t<_Range1>, _Proj1>,
66 projected<iterator_t<_Range2>, _Proj2>>
|
| H A D | ranges_is_permutation.h | 50 indirect_equivalence_relation<projected<_Iter1, _Proj1>,
51 projected<_Iter2, _Proj2>> _Pred = ranges::equal_to>
64 …indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2…
|
| H A D | ranges_min.h | 40 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
47 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
55 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
| H A D | ranges_max.h | 41 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
48 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
58 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
| H A D | ranges_is_sorted.h | 35 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
43 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
|
| H A D | ranges_lower_bound.h | 39 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
46 …indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::les…
|
| H A D | ranges_max_element.h | 35 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
43 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
| H A D | ranges_remove.h | 37 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
46 … && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
|
| H A D | ranges_find_if_not.h | 37 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
45 indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred>
|
| H A D | ranges_count.h | 36 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
44 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
|
| H A D | ranges_minmax.h | 46 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
55 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
64 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
|
| H A D | ranges_find.h | 37 requires indirect_binary_predicate<ranges::equal_to, projected<_Ip, _Proj>, const _Tp*>
45 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Rp>, _Proj>, const _Tp*>
|
| H A D | ranges_minmax_element.h | 44 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
52 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
| /llvm-project-15.0.7/libcxx/include/__iterator/ |
| H A D | indirectly_comparable.h | 28 indirect_binary_predicate<_Rp, projected<_I1, _P1>, projected<_I2, _P2>>;
|
| H A D | projected.h | 26 struct projected { struct
32 struct incrementable_traits<projected<_It, _Proj>> { argument
|
| H A D | mergeable.h | 35 indirect_strict_weak_order<_Comp, projected<_Input1, _Proj1>, projected<_Input2, _Proj2>>;
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/alg.req.mergeable/ |
| H A D | mergeable.compile.pass.cpp | 51 std::projected<Foo*, ProjFooToInt>, std::projected<Foo*, ProjFooToLong>>);
54 std::projected<Foo*, ProjFooToInt>, std::projected<Foo*, ProjFooToLong>>);
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/alg.req.sortable/ |
| H A D | sortable.compile.pass.cpp | 32 static_assert( std::indirect_strict_weak_order<CompDefault, std::projected<Foo*, Proj>>);
36 static_assert( std::indirect_strict_weak_order<CompInt, std::projected<Foo*, Proj>>);
|