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 template<
typename _Tp,
typename _Up>
57 concept __different_from
58 = !same_as<remove_cvref_t<_Tp>, remove_cvref_t<_Up>>;
62 template<
typename _Derived>
63 requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
67 constexpr _Derived& _M_derived()
noexcept
71 return static_cast<_Derived&
>(*this);
74 constexpr const _Derived& _M_derived()
const noexcept
78 return static_cast<const _Derived&
>(*this);
82 _S_bool(
bool)
noexcept;
84 template<
typename _Tp>
87 noexcept(
noexcept(_S_bool(ranges::begin(__t) == ranges::end(__t))))
88 {
return ranges::begin(__t) == ranges::end(__t); }
90 template<
typename _Tp>
93 noexcept(
noexcept(ranges::end(__t) - ranges::begin(__t)))
94 {
return ranges::end(__t) - ranges::begin(__t); }
99 noexcept(
noexcept(_S_empty(_M_derived())))
101 {
return _S_empty(_M_derived()); }
105 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
107 {
return ranges::size(_M_derived()) == 0; }
111 noexcept(
noexcept(_S_empty(_M_derived())))
113 {
return _S_empty(_M_derived()); }
117 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
119 {
return ranges::size(_M_derived()) == 0; }
122 operator bool()
noexcept(
noexcept(ranges::empty(_M_derived())))
123 requires requires { ranges::empty(_M_derived()); }
124 {
return !ranges::empty(_M_derived()); }
127 operator bool()
const noexcept(
noexcept(ranges::empty(_M_derived())))
128 requires requires { ranges::empty(_M_derived()); }
129 {
return !ranges::empty(_M_derived()); }
132 data()
noexcept(
noexcept(ranges::begin(_M_derived())))
133 requires contiguous_iterator<iterator_t<_Derived>>
137 data()
const noexcept(
noexcept(ranges::begin(_M_derived())))
139 && contiguous_iterator<iterator_t<const _Derived>>
143 size()
noexcept(
noexcept(_S_size(_M_derived())))
145 && sized_sentinel_for<sentinel_t<_Derived>, iterator_t<_Derived>>
146 {
return _S_size(_M_derived()); }
149 size()
const noexcept(
noexcept(_S_size(_M_derived())))
151 && sized_sentinel_for<sentinel_t<const _Derived>,
152 iterator_t<const _Derived>>
153 {
return _S_size(_M_derived()); }
155 constexpr decltype(
auto)
158 __glibcxx_assert(!empty());
159 return *ranges::begin(_M_derived());
162 constexpr decltype(
auto)
165 __glibcxx_assert(!empty());
166 return *ranges::begin(_M_derived());
169 constexpr decltype(
auto)
173 __glibcxx_assert(!empty());
174 return *ranges::prev(ranges::end(_M_derived()));
177 constexpr decltype(
auto)
182 __glibcxx_assert(!empty());
183 return *ranges::prev(ranges::end(_M_derived()));
186 template<random_access_range _Range = _Derived>
187 constexpr decltype(
auto)
188 operator[](range_difference_t<_Range> __n)
189 {
return ranges::begin(_M_derived())[__n]; }
191 template<random_access_range _Range = const _Derived>
192 constexpr decltype(
auto)
193 operator[](range_difference_t<_Range> __n)
const
194 {
return ranges::begin(_M_derived())[__n]; }
199 template<
typename _From,
typename _To>
200 concept __uses_nonqualification_pointer_conversion
201 = is_pointer_v<_From> && is_pointer_v<_To>
205 template<
typename _From,
typename _To>
207 && !__uses_nonqualification_pointer_conversion<decay_t<_From>,
210 template<
typename _Tp>
212 = !is_reference_v<_Tp> &&
requires(_Tp __t)
216 typename tuple_element_t<0, remove_const_t<_Tp>>;
217 typename tuple_element_t<1, remove_const_t<_Tp>>;
219 { get<1>(__t) } -> convertible_to<const tuple_element_t<1, _Tp>&>;
222 template<
typename _Tp,
typename _Up,
typename _Vp>
223 concept __pair_like_convertible_from
224 = !range<_Tp> && __pair_like<_Tp>
225 && constructible_from<_Tp, _Up, _Vp>
226 && __convertible_to_non_slicing<_Up, tuple_element_t<0, _Tp>>
227 && convertible_to<_Vp, tuple_element_t<1, _Tp>>;
231 namespace views {
struct _Drop; }
233 enum class subrange_kind :
bool { unsized, sized };
236 template<input_or_output_iterator _It, sentinel_for<_It> _Sent = _It,
237 subrange_kind _Kind = sized_sentinel_for<_Sent, _It>
238 ? subrange_kind::sized : subrange_kind::unsized>
239 requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _It>)
243 static constexpr bool _S_store_size
244 = _Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _It>;
246 friend struct views::_Drop;
248 _It _M_begin = _It();
249 [[no_unique_address]] _Sent _M_end = _Sent();
252 = __detail::__make_unsigned_like_t<iter_difference_t<_It>>;
254 template<
typename,
bool = _S_store_size>
258 template<
typename _Tp>
259 struct _Size<_Tp, true>
262 [[no_unique_address]] _Size<__size_type> _M_size = {};
268 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s)
269 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
270 && is_nothrow_constructible_v<_Sent, _Sent&>)
271 requires (!_S_store_size)
276 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s,
278 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
279 && is_nothrow_constructible_v<_Sent, _Sent&>)
280 requires (_Kind == subrange_kind::sized)
283 if constexpr (_S_store_size)
284 _M_size._M_size = __n;
287 template<__detail::__different_from<subrange> _Rng>
289 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
293 noexcept(
noexcept(
subrange(__r, ranges::size(__r))))
298 template<__detail::__different_from<subrange> _Rng>
300 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
304 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r))))
305 requires (!_S_store_size)
306 :
subrange(ranges::begin(__r), ranges::end(__r))
309 template<borrowed_range _Rng>
310 requires __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
313 subrange(_Rng&& __r, __size_type __n)
314 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r), __n)))
315 requires (_Kind == subrange_kind::sized)
316 :
subrange{ranges::begin(__r), ranges::end(__r), __n}
319 template<__detail::__different_from<subrange> _PairLike>
320 requires __detail::__pair_like_convertible_from<_PairLike,
const _It&,
323 operator _PairLike()
const
324 {
return _PairLike(_M_begin, _M_end); }
327 begin()
const requires copyable<_It>
330 [[nodiscard]]
constexpr _It
331 begin()
requires (!copyable<_It>)
334 constexpr _Sent
end()
const {
return _M_end; }
336 constexpr bool empty()
const {
return _M_begin == _M_end; }
338 constexpr __size_type
339 size()
const requires (_Kind == subrange_kind::sized)
341 if constexpr (_S_store_size)
342 return _M_size._M_size;
344 return __detail::__to_unsigned_like(_M_end - _M_begin);
348 next(iter_difference_t<_It> __n = 1)
const &
349 requires forward_iterator<_It>
357 next(iter_difference_t<_It> __n = 1) &&
364 prev(iter_difference_t<_It> __n = 1)
const
365 requires bidirectional_iterator<_It>
373 advance(iter_difference_t<_It> __n)
377 if constexpr (bidirectional_iterator<_It>)
380 ranges::advance(_M_begin, __n);
381 if constexpr (_S_store_size)
382 _M_size._M_size += __detail::__to_unsigned_like(-__n);
386 __glibcxx_assert(__n >= 0);
387 auto __d = __n - ranges::advance(_M_begin, __n, _M_end);
388 if constexpr (_S_store_size)
389 _M_size._M_size -= __detail::__to_unsigned_like(__d);
394 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
397 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
399 __detail::__make_unsigned_like_t<iter_difference_t<_It>>)
402 template<borrowed_range _Rng>
406 || sized_sentinel_for<sentinel_t<_Rng>, iterator_t<_Rng>>)
407 ? subrange_kind::sized : subrange_kind::unsized>;
409 template<borrowed_range _Rng>
411 __detail::__make_unsigned_like_t<range_difference_t<_Rng>>)
414 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
419 if constexpr (_Num == 0)
425 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
428 get(subrange<_It, _Sent, _Kind>&& __r)
430 if constexpr (_Num == 0)
436 template<
typename _It,
typename _Sent, subrange_kind _Kind>
437 inline constexpr bool
438 enable_borrowed_range<subrange<_It, _Sent, _Kind>> =
true;
440 template<range _Range>
441 using borrowed_subrange_t = __conditional_t<borrowed_range<_Range>,
442 subrange<iterator_t<_Range>>,
452 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
typename _Tp,
453 typename _Proj =
identity>
454 requires indirect_binary_predicate<ranges::equal_to,
455 projected<_Iter, _Proj>,
const _Tp*>
457 operator()(_Iter __first, _Sent __last,
458 const _Tp& __value, _Proj __proj = {})
const
460 while (__first != __last
466 template<input_range _Range,
typename _Tp,
typename _Proj =
identity>
467 requires indirect_binary_predicate<ranges::equal_to,
468 projected<iterator_t<_Range>, _Proj>,
470 constexpr borrowed_iterator_t<_Range>
471 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
473 return (*
this)(ranges::begin(__r), ranges::end(__r),
478 inline constexpr __find_fn find{};
482 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
483 typename _Proj =
identity,
484 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
486 operator()(_Iter __first, _Sent __last,
487 _Pred __pred, _Proj __proj = {})
const
489 while (__first != __last
495 template<input_range _Range,
typename _Proj = identity,
496 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
498 constexpr borrowed_iterator_t<_Range>
499 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
501 return (*
this)(ranges::begin(__r), ranges::end(__r),
506 inline constexpr __find_if_fn find_if{};
508 struct __find_if_not_fn
510 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
511 typename _Proj =
identity,
512 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
514 operator()(_Iter __first, _Sent __last,
515 _Pred __pred, _Proj __proj = {})
const
517 while (__first != __last
523 template<input_range _Range,
typename _Proj = identity,
524 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
526 constexpr borrowed_iterator_t<_Range>
527 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
529 return (*
this)(ranges::begin(__r), ranges::end(__r),
534 inline constexpr __find_if_not_fn find_if_not{};
536 template<
typename _Iter1,
typename _Iter2>
539 [[no_unique_address]] _Iter1 in1;
540 [[no_unique_address]] _Iter2 in2;
542 template<
typename _IIter1,
typename _IIter2>
543 requires convertible_to<const _Iter1&, _IIter1>
544 && convertible_to<const _Iter2&, _IIter2>
546 operator in_in_result<_IIter1, _IIter2>() const &
547 {
return {in1, in2}; }
549 template<
typename _IIter1,
typename _IIter2>
550 requires convertible_to<_Iter1, _IIter1>
551 && convertible_to<_Iter2, _IIter2>
553 operator in_in_result<_IIter1, _IIter2>() &&
557 template<
typename _Iter1,
typename _Iter2>
558 using mismatch_result = in_in_result<_Iter1, _Iter2>;
562 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
563 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
564 typename _Pred = ranges::equal_to,
565 typename _Proj1 =
identity,
typename _Proj2 =
identity>
566 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
567 constexpr mismatch_result<_Iter1, _Iter2>
568 operator()(_Iter1 __first1, _Sent1 __last1,
569 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
570 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
572 while (__first1 != __last1 && __first2 != __last2
583 template<input_range _Range1, input_range _Range2,
584 typename _Pred = ranges::equal_to,
585 typename _Proj1 = identity,
typename _Proj2 = identity>
586 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
587 _Pred, _Proj1, _Proj2>
588 constexpr mismatch_result<iterator_t<_Range1>, iterator_t<_Range2>>
589 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
590 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
592 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
593 ranges::begin(__r2), ranges::end(__r2),
599 inline constexpr __mismatch_fn mismatch{};
603 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
604 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
605 typename _Pred = ranges::equal_to,
606 typename _Proj1 =
identity,
typename _Proj2 =
identity>
607 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
608 constexpr subrange<_Iter1>
609 operator()(_Iter1 __first1, _Sent1 __last1,
610 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
611 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
613 if (__first1 == __last1 || __first2 == __last2)
614 return {__first1, __first1};
620 if (__first1 == __last1)
621 return {__first1, __first1};
628 auto __cur1 = __first1;
629 auto __cur2 = __first2;
632 if (++__cur2 == __last2)
633 return {__first1, ++__cur1};
634 if (++__cur1 == __last1)
635 return {__cur1, __cur1};
647 template<forward_range _Range1, forward_range _Range2,
648 typename _Pred = ranges::equal_to,
649 typename _Proj1 = identity,
typename _Proj2 = identity>
650 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
651 _Pred, _Proj1, _Proj2>
652 constexpr borrowed_subrange_t<_Range1>
653 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
654 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
656 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
657 ranges::begin(__r2), ranges::end(__r2),
663 inline constexpr __search_fn search{};
667 template<
typename _Tp,
typename _Proj = identity,
668 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
669 _Comp = ranges::less>
671 operator()(
const _Tp& __a,
const _Tp& __b,
672 _Comp __comp = {}, _Proj __proj = {})
const
682 template<input_range _Range,
typename _Proj = identity,
683 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
684 _Comp = ranges::less>
685 requires indirectly_copyable_storable<iterator_t<_Range>,
686 range_value_t<_Range>*>
687 constexpr range_value_t<_Range>
688 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
690 auto __first = ranges::begin(__r);
691 auto __last = ranges::end(__r);
692 __glibcxx_assert(__first != __last);
693 auto __result = *__first;
694 while (++__first != __last)
696 auto __tmp = *__first;
705 template<copyable _Tp,
typename _Proj = identity,
706 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
707 _Comp = ranges::less>
709 operator()(initializer_list<_Tp> __r,
710 _Comp __comp = {}, _Proj __proj = {})
const
712 return (*
this)(ranges::subrange(__r),
717 inline constexpr __min_fn min{};
719 struct __adjacent_find_fn
721 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
722 typename _Proj =
identity,
723 indirect_binary_predicate<projected<_Iter, _Proj>,
724 projected<_Iter, _Proj>> _Pred
727 operator()(_Iter __first, _Sent __last,
728 _Pred __pred = {}, _Proj __proj = {})
const
730 if (__first == __last)
732 auto __next = __first;
733 for (; ++__next != __last; __first = __next)
743 template<forward_range _Range,
typename _Proj = identity,
744 indirect_binary_predicate<
745 projected<iterator_t<_Range>, _Proj>,
746 projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
747 constexpr borrowed_iterator_t<_Range>
748 operator()(_Range&& __r, _Pred __pred = {}, _Proj __proj = {})
const
750 return (*
this)(ranges::begin(__r), ranges::end(__r),
755 inline constexpr __adjacent_find_fn adjacent_find{};
761 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
762 struct tuple_size<ranges::subrange<_Iter, _Sent, _Kind>>
763 : integral_constant<size_t, 2>
766 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
767 struct tuple_element<0, ranges::subrange<_Iter, _Sent, _Kind>>
768 {
using type = _Iter; };
770 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
771 struct tuple_element<1, ranges::subrange<_Iter, _Sent, _Kind>>
772 {
using type = _Sent; };
774 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
775 struct tuple_element<0, const ranges::subrange<_Iter, _Sent, _Kind>>
776 {
using type = _Iter; };
778 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
779 struct tuple_element<1, const ranges::subrange<_Iter, _Sent, _Kind>>
780 {
using type = _Sent; };
782_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 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.
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 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.