| /llvm-project-15.0.7/libcxx/include/__iterator/ |
| H A D | common_iterator.h | 38 requires (!same_as<_Iter, _Sent> && copyable<_Iter>) 55 variant<_Iter, _Sent> __hold_; 60 constexpr common_iterator(_Sent __s) : __hold_(in_place_type<_Sent>, _VSTD::move(__s)) {} in common_iterator() 65 : __hold_([&]() -> variant<_Iter, _Sent> { in common_iterator() 149 requires sentinel_for<_Sent, _I2> 188 requires sized_sentinel_for<_Sent, _I2> 226 template<class _Iter, class _Sent> 236 template<class _Iter, class _Sent> 246 template<class _Iter, class _Sent> 248 struct __arrow_type_or_void<_Iter, _Sent> { [all …]
|
| H A D | move_sentinel.h | 26 template <semiregular _Sent> 34 explicit move_sentinel(_Sent __s) : __last_(std::move(__s)) {} in move_sentinel() 37 requires convertible_to<const _S2&, _Sent> 42 requires assignable_from<_Sent&, const _S2&> 47 constexpr _Sent base() const { return __last_; } in base() 50 _Sent __last_ = _Sent();
|
| /llvm-project-15.0.7/libcxx/include/__ranges/ |
| H A D | subrange.h | 63 template<class _Pair, class _Iter, class _Sent> 66 constructible_from<_Pair, _Iter, _Sent> && 68 convertible_to<_Sent, tuple_element_t<1, _Pair>>; 89 _LIBCPP_NO_UNIQUE_ADDRESS _Sent __end_ = _Sent(); 108 if constexpr (sized_sentinel_for<_Sent, _Iter>) in subrange() 116 convertible_to<sentinel_t<_Range>, _Sent> 126 convertible_to<sentinel_t<_Range>, _Sent> 135 convertible_to<sentinel_t<_Range>, _Sent> 159 constexpr _Sent end() const { in end() 217 subrange(_Iter, _Sent) -> subrange<_Iter, _Sent>; [all …]
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | unwrap_range.h | 32 template <class _Iter, class _Sent> 34 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __sent) in __unwrap() 35 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __unwrap() 41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __last) { in __unwrap() 47 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __rewrap() 53 requires (!(random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>)) in __rewrap() 71 template <class _Iter, class _Sent> 72 _LIBCPP_HIDE_FROM_ABI constexpr auto __unwrap_range(_Iter __first, _Sent __last) { 73 return __unwrap_range_impl<_Iter, _Sent>::__unwrap(std::move(__first), std::move(__last)); 77 class _Sent, [all …]
|
| H A D | copy.h | 30 template <class _InIter, class _Sent, class _OutIter> 32 pair<_InIter, _OutIter> __copy_impl(_InIter __first, _Sent __last, _OutIter __result) { in __copy_impl() 78 template <class _InIter, class _Sent, class _OutIter, 80 && is_copy_constructible<_Sent>::value 83 pair<_InIter, _OutIter> __copy(_InIter __first, _Sent __last, _OutIter __result) { in __copy() 87 template <class _InIter, class _Sent, class _OutIter, 89 && is_copy_constructible<_Sent>::value 92 pair<_InIter, _OutIter> __copy(_InIter __first, _Sent __last, _OutIter __result) { in __copy() 96 std::__rewrap_range<_Sent>(__first, __ret.first), std::__rewrap_iter(__result, __ret.second)); in __copy()
|
| H A D | move.h | 30 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter> 32 pair<_InIter, _OutIter> __move_impl(_InIter __first, _Sent __last, _OutIter __result) { in __move_impl() 91 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter> 94 && is_copy_constructible<_Sent>::value 96 __move(_InIter __first, _Sent __last, _OutIter __result) { 102 template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter> 105 || !is_copy_constructible<_Sent>::value 107 __move(_InIter __first, _Sent __last, _OutIter __result) {
|
| H A D | unique_copy.h | 36 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _Outpu… 39 _Sent __last, in __unique_copy() 58 template <class _AlgPolicy, class _BinaryPredicate, class _ForwardIterator, class _Sent, class _Out… 61 _Sent __last, in __unique_copy() 80 template <class _AlgPolicy, class _BinaryPredicate, class _InputIterator, class _Sent, class _Input… 83 _Sent __last, in __unique_copy()
|
| H A D | ranges_generate.h | 36 template <class _OutIter, class _Sent, class _Func> 38 static _OutIter __generate_fn_impl(_OutIter __first, _Sent __last, _Func& __gen) { in __generate_fn_impl() 46 …template <input_or_output_iterator _OutIter, sentinel_for<_OutIter> _Sent, copy_constructible _Fun… 49 _OutIter operator()(_OutIter __first, _Sent __last, _Func __gen) const { in operator()
|
| H A D | ranges_rotate.h | 37 template <class _Iter, class _Sent> 39 static subrange<_Iter> __rotate_fn_impl(_Iter __first, _Iter __middle, _Sent __last) { in __rotate_fn_impl() 45 template <permutable _Iter, sentinel_for<_Iter> _Sent> 47 subrange<_Iter> operator()(_Iter __first, _Iter __middle, _Sent __last) const { in operator()
|
| H A D | ranges_none_of.h | 33 template <class _Iter, class _Sent, class _Proj, class _Pred> 35 bool __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl() 43 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 46 bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_all_of.h | 33 template <class _Iter, class _Sent, class _Proj, class _Pred> 35 bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __all_of_impl() 43 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 46 bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_any_of.h | 33 template <class _Iter, class _Sent, class _Proj, class _Pred> 35 bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __any_of_impl() 43 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 46 bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_count_if.h | 33 template <class _Iter, class _Sent, class _Proj, class _Pred> 35 iter_difference_t<_Iter> __count_if_impl(_Iter __first, _Sent __last, in __count_if_impl() 47 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 50 …iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj =… in operator()
|
| H A D | ranges_is_partitioned.h | 34 template <class _Iter, class _Sent, class _Proj, class _Pred> 36 bool __is_parititioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_parititioned_impl() 54 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, 58 bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_is_heap_until.h | 39 template <class _Iter, class _Sent, class _Proj, class _Comp> 41 static _Iter __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl() 48 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 51 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_sort.h | 42 template <class _Iter, class _Sent, class _Comp, class _Proj> 44 _Iter __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl() 53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_sort_heap.h | 43 template <class _Iter, class _Sent, class _Comp, class _Proj> 45 _Iter __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl() 54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_make_heap.h | 43 template <class _Iter, class _Sent, class _Comp, class _Proj> 45 _Iter __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl() 54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_move.h | 39 template <class _InIter, class _Sent, class _OutIter> 41 move_result<_InIter, _OutIter> __move_impl(_InIter __first, _Sent __last, _OutIter __result) { in __move_impl() 46 template <input_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter> 49 …move_result<_InIter, _OutIter> operator()(_InIter __first, _Sent __last, _OutIter __result) const { in operator()
|
| H A D | ranges_push_heap.h | 43 template <class _Iter, class _Sent, class _Comp, class _Proj> 45 _Iter __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_heap_fn_impl() 54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_is_heap.h | 38 template <class _Iter, class _Sent, class _Proj, class _Comp> 40 static bool __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl() 48 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 51 bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_stable_sort.h | 42 template <class _Iter, class _Sent, class _Comp, class _Proj> 44 static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl() 53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_is_sorted_until.h | 33 template <class _Iter, class _Sent, class _Proj, class _Comp> 35 _Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_sorted_until_impl() 49 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, 53 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_stable_partition.h | 46 template <class _Iter, class _Sent, class _Proj, class _Pred> 49 _Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl() 59 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 63 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_pop_heap.h | 43 template <class _Iter, class _Sent, class _Comp, class _Proj> 45 _Iter __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl() 55 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 58 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|