31#define _RANGES_UTIL_H 1
33#if __cplusplus > 201703L
37#ifdef __cpp_lib_ranges
38namespace std _GLIBCXX_VISIBILITY(default)
40_GLIBCXX_BEGIN_NAMESPACE_VERSION
47 template<
typename _Range>
48 concept __simple_view = view<_Range> && range<const _Range>
49 && same_as<iterator_t<_Range>, iterator_t<const _Range>>
50 && same_as<sentinel_t<_Range>, sentinel_t<const _Range>>;
52 template<
typename _It>
53 concept __has_arrow = input_iterator<_It>
54 && (is_pointer_v<_It> ||
requires(_It __it) { __it.operator->(); });
56 using std::__detail::__different_from;
60 template<
typename _Derived>
61 requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
65 constexpr _Derived& _M_derived()
noexcept
69 return static_cast<_Derived&
>(*this);
72 constexpr const _Derived& _M_derived()
const noexcept
76 return static_cast<const _Derived&
>(*this);
80 _S_bool(
bool)
noexcept;
82 template<
typename _Tp>
85 noexcept(
noexcept(_S_bool(ranges::begin(__t) == ranges::end(__t))))
86 {
return ranges::begin(__t) == ranges::end(__t); }
88 template<
typename _Tp>
91 noexcept(
noexcept(ranges::end(__t) - ranges::begin(__t)))
92 {
return ranges::end(__t) - ranges::begin(__t); }
97 noexcept(
noexcept(_S_empty(_M_derived())))
99 {
return _S_empty(_M_derived()); }
103 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
105 {
return ranges::size(_M_derived()) == 0; }
109 noexcept(
noexcept(_S_empty(_M_derived())))
111 {
return _S_empty(_M_derived()); }
115 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
117 {
return ranges::size(_M_derived()) == 0; }
120 operator bool()
noexcept(
noexcept(ranges::empty(_M_derived())))
121 requires requires { ranges::empty(_M_derived()); }
122 {
return !ranges::empty(_M_derived()); }
125 operator bool()
const noexcept(
noexcept(ranges::empty(_M_derived())))
126 requires requires { ranges::empty(_M_derived()); }
127 {
return !ranges::empty(_M_derived()); }
130 data()
noexcept(
noexcept(ranges::begin(_M_derived())))
131 requires contiguous_iterator<iterator_t<_Derived>>
135 data()
const noexcept(
noexcept(ranges::begin(_M_derived())))
137 && contiguous_iterator<iterator_t<const _Derived>>
141 size()
noexcept(
noexcept(_S_size(_M_derived())))
143 && sized_sentinel_for<sentinel_t<_Derived>, iterator_t<_Derived>>
144 {
return _S_size(_M_derived()); }
147 size()
const noexcept(
noexcept(_S_size(_M_derived())))
149 && sized_sentinel_for<sentinel_t<const _Derived>,
150 iterator_t<const _Derived>>
151 {
return _S_size(_M_derived()); }
153 constexpr decltype(
auto)
156 __glibcxx_assert(!empty());
157 return *ranges::begin(_M_derived());
160 constexpr decltype(
auto)
163 __glibcxx_assert(!empty());
164 return *ranges::begin(_M_derived());
167 constexpr decltype(
auto)
171 __glibcxx_assert(!empty());
172 return *ranges::prev(ranges::end(_M_derived()));
175 constexpr decltype(
auto)
180 __glibcxx_assert(!empty());
181 return *ranges::prev(ranges::end(_M_derived()));
184 template<random_access_range _Range = _Derived>
185 constexpr decltype(
auto)
186 operator[](range_difference_t<_Range> __n)
187 {
return ranges::begin(_M_derived())[__n]; }
189 template<random_access_range _Range = const _Derived>
190 constexpr decltype(
auto)
191 operator[](range_difference_t<_Range> __n)
const
192 {
return ranges::begin(_M_derived())[__n]; }
194#if __cplusplus > 202002L
197 {
return ranges::cbegin(_M_derived()); }
201 {
return ranges::cbegin(_M_derived()); }
205 {
return ranges::cend(_M_derived()); }
209 {
return ranges::cend(_M_derived()); }
215 template<
typename _From,
typename _To>
216 concept __uses_nonqualification_pointer_conversion
217 = is_pointer_v<_From> && is_pointer_v<_To>
221 template<
typename _From,
typename _To>
223 && !__uses_nonqualification_pointer_conversion<decay_t<_From>,
226 template<
typename _Tp>
228 = !is_reference_v<_Tp> &&
requires(_Tp __t)
232 typename tuple_element_t<0, remove_const_t<_Tp>>;
233 typename tuple_element_t<1, remove_const_t<_Tp>>;
235 { get<1>(__t) } -> convertible_to<const tuple_element_t<1, _Tp>&>;
238 template<
typename _Tp,
typename _Up,
typename _Vp>
239 concept __pair_like_convertible_from
240 = !range<_Tp> && __pair_like<_Tp>
241 && constructible_from<_Tp, _Up, _Vp>
242 && __convertible_to_non_slicing<_Up, tuple_element_t<0, _Tp>>
243 && convertible_to<_Vp, tuple_element_t<1, _Tp>>;
247 namespace views {
struct _Drop; }
249 enum class subrange_kind :
bool { unsized, sized };
252 template<input_or_output_iterator _It, sentinel_for<_It> _Sent = _It,
253 subrange_kind _Kind = sized_sentinel_for<_Sent, _It>
254 ? subrange_kind::sized : subrange_kind::unsized>
255 requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _It>)
259 static constexpr bool _S_store_size
260 = _Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _It>;
262 friend struct views::_Drop;
264 _It _M_begin = _It();
265 [[no_unique_address]] _Sent _M_end = _Sent();
268 = __detail::__make_unsigned_like_t<iter_difference_t<_It>>;
270 template<
typename _Tp,
bool = _S_store_size>
273 [[__gnu__::__always_inline__]]
274 constexpr _Size(_Tp = {}) { }
277 template<
typename _Tp>
278 struct _Size<_Tp, true>
280 [[__gnu__::__always_inline__]]
281 constexpr _Size(_Tp __s = {}) : _M_size(__s) { }
286 [[no_unique_address]] _Size<__size_type> _M_size = {};
292 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s)
293 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
294 && is_nothrow_constructible_v<_Sent, _Sent&>)
295 requires (!_S_store_size)
300 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s,
302 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
303 && is_nothrow_constructible_v<_Sent, _Sent&>)
304 requires (_Kind == subrange_kind::sized)
305 : _M_begin(
std::move(__i)), _M_end(__s), _M_size(__n)
308 template<__detail::__different_from<subrange> _Rng>
310 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
314 noexcept(
noexcept(
subrange(__r, ranges::size(__r))))
319 template<__detail::__different_from<subrange> _Rng>
321 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
325 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r))))
326 requires (!_S_store_size)
327 :
subrange(ranges::begin(__r), ranges::end(__r))
330 template<borrowed_range _Rng>
331 requires __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
334 subrange(_Rng&& __r, __size_type __n)
335 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r), __n)))
336 requires (_Kind == subrange_kind::sized)
337 :
subrange{ranges::begin(__r), ranges::end(__r), __n}
340 template<__detail::__different_from<subrange> _PairLike>
341 requires __detail::__pair_like_convertible_from<_PairLike,
const _It&,
344 operator _PairLike()
const
345 {
return _PairLike(_M_begin, _M_end); }
348 begin()
const requires copyable<_It>
351 [[nodiscard]]
constexpr _It
352 begin()
requires (!copyable<_It>)
355 constexpr _Sent
end()
const {
return _M_end; }
357 constexpr bool empty()
const {
return _M_begin == _M_end; }
359 constexpr __size_type
360 size()
const requires (_Kind == subrange_kind::sized)
362 if constexpr (_S_store_size)
363 return _M_size._M_size;
365 return __detail::__to_unsigned_like(_M_end - _M_begin);
369 next(iter_difference_t<_It> __n = 1)
const &
370 requires forward_iterator<_It>
378 next(iter_difference_t<_It> __n = 1) &&
385 prev(iter_difference_t<_It> __n = 1)
const
386 requires bidirectional_iterator<_It>
394 advance(iter_difference_t<_It> __n)
398 if constexpr (bidirectional_iterator<_It>)
401 ranges::advance(_M_begin, __n);
402 if constexpr (_S_store_size)
403 _M_size._M_size += __detail::__to_unsigned_like(-__n);
407 __glibcxx_assert(__n >= 0);
408 auto __d = __n - ranges::advance(_M_begin, __n, _M_end);
409 if constexpr (_S_store_size)
410 _M_size._M_size -= __detail::__to_unsigned_like(__d);
415 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
418 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
420 __detail::__make_unsigned_like_t<iter_difference_t<_It>>)
423 template<borrowed_range _Rng>
427 || sized_sentinel_for<sentinel_t<_Rng>, iterator_t<_Rng>>)
428 ? subrange_kind::sized : subrange_kind::unsized>;
430 template<borrowed_range _Rng>
432 __detail::__make_unsigned_like_t<range_difference_t<_Rng>>)
435 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
440 if constexpr (_Num == 0)
446 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
449 get(subrange<_It, _Sent, _Kind>&& __r)
451 if constexpr (_Num == 0)
457 template<
typename _It,
typename _Sent, subrange_kind _Kind>
458 inline constexpr bool
459 enable_borrowed_range<subrange<_It, _Sent, _Kind>> =
true;
461 template<range _Range>
462 using borrowed_subrange_t = __conditional_t<borrowed_range<_Range>,
463 subrange<iterator_t<_Range>>,
473 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
typename _Tp,
474 typename _Proj =
identity>
475 requires indirect_binary_predicate<ranges::equal_to,
476 projected<_Iter, _Proj>,
const _Tp*>
478 operator()(_Iter __first, _Sent __last,
479 const _Tp& __value, _Proj __proj = {})
const
481 while (__first != __last
487 template<input_range _Range,
typename _Tp,
typename _Proj =
identity>
488 requires indirect_binary_predicate<ranges::equal_to,
489 projected<iterator_t<_Range>, _Proj>,
491 constexpr borrowed_iterator_t<_Range>
492 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
494 return (*
this)(ranges::begin(__r), ranges::end(__r),
499 inline constexpr __find_fn find{};
503 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
504 typename _Proj =
identity,
505 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
507 operator()(_Iter __first, _Sent __last,
508 _Pred __pred, _Proj __proj = {})
const
510 while (__first != __last
516 template<input_range _Range,
typename _Proj = identity,
517 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
519 constexpr borrowed_iterator_t<_Range>
520 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
522 return (*
this)(ranges::begin(__r), ranges::end(__r),
527 inline constexpr __find_if_fn find_if{};
529 struct __find_if_not_fn
531 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
532 typename _Proj =
identity,
533 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
535 operator()(_Iter __first, _Sent __last,
536 _Pred __pred, _Proj __proj = {})
const
538 while (__first != __last
544 template<input_range _Range,
typename _Proj = identity,
545 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
547 constexpr borrowed_iterator_t<_Range>
548 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
550 return (*
this)(ranges::begin(__r), ranges::end(__r),
555 inline constexpr __find_if_not_fn find_if_not{};
557 template<
typename _Iter1,
typename _Iter2>
560 [[no_unique_address]] _Iter1 in1;
561 [[no_unique_address]] _Iter2 in2;
563 template<
typename _IIter1,
typename _IIter2>
564 requires convertible_to<const _Iter1&, _IIter1>
565 && convertible_to<const _Iter2&, _IIter2>
567 operator in_in_result<_IIter1, _IIter2>() const &
568 {
return {in1, in2}; }
570 template<
typename _IIter1,
typename _IIter2>
571 requires convertible_to<_Iter1, _IIter1>
572 && convertible_to<_Iter2, _IIter2>
574 operator in_in_result<_IIter1, _IIter2>() &&
578 template<
typename _Iter1,
typename _Iter2>
579 using mismatch_result = in_in_result<_Iter1, _Iter2>;
583 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
584 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
585 typename _Pred = ranges::equal_to,
586 typename _Proj1 =
identity,
typename _Proj2 =
identity>
587 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
588 constexpr mismatch_result<_Iter1, _Iter2>
589 operator()(_Iter1 __first1, _Sent1 __last1,
590 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
591 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
593 while (__first1 != __last1 && __first2 != __last2
604 template<input_range _Range1, input_range _Range2,
605 typename _Pred = ranges::equal_to,
606 typename _Proj1 = identity,
typename _Proj2 = identity>
607 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
608 _Pred, _Proj1, _Proj2>
609 constexpr mismatch_result<iterator_t<_Range1>, iterator_t<_Range2>>
610 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
611 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
613 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
614 ranges::begin(__r2), ranges::end(__r2),
620 inline constexpr __mismatch_fn mismatch{};
624 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
625 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
626 typename _Pred = ranges::equal_to,
627 typename _Proj1 =
identity,
typename _Proj2 =
identity>
628 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
629 constexpr subrange<_Iter1>
630 operator()(_Iter1 __first1, _Sent1 __last1,
631 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
632 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
634 if (__first1 == __last1 || __first2 == __last2)
635 return {__first1, __first1};
641 if (__first1 == __last1)
642 return {__first1, __first1};
649 auto __cur1 = __first1;
650 auto __cur2 = __first2;
653 if (++__cur2 == __last2)
654 return {__first1, ++__cur1};
655 if (++__cur1 == __last1)
656 return {__cur1, __cur1};
668 template<forward_range _Range1, forward_range _Range2,
669 typename _Pred = ranges::equal_to,
670 typename _Proj1 = identity,
typename _Proj2 = identity>
671 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
672 _Pred, _Proj1, _Proj2>
673 constexpr borrowed_subrange_t<_Range1>
674 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
675 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
677 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
678 ranges::begin(__r2), ranges::end(__r2),
684 inline constexpr __search_fn search{};
688 template<
typename _Tp,
typename _Proj = identity,
689 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
690 _Comp = ranges::less>
692 operator()(
const _Tp& __a,
const _Tp& __b,
693 _Comp __comp = {}, _Proj __proj = {})
const
703 template<input_range _Range,
typename _Proj = identity,
704 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
705 _Comp = ranges::less>
706 requires indirectly_copyable_storable<iterator_t<_Range>,
707 range_value_t<_Range>*>
708 constexpr range_value_t<_Range>
709 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
711 auto __first = ranges::begin(__r);
712 auto __last = ranges::end(__r);
713 __glibcxx_assert(__first != __last);
714 auto __result = *__first;
715 while (++__first != __last)
717 auto __tmp = *__first;
726 template<copyable _Tp,
typename _Proj = identity,
727 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
728 _Comp = ranges::less>
730 operator()(initializer_list<_Tp> __r,
731 _Comp __comp = {}, _Proj __proj = {})
const
733 return (*
this)(ranges::subrange(__r),
738 inline constexpr __min_fn min{};
740 struct __adjacent_find_fn
742 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
743 typename _Proj =
identity,
744 indirect_binary_predicate<projected<_Iter, _Proj>,
745 projected<_Iter, _Proj>> _Pred
748 operator()(_Iter __first, _Sent __last,
749 _Pred __pred = {}, _Proj __proj = {})
const
751 if (__first == __last)
753 auto __next = __first;
754 for (; ++__next != __last; __first = __next)
764 template<forward_range _Range,
typename _Proj = identity,
765 indirect_binary_predicate<
766 projected<iterator_t<_Range>, _Proj>,
767 projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
768 constexpr borrowed_iterator_t<_Range>
769 operator()(_Range&& __r, _Pred __pred = {}, _Proj __proj = {})
const
771 return (*
this)(ranges::begin(__r), ranges::end(__r),
776 inline constexpr __adjacent_find_fn adjacent_find{};
782 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
783 struct tuple_size<ranges::subrange<_Iter, _Sent, _Kind>>
784 : integral_constant<size_t, 2>
787 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
788 struct tuple_element<0, ranges::subrange<_Iter, _Sent, _Kind>>
789 {
using type = _Iter; };
791 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
792 struct tuple_element<1, ranges::subrange<_Iter, _Sent, _Kind>>
793 {
using type = _Sent; };
795 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
796 struct tuple_element<0, const ranges::subrange<_Iter, _Sent, _Kind>>
797 {
using type = _Iter; };
799 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
800 struct tuple_element<1, const ranges::subrange<_Iter, _Sent, _Kind>>
801 {
using type = _Sent; };
803_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 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.
[concept.derived], concept derived_from
[concept.convertible], concept convertible_to
[concept.defaultinitializable], concept default_initializable
[range.range] The range concept.
[range.range] The borrowed_range concept.
[range.sized] The sized_range concept.
[range.view] The ranges::view concept.
A range for which ranges::begin returns an input iterator.
A range for which ranges::begin returns a forward iterator.
A range for which ranges::begin returns a bidirectional iterator.
A range for which ranges::begin and ranges::end return the same type.