31#define _RANGES_UTIL_H 1
33#if __cplusplus > 201703L
38#ifdef __glibcxx_ranges
39namespace std _GLIBCXX_VISIBILITY(default)
41_GLIBCXX_BEGIN_NAMESPACE_VERSION
48 template<
typename _Range>
49 concept __simple_view = view<_Range> && range<const _Range>
50 && same_as<iterator_t<_Range>, iterator_t<const _Range>>
51 && same_as<sentinel_t<_Range>, sentinel_t<const _Range>>;
53 template<
typename _It>
54 concept __has_arrow = input_iterator<_It>
55 && (is_pointer_v<_It> ||
requires(_It __it) { __it.operator->(); });
57 using std::__detail::__different_from;
61 template<
typename _Derived>
62 requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
66 constexpr _Derived& _M_derived()
noexcept
68 static_assert(derived_from<_Derived, view_interface<_Derived>>);
69 static_assert(view<_Derived>);
70 return static_cast<_Derived&
>(*this);
73 constexpr const _Derived& _M_derived()
const noexcept
75 static_assert(derived_from<_Derived, view_interface<_Derived>>);
76 static_assert(view<_Derived>);
77 return static_cast<const _Derived&
>(*this);
81 _S_bool(
bool)
noexcept;
83 template<
typename _Tp>
86 noexcept(
noexcept(_S_bool(ranges::begin(__t) == ranges::end(__t))))
87 {
return ranges::begin(__t) == ranges::end(__t); }
89 template<
typename _Tp>
92 noexcept(
noexcept(ranges::end(__t) - ranges::begin(__t)))
93 {
return ranges::end(__t) - ranges::begin(__t); }
98 noexcept(
noexcept(_S_empty(_M_derived())))
99 requires forward_range<_Derived> && (!sized_range<_Derived>)
100 {
return _S_empty(_M_derived()); }
104 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
105 requires sized_range<_Derived>
106 {
return ranges::size(_M_derived()) == 0; }
110 noexcept(
noexcept(_S_empty(_M_derived())))
111 requires forward_range<const _Derived> && (!sized_range<const _Derived>)
112 {
return _S_empty(_M_derived()); }
116 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
117 requires sized_range<const _Derived>
118 {
return ranges::size(_M_derived()) == 0; }
121 operator bool()
noexcept(
noexcept(ranges::empty(_M_derived())))
122 requires requires { ranges::empty(_M_derived()); }
123 {
return !ranges::empty(_M_derived()); }
126 operator bool()
const noexcept(
noexcept(ranges::empty(_M_derived())))
127 requires requires { ranges::empty(_M_derived()); }
128 {
return !ranges::empty(_M_derived()); }
131 data()
noexcept(
noexcept(ranges::begin(_M_derived())))
132 requires contiguous_iterator<iterator_t<_Derived>>
136 data()
const noexcept(
noexcept(ranges::begin(_M_derived())))
137 requires range<const _Derived>
138 && contiguous_iterator<iterator_t<const _Derived>>
142 size()
noexcept(
noexcept(_S_size(_M_derived())))
143 requires forward_range<_Derived>
144 && sized_sentinel_for<sentinel_t<_Derived>, iterator_t<_Derived>>
145 {
return _S_size(_M_derived()); }
148 size()
const noexcept(
noexcept(_S_size(_M_derived())))
149 requires forward_range<const _Derived>
150 && sized_sentinel_for<sentinel_t<const _Derived>,
151 iterator_t<const _Derived>>
152 {
return _S_size(_M_derived()); }
154 constexpr decltype(
auto)
155 front()
requires forward_range<_Derived>
157 __glibcxx_assert(!empty());
158 return *ranges::begin(_M_derived());
161 constexpr decltype(
auto)
162 front()
const requires forward_range<const _Derived>
164 __glibcxx_assert(!empty());
165 return *ranges::begin(_M_derived());
168 constexpr decltype(
auto)
170 requires bidirectional_range<_Derived> && common_range<_Derived>
172 __glibcxx_assert(!empty());
173 return *ranges::prev(ranges::end(_M_derived()));
176 constexpr decltype(
auto)
178 requires bidirectional_range<const _Derived>
179 && common_range<const _Derived>
181 __glibcxx_assert(!empty());
182 return *ranges::prev(ranges::end(_M_derived()));
185 template<random_access_range _Range = _Derived>
186 constexpr decltype(
auto)
187 operator[](range_difference_t<_Range> __n)
188 {
return ranges::begin(_M_derived())[__n]; }
190 template<random_access_range _Range = const _Derived>
191 constexpr decltype(
auto)
192 operator[](range_difference_t<_Range> __n)
const
193 {
return ranges::begin(_M_derived())[__n]; }
195#if __cplusplus > 202002L
197 cbegin()
requires input_range<_Derived>
198 {
return ranges::cbegin(_M_derived()); }
201 cbegin()
const requires input_range<const _Derived>
202 {
return ranges::cbegin(_M_derived()); }
205 cend()
requires input_range<_Derived>
206 {
return ranges::cend(_M_derived()); }
209 cend()
const requires input_range<const _Derived>
210 {
return ranges::cend(_M_derived()); }
216 template<
typename _From,
typename _To>
217 concept __uses_nonqualification_pointer_conversion
218 = is_pointer_v<_From> && is_pointer_v<_To>
219 && !convertible_to<remove_pointer_t<_From>(*)[],
222 template<
typename _From,
typename _To>
223 concept __convertible_to_non_slicing = convertible_to<_From, _To>
224 && !__uses_nonqualification_pointer_conversion<decay_t<_From>,
227 template<
typename _Tp>
229 = !is_reference_v<_Tp> &&
requires(_Tp __t)
233 typename tuple_element_t<0, remove_const_t<_Tp>>;
234 typename tuple_element_t<1, remove_const_t<_Tp>>;
235 { get<0>(__t) } -> convertible_to<const tuple_element_t<0, _Tp>&>;
236 { get<1>(__t) } -> convertible_to<const tuple_element_t<1, _Tp>&>;
239 template<
typename _Tp,
typename _Up,
typename _Vp>
240 concept __pair_like_convertible_from
241 = !range<_Tp> && __pair_like<_Tp>
242 && constructible_from<_Tp, _Up, _Vp>
243 && __convertible_to_non_slicing<_Up, tuple_element_t<0, _Tp>>
244 && convertible_to<_Vp, tuple_element_t<1, _Tp>>;
248 namespace views {
struct _Drop; }
250 enum class subrange_kind :
bool { unsized, sized };
253 template<input_or_output_iterator _It, sentinel_for<_It> _Sent = _It,
254 subrange_kind _Kind = sized_sentinel_for<_Sent, _It>
255 ? subrange_kind::sized : subrange_kind::unsized>
256 requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _It>)
260 static constexpr bool _S_store_size
261 = _Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _It>;
263 friend struct views::_Drop;
265 _It _M_begin = _It();
266 [[no_unique_address]] _Sent _M_end = _Sent();
269 = __detail::__make_unsigned_like_t<iter_difference_t<_It>>;
271 template<
typename _Tp,
bool = _S_store_size>
274 [[__gnu__::__always_inline__]]
275 constexpr _Size(_Tp = {}) { }
278 template<
typename _Tp>
279 struct _Size<_Tp, true>
281 [[__gnu__::__always_inline__]]
282 constexpr _Size(_Tp __s = {}) : _M_size(__s) { }
287 [[no_unique_address]] _Size<__size_type> _M_size = {};
290 subrange()
requires default_initializable<_It> =
default;
293 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s)
294 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
295 && is_nothrow_constructible_v<_Sent, _Sent&>)
296 requires (!_S_store_size)
301 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s,
303 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
304 && is_nothrow_constructible_v<_Sent, _Sent&>)
305 requires (_Kind == subrange_kind::sized)
306 : _M_begin(
std::move(__i)), _M_end(__s), _M_size(__n)
309 template<__detail::__different_from<subrange> _Rng>
310 requires borrowed_range<_Rng>
311 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
312 && convertible_to<sentinel_t<_Rng>, _Sent>
315 noexcept(
noexcept(
subrange(__r, ranges::size(__r))))
316 requires _S_store_size && sized_range<_Rng>
320 template<__detail::__different_from<subrange> _Rng>
321 requires borrowed_range<_Rng>
322 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
323 && convertible_to<sentinel_t<_Rng>, _Sent>
326 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r))))
327 requires (!_S_store_size)
328 :
subrange(ranges::begin(__r), ranges::end(__r))
331 template<borrowed_range _Rng>
332 requires __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
333 && convertible_to<sentinel_t<_Rng>, _Sent>
335 subrange(_Rng&& __r, __size_type __n)
336 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r), __n)))
337 requires (_Kind == subrange_kind::sized)
338 :
subrange{ranges::begin(__r), ranges::end(__r), __n}
341 template<__detail::__different_from<subrange> _PairLike>
342 requires __detail::__pair_like_convertible_from<_PairLike,
const _It&,
345 operator _PairLike()
const
346 {
return _PairLike(_M_begin, _M_end); }
349 begin()
const requires copyable<_It>
352 [[nodiscard]]
constexpr _It
353 begin()
requires (!copyable<_It>)
356 constexpr _Sent
end()
const {
return _M_end; }
358 constexpr bool empty()
const {
return _M_begin == _M_end; }
360 constexpr __size_type
361 size()
const requires (_Kind == subrange_kind::sized)
363 if constexpr (_S_store_size)
364 return _M_size._M_size;
366 return __detail::__to_unsigned_like(_M_end - _M_begin);
370 next(iter_difference_t<_It> __n = 1)
const &
371 requires forward_iterator<_It>
379 next(iter_difference_t<_It> __n = 1) &&
386 prev(iter_difference_t<_It> __n = 1)
const
387 requires bidirectional_iterator<_It>
395 advance(iter_difference_t<_It> __n)
399 if constexpr (bidirectional_iterator<_It>)
402 ranges::advance(_M_begin, __n);
403 if constexpr (_S_store_size)
404 _M_size._M_size += __detail::__to_unsigned_like(-__n);
408 __glibcxx_assert(__n >= 0);
409 auto __d = __n - ranges::advance(_M_begin, __n, _M_end);
410 if constexpr (_S_store_size)
411 _M_size._M_size -= __detail::__to_unsigned_like(__d);
416 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
419 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
421 __detail::__make_unsigned_like_t<iter_difference_t<_It>>)
424 template<borrowed_range _Rng>
428 || sized_sentinel_for<sentinel_t<_Rng>, iterator_t<_Rng>>)
429 ? subrange_kind::sized : subrange_kind::unsized>;
431 template<borrowed_range _Rng>
433 __detail::__make_unsigned_like_t<range_difference_t<_Rng>>)
436 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
441 if constexpr (_Num == 0)
447 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
450 get(subrange<_It, _Sent, _Kind>&& __r)
452 if constexpr (_Num == 0)
458 template<
typename _It,
typename _Sent, subrange_kind _Kind>
459 inline constexpr bool
460 enable_borrowed_range<subrange<_It, _Sent, _Kind>> =
true;
462 template<range _Range>
463 using borrowed_subrange_t = __conditional_t<borrowed_range<_Range>,
464 subrange<iterator_t<_Range>>,
474 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
typename _Tp,
475 typename _Proj =
identity>
476 requires indirect_binary_predicate<ranges::equal_to,
477 projected<_Iter, _Proj>,
const _Tp*>
479 operator()(_Iter __first, _Sent __last,
480 const _Tp& __value, _Proj __proj = {})
const
482 while (__first != __last
488 template<input_range _Range,
typename _Tp,
typename _Proj =
identity>
489 requires indirect_binary_predicate<ranges::equal_to,
490 projected<iterator_t<_Range>, _Proj>,
492 constexpr borrowed_iterator_t<_Range>
493 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
495 return (*
this)(ranges::begin(__r), ranges::end(__r),
500 inline constexpr __find_fn find{};
504 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
505 typename _Proj =
identity,
506 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
508 operator()(_Iter __first, _Sent __last,
509 _Pred __pred, _Proj __proj = {})
const
511 while (__first != __last
517 template<input_range _Range,
typename _Proj = identity,
518 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
520 constexpr borrowed_iterator_t<_Range>
521 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
523 return (*
this)(ranges::begin(__r), ranges::end(__r),
528 inline constexpr __find_if_fn find_if{};
530 struct __find_if_not_fn
532 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
533 typename _Proj =
identity,
534 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
536 operator()(_Iter __first, _Sent __last,
537 _Pred __pred, _Proj __proj = {})
const
539 while (__first != __last
545 template<input_range _Range,
typename _Proj = identity,
546 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
548 constexpr borrowed_iterator_t<_Range>
549 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
551 return (*
this)(ranges::begin(__r), ranges::end(__r),
556 inline constexpr __find_if_not_fn find_if_not{};
558 template<
typename _Iter1,
typename _Iter2>
561 [[no_unique_address]] _Iter1 in1;
562 [[no_unique_address]] _Iter2 in2;
564 template<
typename _IIter1,
typename _IIter2>
565 requires convertible_to<const _Iter1&, _IIter1>
566 && convertible_to<const _Iter2&, _IIter2>
568 operator in_in_result<_IIter1, _IIter2>() const &
569 {
return {in1, in2}; }
571 template<
typename _IIter1,
typename _IIter2>
572 requires convertible_to<_Iter1, _IIter1>
573 && convertible_to<_Iter2, _IIter2>
575 operator in_in_result<_IIter1, _IIter2>() &&
579 template<
typename _Iter1,
typename _Iter2>
580 using mismatch_result = in_in_result<_Iter1, _Iter2>;
584 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
585 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
586 typename _Pred = ranges::equal_to,
587 typename _Proj1 =
identity,
typename _Proj2 =
identity>
588 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
589 constexpr mismatch_result<_Iter1, _Iter2>
590 operator()(_Iter1 __first1, _Sent1 __last1,
591 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
592 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
594 while (__first1 != __last1 && __first2 != __last2
605 template<input_range _Range1, input_range _Range2,
606 typename _Pred = ranges::equal_to,
607 typename _Proj1 = identity,
typename _Proj2 = identity>
608 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
609 _Pred, _Proj1, _Proj2>
610 constexpr mismatch_result<iterator_t<_Range1>, iterator_t<_Range2>>
611 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
612 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
614 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
615 ranges::begin(__r2), ranges::end(__r2),
621 inline constexpr __mismatch_fn mismatch{};
625 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
626 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
627 typename _Pred = ranges::equal_to,
628 typename _Proj1 =
identity,
typename _Proj2 =
identity>
629 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
630 constexpr subrange<_Iter1>
631 operator()(_Iter1 __first1, _Sent1 __last1,
632 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
633 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
635 if (__first1 == __last1 || __first2 == __last2)
636 return {__first1, __first1};
642 if (__first1 == __last1)
643 return {__first1, __first1};
650 auto __cur1 = __first1;
651 auto __cur2 = __first2;
654 if (++__cur2 == __last2)
655 return {__first1, ++__cur1};
656 if (++__cur1 == __last1)
657 return {__cur1, __cur1};
669 template<forward_range _Range1, forward_range _Range2,
670 typename _Pred = ranges::equal_to,
671 typename _Proj1 = identity,
typename _Proj2 = identity>
672 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
673 _Pred, _Proj1, _Proj2>
674 constexpr borrowed_subrange_t<_Range1>
675 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
676 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
678 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
679 ranges::begin(__r2), ranges::end(__r2),
685 inline constexpr __search_fn search{};
689 template<
typename _Tp,
typename _Proj = identity,
690 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
691 _Comp = ranges::less>
693 operator()(
const _Tp& __a,
const _Tp& __b,
694 _Comp __comp = {}, _Proj __proj = {})
const
704 template<input_range _Range,
typename _Proj = identity,
705 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
706 _Comp = ranges::less>
707 requires indirectly_copyable_storable<iterator_t<_Range>,
708 range_value_t<_Range>*>
709 constexpr range_value_t<_Range>
710 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
712 auto __first = ranges::begin(__r);
713 auto __last = ranges::end(__r);
714 __glibcxx_assert(__first != __last);
715 auto __result = *__first;
716 while (++__first != __last)
718 auto __tmp = *__first;
727 template<copyable _Tp,
typename _Proj = identity,
728 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
729 _Comp = ranges::less>
731 operator()(initializer_list<_Tp> __r,
732 _Comp __comp = {}, _Proj __proj = {})
const
734 return (*
this)(ranges::subrange(__r),
739 inline constexpr __min_fn min{};
741 struct __adjacent_find_fn
743 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
744 typename _Proj =
identity,
745 indirect_binary_predicate<projected<_Iter, _Proj>,
746 projected<_Iter, _Proj>> _Pred
749 operator()(_Iter __first, _Sent __last,
750 _Pred __pred = {}, _Proj __proj = {})
const
752 if (__first == __last)
754 auto __next = __first;
755 for (; ++__next != __last; __first = __next)
765 template<forward_range _Range,
typename _Proj = identity,
766 indirect_binary_predicate<
767 projected<iterator_t<_Range>, _Proj>,
768 projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
769 constexpr borrowed_iterator_t<_Range>
770 operator()(_Range&& __r, _Pred __pred = {}, _Proj __proj = {})
const
772 return (*
this)(ranges::begin(__r), ranges::end(__r),
777 inline constexpr __adjacent_find_fn adjacent_find{};
783 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
784 struct tuple_size<ranges::subrange<_Iter, _Sent, _Kind>>
785 : integral_constant<size_t, 2>
788 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
789 struct tuple_element<0, ranges::subrange<_Iter, _Sent, _Kind>>
790 {
using type = _Iter; };
792 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
793 struct tuple_element<1, ranges::subrange<_Iter, _Sent, _Kind>>
794 {
using type = _Sent; };
796 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
797 struct tuple_element<0, const ranges::subrange<_Iter, _Sent, _Kind>>
798 {
using type = _Iter; };
800 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
801 struct tuple_element<1, const ranges::subrange<_Iter, _Sent, _Kind>>
802 {
using type = _Sent; };
804_GLIBCXX_END_NAMESPACE_VERSION
constexpr _Tp * to_address(_Tp *__ptr) noexcept
Obtain address referenced by a pointer to an object.
typename remove_pointer< _Tp >::type remove_pointer_t
Alias template for remove_pointer.
typename decay< _Tp >::type decay_t
Alias template for decay.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr __invoke_result< _Callable, _Args... >::type __invoke(_Callable &&__fn, _Args &&... __args) noexcept(__is_nothrow_invocable< _Callable, _Args... >::value)
Invoke a callable object.
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
ISO C++ entities toplevel namespace is std.
constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))
Return an iterator pointing to one past the last element of the const container.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
constexpr void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))
Return an iterator pointing to the first element of the const container.
The ranges::view_interface class template.
The ranges::subrange class template.
Finds the size of a given tuple type.