| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | iterator_operations.h | 43 template <class _Iter> 46 template <class _Iter> 49 template <class _Iter> 68 template <class _Iter> 71 template <class _Iter> 74 template <class _Iter> 87 static typename iterator_traits<_Iter>::difference_type distance(_Iter __first, _Iter __last) { 113 __move_t<_Iter> > 150 __uncvref_t<_Iter> next(_Iter&& __it, 158 __uncvref_t<_Iter> prev(_Iter&& __iter, [all …]
|
| H A D | unwrap_range.h | 35 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __unwrap() 47 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __rewrap() 52 _LIBCPP_HIDE_FROM_ABI static constexpr auto __rewrap(const _Iter&, _Iter __iter) in __rewrap() 53 requires (!(random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>)) in __rewrap() 59 template <class _Iter> 60 struct __unwrap_range_impl<_Iter, _Iter> { 61 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Iter __last) { 78 class _Iter, 80 _LIBCPP_HIDE_FROM_ABI constexpr _Iter __rewrap_range(_Iter __orig_iter, _Unwrapped __iter) { 84 template <class _Iter, class _Unwrapped = decltype(std::__unwrap_iter(std::declval<_Iter>()))> [all …]
|
| H A D | unwrap_iter.h | 33 template <class _Iter, bool = __is_cpp17_contiguous_iterator<_Iter>::value> 35 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter, _Iter __iter) { return __iter… in __rewrap() 36 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } in __unwrap() 42 template <class _Iter> 43 struct __unwrap_iter_impl<_Iter, true> { 44 using _ToAddressT = decltype(std::__to_address(std::declval<_Iter>())); 46 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter __orig_iter, _ToAddressT __unw… 57 template<class _Iter, 58 class _Impl = __unwrap_iter_impl<_Iter>, 59 __enable_if_t<is_copy_constructible<_Iter>::value, int> = 0> [all …]
|
| H A D | ranges_iterator_concept.h | 29 using _Iter = __uncvref_t<_IterMaybeQualified>; in __get_iterator_concept() local 31 if constexpr (contiguous_iterator<_Iter>) in __get_iterator_concept() 33 else if constexpr (random_access_iterator<_Iter>) in __get_iterator_concept() 35 else if constexpr (bidirectional_iterator<_Iter>) in __get_iterator_concept() 37 else if constexpr (forward_iterator<_Iter>) in __get_iterator_concept() 39 else if constexpr (input_iterator<_Iter>) in __get_iterator_concept() 43 template <class _Iter> 44 using __iterator_concept = decltype(__get_iterator_concept<_Iter>());
|
| H A D | ranges_stable_partition.h | 46 template <class _Iter, class _Sent, class _Proj, class _Pred> 48 subrange<__uncvref_t<_Iter>> __stable_partition_fn_impl( in __stable_partition_fn_impl() 49 _Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl() 54 std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>()); in __stable_partition_fn_impl() 59 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 60 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 61 requires permutable<_Iter> 63 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_for_each.h | 33 template <class _Iter, class _Func> 34 using for_each_result = in_fun_result<_Iter, _Func>; 39 template <class _Iter, class _Sent, class _Proj, class _Func> 41 …for_each_result<_Iter, _Func> __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& _… in __for_each_impl() 48 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, 50 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 52 …for_each_result<_Iter, _Func> operator()(_Iter __first, _Sent __last, _Func __func, _Proj __proj =… 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_nth_element.h | 42 template <class _Iter, class _Sent, class _Comp, class _Proj> 44 …_Iter __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj… in __nth_element_fn_impl() 53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 54 requires sortable<_Iter, _Comp, _Proj> 56 …_Iter operator()(_Iter __first, _Iter __nth, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) c… in operator()
|
| H A D | ranges_partial_sort.h | 43 template <class _Iter, class _Sent, class _Comp, class _Proj> 45 …_Iter __partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __… in __partial_sort_fn_impl() 50 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla… 51 requires sortable<_Iter, _Comp, _Proj> 53 …_Iter operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}… in operator()
|
| H A D | equal_range.h | 36 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj> 37 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_Iter, _Iter> 38 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range() 40 _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last); in __equal_range() 43 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range() 51 _Iter __mp1 = __mid; in __equal_range() 52 return pair<_Iter, _Iter>( in __equal_range() 57 return pair<_Iter, _Iter>(__first, __first); in __equal_range()
|
| H A D | unique.h | 28 template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate> 29 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17 std::pair<_Iter, _Iter> 30 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __unique() 35 _Iter __i = __first; in __unique() 40 return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i)); in __unique() 42 return std::pair<_Iter, _Iter>(__first, __first); in __unique()
|
| 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() 37 iter_difference_t<_Iter> __counter(0); in __count_if_impl() 47 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 48 indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate> 50 …iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj =… in operator()
|
| H A D | search_n.h | 31 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class… 33 pair<_Iter, _Iter> __search_n_forward_impl(_Iter __first, _Sent __last, in __search_n_forward_impl() 52 _Iter __m = __first; in __search_n_forward_impl() 73 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class… 75 std::pair<_Iter, _Iter> __search_n_random_access_impl(_Iter __first, _Sent __last, in __search_n_random_access_impl() 81 using difference_type = typename iterator_traits<_Iter>::difference_type; in __search_n_random_access_impl() 120 template <class _Iter, class _Sent, 126 pair<_Iter, _Iter> __search_n_impl(_Iter __first, _Sent __last, 131 … __enable_if_t<__is_cpp17_random_access_iterator<_Iter>::value>* = nullptr) {
|
| H A D | ranges_partition.h | 44 template <class _Iter, class _Sent, class _Proj, class _Pred> 46 …subrange<__uncvref_t<_Iter>> __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, … in __partition_fn_impl() 49 std::move(__first), std::move(__last), __projected_pred, __iterator_concept<_Iter>()); in __partition_fn_impl() 54 template <permutable _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 55 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 57 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_adjacent_find.h | 35 template <class _Iter, class _Sent, class _Proj, class _Pred> 37 _Iter __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find_impl() 50 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, 52 …indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_… 54 _Iter operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_remove_if.h | 36 template <class _Iter, class _Sent, class _Proj, class _Pred> 38 subrange<_Iter> __remove_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __remove_if_impl() 43 _Iter __i = __new_end; in __remove_if_impl() 56 template <permutable _Iter, sentinel_for<_Iter> _Sent, 58 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 60 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_replace_if.h | 32 template <class _Iter, class _Sent, class _Type, class _Proj, class _Pred> 34 _Iter __replace_if_impl(_Iter __first, _Sent __last, _Pred& __pred, const _Type& __new_value, _Proj… in __replace_if_impl() 45 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, 48 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 49 requires indirectly_writable<_Iter, const _Type&> 51 …_Iter operator()(_Iter __first, _Sent __last, _Pred __pred, const _Type& __new_value, _Proj __proj… in operator()
|
| H A D | ranges_inplace_merge.h | 42 template <class _Iter, class _Sent, class _Comp, class _Proj> 44 …__inplace_merge_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp&& __comp, _Proj&& __proj) { in __inplace_merge_impl() 52 bidirectional_iterator _Iter, 53 sentinel_for<_Iter> _Sent, 56 requires sortable<_Iter, _Comp, _Proj> 57 _LIBCPP_HIDE_FROM_ABI _Iter 58 …operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) cons… in operator()
|
| H A D | ranges_for_each_n.h | 33 template <class _Iter, class _Func> 34 using for_each_n_result = in_fun_result<_Iter, _Func>; 39 template <input_iterator _Iter, 41 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 43 for_each_n_result<_Iter, _Func> operator()(_Iter __first, in operator() 44 iter_difference_t<_Iter> __count, in operator()
|
| /llvm-project-15.0.7/libcxx/include/__iterator/ |
| H A D | common_iterator.h | 32 template<class _Iter> 34 constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>> && 37 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent> 38 requires (!same_as<_Iter, _Sent> && copyable<_Iter>) 44 iter_value_t<_Iter> __value_; 51 iter_value_t<_Iter> __value_; 55 variant<_Iter, _Sent> __hold_; 59 constexpr common_iterator(_Iter __i) : __hold_(in_place_type<_Iter>, _VSTD::move(__i)) {} in common_iterator() 109 template<class _I2 = _Iter> 187 template<sized_sentinel_for<_Iter> _I2, sized_sentinel_for<_Iter> _S2> [all …]
|
| H A D | counted_iterator.h | 38 template<class _Iter> 47 template<class _Iter> 56 template<indirectly_readable _Iter> 68 _LIBCPP_NO_UNIQUE_ADDRESS _Iter __current_ = _Iter(); 71 using iterator_type = _Iter; 78 constexpr counted_iterator(_Iter __iter, iter_difference_t<_Iter> __n) 208 template<common_with<_Iter> _I2> 250 template<common_with<_Iter> _I2> 292 template<input_iterator _Iter> 293 requires same_as<_ITER_TRAITS<_Iter>, iterator_traits<_Iter>> [all …]
|
| H A D | reverse_iterator.h | 42 template <class _Iter> 64 _Iter current; 91 !is_same<_Up, _Iter>::value && is_convertible<_Up const&, _Iter>::value 198 template <class _Iter> 201 template <class _Iter> 311 template <class _Iter> 326 template <class _Iter> 328 reverse_iterator<_Iter> make_reverse_iterator(_Iter __i) 335 template <class _Iter> 361 template <class _Iter> [all …]
|
| H A D | move_iterator.h | 40 template<class _Iter> 56 template <class _Iter> 69 using pointer = _Iter; 140 !is_same<_Up, _Iter>::value && is_convertible<const _Up&, _Iter>::value 223 _Iter __current_; 299 template <class _Iter> 301 move_iterator<_Iter> operator+(iter_difference_t<_Iter> __n, const move_iterator<_Iter>& __x) 307 template <class _Iter> 309 move_iterator<_Iter> 316 template <class _Iter> [all …]
|
| H A D | iterator_traits.h | 47 template <class _Iter> 59 template <class _Iter> 63 _Iter, 67 template <class _Iter> 71 template <class _Iter> 75 template <class _Iter> 79 template <class _Iter> 92 template <class _Iter> 101 template <class _Iter> 384 _Iter, [all …]
|
| /llvm-project-15.0.7/libcxx/include/__ranges/ |
| H A D | subrange.h | 66 constructible_from<_Pair, _Iter, _Sent> && 72 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent = _Iter, 88 _LIBCPP_NO_UNIQUE_ADDRESS _Iter __begin_ = _Iter(); 150 constexpr _Iter begin() const requires copyable<_Iter> { in begin() 154 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter begin() requires (!copyable<_Iter>) { in begin() 178 requires forward_iterator<_Iter> 191 requires bidirectional_iterator<_Iter> 216 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent> 217 subrange(_Iter, _Sent) -> subrange<_Iter, _Sent>; 219 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent> [all …]
|