.TH "std::counted_iterator< _It >" 3 "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::counted_iterator< _It > \- An iterator adaptor that keeps track of the distance to the end\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fR#include <iterator>\fP
.SS "Public Types"

.in +1c
.ti -1c
.RI "using \fBdifference_type\fP"
.br
.ti -1c
.RI "using \fBiterator_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "constexpr \fBcounted_iterator\fP (_It __i, iter_difference_t< _It > __n)"
.br
.ti -1c
.RI "template<typename _It2> constexpr \fBcounted_iterator\fP (const counted_iterator< _It2 > &__x)"
.br
.ti -1c
.RI "constexpr _It \fBbase\fP () &&noexcept(is_nothrow_move_constructible_v< _It >)"
.br
.ti -1c
.RI "constexpr const _It & \fBbase\fP () const &noexcept"
.br
.ti -1c
.RI "constexpr iter_difference_t< _It > \fBcount\fP () const noexcept"
.br
.ti -1c
.RI "constexpr decltype(auto) \fBoperator*\fP () const noexcept(noexcept(*_M_current))"
.br
.ti -1c
.RI "constexpr decltype(auto) \fBoperator*\fP () noexcept(noexcept(*_M_current))"
.br
.ti -1c
.RI "constexpr counted_iterator \fBoperator+\fP (iter_difference_t< _It > __n) const"
.br
.ti -1c
.RI "constexpr counted_iterator & \fBoperator++\fP ()"
.br
.ti -1c
.RI "constexpr counted_iterator \fBoperator++\fP (int)"
.br
.ti -1c
.RI "constexpr decltype(auto) \fBoperator++\fP (int)"
.br
.ti -1c
.RI "constexpr counted_iterator & \fBoperator+=\fP (iter_difference_t< _It > __n)"
.br
.ti -1c
.RI "constexpr counted_iterator \fBoperator\-\fP (iter_difference_t< _It > __n) const"
.br
.ti -1c
.RI "constexpr counted_iterator & \fBoperator\-\-\fP ()"
.br
.ti -1c
.RI "constexpr counted_iterator \fBoperator\-\-\fP (int)"
.br
.ti -1c
.RI "constexpr counted_iterator & \fBoperator\-=\fP (iter_difference_t< _It > __n)"
.br
.ti -1c
.RI "constexpr auto \fBoperator\->\fP () const noexcept"
.br
.ti -1c
.RI "template<typename _It2> constexpr counted_iterator & \fBoperator=\fP (const counted_iterator< _It2 > &__x)"
.br
.ti -1c
.RI "constexpr decltype(auto) \fBoperator[]\fP (iter_difference_t< _It > __n) const noexcept(noexcept(_M_current[__n]))"
.br
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "constexpr \fBiter_rvalue_reference_t\fP< _It > \fBiter_move\fP (const counted_iterator &__i) noexcept(noexcept(ranges::iter_move(__i\&._M_current)))"
.br
.ti -1c
.RI "template<indirectly_swappable< _It > _It2> constexpr void \fBiter_swap\fP (const counted_iterator &__x, const counted_iterator< _It2 > &__y) noexcept(noexcept(ranges::iter_swap(__x\&._M_current, __y\&._M_current)))"
.br
.ti -1c
.RI "constexpr counted_iterator \fBoperator+\fP (iter_difference_t< _It > __n, const counted_iterator &__x)"
.br
.ti -1c
.RI "template<common_with< _It > _It2> constexpr iter_difference_t< _It2 > \fBoperator\-\fP (const counted_iterator &__x, const counted_iterator< _It2 > &__y) noexcept"
.br
.ti -1c
.RI "constexpr iter_difference_t< _It > \fBoperator\-\fP (const counted_iterator &__x, \fBdefault_sentinel_t\fP) noexcept"
.br
.ti -1c
.RI "constexpr iter_difference_t< _It > \fBoperator\-\fP (\fBdefault_sentinel_t\fP, const counted_iterator &__y) noexcept"
.br
.ti -1c
.RI "template<common_with< _It > _It2> constexpr strong_ordering \fBoperator<=>\fP (const counted_iterator &__x, const counted_iterator< _It2 > &__y) noexcept"
.br
.ti -1c
.RI "template<common_with< _It > _It2> constexpr bool \fBoperator==\fP (const counted_iterator &__x, const counted_iterator< _It2 > &__y) noexcept"
.br
.ti -1c
.RI "constexpr bool \fBoperator==\fP (const counted_iterator &__x, \fBdefault_sentinel_t\fP) noexcept"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<input_or_output_iterator _It>
.br
class std::counted_iterator< _It >"An iterator adaptor that keeps track of the distance to the end\&. 

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.