31#define _RANGES_UTIL_H 1
33#if __cplusplus > 201703L
39#ifdef __glibcxx_ranges
40namespace std _GLIBCXX_VISIBILITY(default)
42_GLIBCXX_BEGIN_NAMESPACE_VERSION
49 template<
typename _Range>
50 concept __simple_view = view<_Range> && range<const _Range>
51 && same_as<iterator_t<_Range>, iterator_t<const _Range>>
52 && same_as<sentinel_t<_Range>, sentinel_t<const _Range>>;
54 template<
typename _It>
55 concept __has_arrow = input_iterator<_It>
56 && (is_pointer_v<_It> ||
requires(_It __it) { __it.operator->(); });
58 using std::__detail::__different_from;
62 template<
typename _Derived>
63 requires is_class_v<_Derived> && same_as<_Derived, remove_cv_t<_Derived>>
67 constexpr _Derived& _M_derived()
noexcept
69 static_assert(derived_from<_Derived, view_interface<_Derived>>);
70 static_assert(view<_Derived>);
71 return static_cast<_Derived&
>(*this);
74 constexpr const _Derived& _M_derived()
const noexcept
76 static_assert(derived_from<_Derived, view_interface<_Derived>>);
77 static_assert(view<_Derived>);
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())))
100 requires forward_range<_Derived> && (!sized_range<_Derived>)
101 {
return _S_empty(_M_derived()); }
105 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
106 requires sized_range<_Derived>
107 {
return ranges::size(_M_derived()) == 0; }
111 noexcept(
noexcept(_S_empty(_M_derived())))
112 requires forward_range<const _Derived> && (!sized_range<const _Derived>)
113 {
return _S_empty(_M_derived()); }
117 noexcept(
noexcept(ranges::size(_M_derived()) == 0))
118 requires sized_range<const _Derived>
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())))
138 requires range<const _Derived>
139 && contiguous_iterator<iterator_t<const _Derived>>
143 size()
noexcept(
noexcept(_S_size(_M_derived())))
144 requires forward_range<_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())))
150 requires forward_range<const _Derived>
151 && sized_sentinel_for<sentinel_t<const _Derived>,
152 iterator_t<const _Derived>>
153 {
return _S_size(_M_derived()); }
155 constexpr decltype(
auto)
156 front()
requires forward_range<_Derived>
158 __glibcxx_assert(!empty());
159 return *ranges::begin(_M_derived());
162 constexpr decltype(
auto)
163 front()
const requires forward_range<const _Derived>
165 __glibcxx_assert(!empty());
166 return *ranges::begin(_M_derived());
169 constexpr decltype(
auto)
171 requires bidirectional_range<_Derived> && common_range<_Derived>
173 __glibcxx_assert(!empty());
174 return *ranges::prev(ranges::end(_M_derived()));
177 constexpr decltype(
auto)
179 requires bidirectional_range<const _Derived>
180 && common_range<const _Derived>
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]; }
196#if __cplusplus > 202002L
198 cbegin()
requires input_range<_Derived>
199 {
return ranges::cbegin(_M_derived()); }
202 cbegin()
const requires input_range<const _Derived>
203 {
return ranges::cbegin(_M_derived()); }
206 cend()
requires input_range<_Derived>
207 {
return ranges::cend(_M_derived()); }
210 cend()
const requires input_range<const _Derived>
211 {
return ranges::cend(_M_derived()); }
217 template<
typename _From,
typename _To>
218 concept __uses_nonqualification_pointer_conversion
219 = is_pointer_v<_From> && is_pointer_v<_To>
220 && !convertible_to<remove_pointer_t<_From>(*)[],
223 template<
typename _From,
typename _To>
224 concept __convertible_to_non_slicing = convertible_to<_From, _To>
225 && !__uses_nonqualification_pointer_conversion<decay_t<_From>,
228#if __glibcxx_tuple_like
232 template<
typename _Tp>
234 = !is_reference_v<_Tp> &&
requires(_Tp __t)
238 typename tuple_element_t<0, remove_const_t<_Tp>>;
239 typename tuple_element_t<1, remove_const_t<_Tp>>;
240 { get<0>(__t) } -> convertible_to<const tuple_element_t<0, _Tp>&>;
241 { get<1>(__t) } -> convertible_to<const tuple_element_t<1, _Tp>&>;
245 template<
typename _Tp,
typename _Up,
typename _Vp>
246 concept __pair_like_convertible_from
247 = !range<_Tp> && !is_reference_v<_Vp> && __pair_like<_Tp>
248 && constructible_from<_Tp, _Up, _Vp>
249 && __convertible_to_non_slicing<_Up, tuple_element_t<0, _Tp>>
250 && convertible_to<_Vp, tuple_element_t<1, _Tp>>;
254 namespace views {
struct _Drop; }
256 enum class subrange_kind :
bool { unsized, sized };
259 template<input_or_output_iterator _It, sentinel_for<_It> _Sent = _It,
260 subrange_kind _Kind = sized_sentinel_for<_Sent, _It>
261 ? subrange_kind::sized : subrange_kind::unsized>
262 requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _It>)
266 static constexpr bool _S_store_size
267 = _Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _It>;
269 friend struct views::_Drop;
271 _It _M_begin = _It();
272 [[no_unique_address]] _Sent _M_end = _Sent();
275 = __detail::__make_unsigned_like_t<iter_difference_t<_It>>;
277 template<
typename _Tp,
bool = _S_store_size>
280 [[__gnu__::__always_inline__]]
281 constexpr _Size(_Tp = {}) { }
284 template<
typename _Tp>
285 struct _Size<_Tp, true>
287 [[__gnu__::__always_inline__]]
288 constexpr _Size(_Tp __s = {}) : _M_size(__s) { }
293 [[no_unique_address]] _Size<__size_type> _M_size = {};
296 subrange()
requires default_initializable<_It> =
default;
299 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s)
300 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
301 && is_nothrow_constructible_v<_Sent, _Sent&>)
302 requires (!_S_store_size)
307 subrange(__detail::__convertible_to_non_slicing<_It>
auto __i, _Sent __s,
309 noexcept(is_nothrow_constructible_v<_It,
decltype(__i)>
310 && is_nothrow_constructible_v<_Sent, _Sent&>)
311 requires (_Kind == subrange_kind::sized)
312 : _M_begin(
std::move(__i)), _M_end(__s), _M_size(__n)
315 template<__detail::__different_from<subrange> _Rng>
316 requires borrowed_range<_Rng>
317 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
318 && convertible_to<sentinel_t<_Rng>, _Sent>
321 noexcept(
noexcept(
subrange(__r, ranges::size(__r))))
322 requires _S_store_size && sized_range<_Rng>
326 template<__detail::__different_from<subrange> _Rng>
327 requires borrowed_range<_Rng>
328 && __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
329 && convertible_to<sentinel_t<_Rng>, _Sent>
332 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r))))
333 requires (!_S_store_size)
334 :
subrange(ranges::begin(__r), ranges::end(__r))
337 template<borrowed_range _Rng>
338 requires __detail::__convertible_to_non_slicing<iterator_t<_Rng>, _It>
339 && convertible_to<sentinel_t<_Rng>, _Sent>
341 subrange(_Rng&& __r, __size_type __n)
342 noexcept(
noexcept(
subrange(ranges::begin(__r), ranges::end(__r), __n)))
343 requires (_Kind == subrange_kind::sized)
344 :
subrange{ranges::begin(__r), ranges::end(__r), __n}
347 template<__detail::__different_from<subrange> _PairLike>
348 requires __detail::__pair_like_convertible_from<_PairLike,
const _It&,
351 operator _PairLike()
const
352 {
return _PairLike(_M_begin, _M_end); }
355 begin()
const requires copyable<_It>
358 [[nodiscard]]
constexpr _It
359 begin()
requires (!copyable<_It>)
362 constexpr _Sent
end()
const {
return _M_end; }
364 constexpr bool empty()
const {
return _M_begin == _M_end; }
366 constexpr __size_type
367 size()
const requires (_Kind == subrange_kind::sized)
369 if constexpr (_S_store_size)
370 return _M_size._M_size;
372 return __detail::__to_unsigned_like(_M_end - _M_begin);
376 next(iter_difference_t<_It> __n = 1)
const &
377 requires forward_iterator<_It>
385 next(iter_difference_t<_It> __n = 1) &&
392 prev(iter_difference_t<_It> __n = 1)
const
393 requires bidirectional_iterator<_It>
401 advance(iter_difference_t<_It> __n)
405 if constexpr (bidirectional_iterator<_It>)
408 ranges::advance(_M_begin, __n);
409 if constexpr (_S_store_size)
410 _M_size._M_size += __detail::__to_unsigned_like(-__n);
414 __glibcxx_assert(__n >= 0);
415 auto __d = __n - ranges::advance(_M_begin, __n, _M_end);
416 if constexpr (_S_store_size)
417 _M_size._M_size -= __detail::__to_unsigned_like(__d);
422 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
425 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
427 __detail::__make_unsigned_like_t<iter_difference_t<_It>>)
430 template<borrowed_range _Rng>
434 || sized_sentinel_for<sentinel_t<_Rng>, iterator_t<_Rng>>)
435 ? subrange_kind::sized : subrange_kind::unsized>;
437 template<borrowed_range _Rng>
439 __detail::__make_unsigned_like_t<range_difference_t<_Rng>>)
445 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
446 requires ((_Num == 0 && copyable<_It>) || _Num == 1)
450 if constexpr (_Num == 0)
456 template<
size_t _Num,
class _It,
class _Sent, subrange_kind _Kind>
459 get(subrange<_It, _Sent, _Kind>&& __r)
461 if constexpr (_Num == 0)
467 template<
typename _It,
typename _Sent, subrange_kind _Kind>
468 inline constexpr bool
469 enable_borrowed_range<subrange<_It, _Sent, _Kind>> =
true;
471 template<range _Range>
472 using borrowed_subrange_t = __conditional_t<borrowed_range<_Range>,
473 subrange<iterator_t<_Range>>,
477 template<
typename _Iter,
typename _Sent, subrange_kind _Kind>
478 inline constexpr bool __detail::__is_subrange<subrange<_Iter, _Sent, _Kind>> =
true;
481#if __glibcxx_tuple_like
483 template<
typename _It,
typename _Sent, ranges::subrange_kind _Kind>
484 inline constexpr bool __is_tuple_like_v<ranges::subrange<_It, _Sent, _Kind>> =
true;
493 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
494 typename _Proj =
identity,
495 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
496 requires indirect_binary_predicate<ranges::equal_to,
497 projected<_Iter, _Proj>,
const _Tp*>
499 operator()(_Iter __first, _Sent __last,
500 const _Tp& __value, _Proj __proj = {})
const
502 if constexpr (is_same_v<_Proj, identity>)
503 if constexpr(__can_use_memchr_for_find<iter_value_t<_Iter>, _Tp>)
504 if constexpr (sized_sentinel_for<_Sent, _Iter>)
505 if constexpr (contiguous_iterator<_Iter>)
506 if (!is_constant_evaluated())
508 using _Vt = iter_value_t<_Iter>;
509 auto __n = __last - __first;
510 if (
static_cast<_Vt
>(__value) == __value) [[likely]]
513 const size_t __nu =
static_cast<size_t>(__n);
514 const int __ival =
static_cast<int>(__value);
516 if (
auto __p1 = __builtin_memchr(__p0, __ival, __nu))
517 __n = (
const char*)__p1 - (
const char*)__p0;
519 return __first + __n;
522 while (__first != __last
528 template<input_range _Range,
typename _Proj = identity,
530 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
531 requires indirect_binary_predicate<ranges::equal_to,
532 projected<iterator_t<_Range>, _Proj>,
534 constexpr borrowed_iterator_t<_Range>
535 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
537 return (*
this)(ranges::begin(__r), ranges::end(__r),
542 inline constexpr __find_fn find{};
546 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
547 typename _Proj =
identity,
548 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
550 operator()(_Iter __first, _Sent __last,
551 _Pred __pred, _Proj __proj = {})
const
553 while (__first != __last
559 template<input_range _Range,
typename _Proj = identity,
560 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
562 constexpr borrowed_iterator_t<_Range>
563 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
565 return (*
this)(ranges::begin(__r), ranges::end(__r),
570 inline constexpr __find_if_fn find_if{};
572 struct __find_if_not_fn
574 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
575 typename _Proj =
identity,
576 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
578 operator()(_Iter __first, _Sent __last,
579 _Pred __pred, _Proj __proj = {})
const
581 while (__first != __last
587 template<input_range _Range,
typename _Proj = identity,
588 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
590 constexpr borrowed_iterator_t<_Range>
591 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
593 return (*
this)(ranges::begin(__r), ranges::end(__r),
598 inline constexpr __find_if_not_fn find_if_not{};
600 template<
typename _Iter1,
typename _Iter2>
603 [[no_unique_address]] _Iter1 in1;
604 [[no_unique_address]] _Iter2 in2;
606 template<
typename _IIter1,
typename _IIter2>
607 requires convertible_to<const _Iter1&, _IIter1>
608 && convertible_to<const _Iter2&, _IIter2>
610 operator in_in_result<_IIter1, _IIter2>() const &
611 {
return {in1, in2}; }
613 template<
typename _IIter1,
typename _IIter2>
614 requires convertible_to<_Iter1, _IIter1>
615 && convertible_to<_Iter2, _IIter2>
617 operator in_in_result<_IIter1, _IIter2>() &&
621 template<
typename _Iter1,
typename _Iter2>
622 using mismatch_result = in_in_result<_Iter1, _Iter2>;
626 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
627 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
628 typename _Pred = ranges::equal_to,
629 typename _Proj1 =
identity,
typename _Proj2 =
identity>
630 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
631 constexpr mismatch_result<_Iter1, _Iter2>
632 operator()(_Iter1 __first1, _Sent1 __last1,
633 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
634 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
636 while (__first1 != __last1 && __first2 != __last2
647 template<input_range _Range1, input_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 mismatch_result<iterator_t<_Range1>, iterator_t<_Range2>>
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 __mismatch_fn mismatch{};
667 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
668 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
669 typename _Pred = ranges::equal_to,
670 typename _Proj1 =
identity,
typename _Proj2 =
identity>
671 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
672 constexpr subrange<_Iter1>
673 operator()(_Iter1 __first1, _Sent1 __last1,
674 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
675 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
677 if (__first1 == __last1 || __first2 == __last2)
678 return {__first1, __first1};
684 if (__first1 == __last1)
685 return {__first1, __first1};
692 auto __cur1 = __first1;
693 auto __cur2 = __first2;
696 if (++__cur2 == __last2)
697 return {__first1, ++__cur1};
698 if (++__cur1 == __last1)
699 return {__cur1, __cur1};
711 template<forward_range _Range1, forward_range _Range2,
712 typename _Pred = ranges::equal_to,
713 typename _Proj1 = identity,
typename _Proj2 = identity>
714 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
715 _Pred, _Proj1, _Proj2>
716 constexpr borrowed_subrange_t<_Range1>
717 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
718 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
720 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
721 ranges::begin(__r2), ranges::end(__r2),
727 inline constexpr __search_fn search{};
731 template<
typename _Tp,
typename _Proj = identity,
732 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
733 _Comp = ranges::less>
735 operator()(
const _Tp& __a,
const _Tp& __b,
736 _Comp __comp = {}, _Proj __proj = {})
const
746 template<input_range _Range,
typename _Proj = identity,
747 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
748 _Comp = ranges::less>
749 requires indirectly_copyable_storable<iterator_t<_Range>,
750 range_value_t<_Range>*>
751 constexpr range_value_t<_Range>
752 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
754 auto __first = ranges::begin(__r);
755 auto __last = ranges::end(__r);
756 __glibcxx_assert(__first != __last);
757 auto __result = *__first;
758 while (++__first != __last)
760 auto&& __tmp = *__first;
769 template<copyable _Tp,
typename _Proj = identity,
770 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
771 _Comp = ranges::less>
773 operator()(initializer_list<_Tp> __r,
774 _Comp __comp = {}, _Proj __proj = {})
const
776 return (*
this)(ranges::subrange(__r),
781 inline constexpr __min_fn min{};
783 struct __adjacent_find_fn
785 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
786 typename _Proj =
identity,
787 indirect_binary_predicate<projected<_Iter, _Proj>,
788 projected<_Iter, _Proj>> _Pred
791 operator()(_Iter __first, _Sent __last,
792 _Pred __pred = {}, _Proj __proj = {})
const
794 if (__first == __last)
796 auto __next = __first;
797 for (; ++__next != __last; __first = __next)
807 template<forward_range _Range,
typename _Proj = identity,
808 indirect_binary_predicate<
809 projected<iterator_t<_Range>, _Proj>,
810 projected<iterator_t<_Range>, _Proj>> _Pred = ranges::equal_to>
811 constexpr borrowed_iterator_t<_Range>
812 operator()(_Range&& __r, _Pred __pred = {}, _Proj __proj = {})
const
814 return (*
this)(ranges::begin(__r), ranges::end(__r),
819 inline constexpr __adjacent_find_fn adjacent_find{};
825 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
826 struct tuple_size<ranges::subrange<_Iter, _Sent, _Kind>>
827 : integral_constant<size_t, 2>
830 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
831 struct tuple_element<0, ranges::subrange<_Iter, _Sent, _Kind>>
832 {
using type = _Iter; };
834 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
835 struct tuple_element<1, ranges::subrange<_Iter, _Sent, _Kind>>
836 {
using type = _Sent; };
838 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
839 struct tuple_element<0, const ranges::subrange<_Iter, _Sent, _Kind>>
840 {
using type = _Iter; };
842 template<
typename _Iter,
typename _Sent, ranges::subrange_kind _Kind>
843 struct tuple_element<1, const ranges::subrange<_Iter, _Sent, _Kind>>
844 {
using type = _Sent; };
846_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.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
_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.