STLdoc
STLdocumentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Public Types | Public Member Functions | Static Public Member Functions | Public Attributes | List of all members
cliext::ConstUncheckedRandomAccessIterator< _Cont_t > Class Template Reference
Inheritance diagram for cliext::ConstUncheckedRandomAccessIterator< _Cont_t >:

Public Types

typedef _Cont_t::value_type _Value_t
 
typedef ConstUncheckedRandomAccessIterator< _Cont_t > _Mytype_t
 
typedef _STLCLR Generic::IRandomAccessIterator< _Value_t_Myiter_t
 
typedef random_access_iterator_tag iterator_category
 
typedef _Value_t value_type
 
typedef int difference_type
 
typedef value_type pointer
 
typedef value_type reference
 
typedef value_type const_reference
 
typedef _STLCLR Generic::ConstContainerRandomAccessIterator< _Value_t_Mygeniter_t
 

Public Member Functions

 ConstUncheckedRandomAccessIterator (_Cont_t^_Cont, int _Offset)
 
 operator ConstRandomAccessIterator< _Cont_t > ()
 
 ConstUncheckedRandomAccessIterator (_Mygeniter_t%_Right)
 
 operator _Mygeniter_t ()
 
virtual System::Object Clone ()
 
int get_bias ()
 
System::Object get_node ()
 
bool valid ()
 
System::Object container ()
 
void next ()
 
bool equal_to (_STLCLR Generic::IInputIterator< _Value_t >^_Right)
 
bool equal_to (_Mytype_t%_Right)
 
const_reference get_cref ()
 
reference get_ref ()
 
void prev ()
 
difference_type move (difference_type _Offset)
 
difference_type distance (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
 
difference_type distance (_Mytype_t%_Right)
 
bool less_than (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
 
bool less_than (_Mytype_t%_Right)
 
bool operator== (_STLCLR Generic::IInputIterator< _Value_t >^_Right)
 
bool operator== (_Mytype_t%_Right)
 
bool operator!= (_STLCLR Generic::IInputIterator< _Value_t >^_Right)
 
bool operator!= (_Mytype_t%_Right)
 
difference_type operator- (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
 
bool operator< (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
 
bool operator< (_Mytype_t%_Right)
 
bool operator>= (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
 
bool operator>= (_Mytype_t%_Right)
 
bool operator> (_Mytype_t%_Right)
 
bool operator<= (_Mytype_t%_Right)
 

Static Public Member Functions

static const_reference operator-> (ConstUncheckedRandomAccessIterator%_Left)
 
static const_reference operator* (ConstUncheckedRandomAccessIterator%_Left)
 
static ConstUncheckedRandomAccessIterator operator++ (ConstUncheckedRandomAccessIterator%_Left)
 
static ConstUncheckedRandomAccessIterator operator-- (ConstUncheckedRandomAccessIterator%_Left)
 
static ConstUncheckedRandomAccessIterator operator+ (ConstUncheckedRandomAccessIterator%_Left, difference_type _Right)
 
static ConstUncheckedRandomAccessIterator operator+ (difference_type _Left, ConstUncheckedRandomAccessIterator _Right)
 
static ConstUncheckedRandomAccessIterator operator- (ConstUncheckedRandomAccessIterator%_Left, difference_type _Right)
 
static bool operator> (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Left, _Mytype_t%_Right)
 
static bool operator<= (_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Left, _Mytype_t%_Right)
 

Public Attributes

property const_reference default [difference_type]
 
_STLCLR_FIELD_ACCESS __pad0__: _Cont_t^ _Mycont
 
difference_type _Myoffset
 

Member Typedef Documentation

template<typename _Cont_t >
typedef _STLCLR Generic::ConstContainerRandomAccessIterator<_Value_t> cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::_Mygeniter_t
template<typename _Cont_t >
typedef _STLCLR Generic::IRandomAccessIterator<_Value_t> cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::_Myiter_t
template<typename _Cont_t >
typedef ConstUncheckedRandomAccessIterator<_Cont_t> cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::_Mytype_t
template<typename _Cont_t >
typedef _Cont_t::value_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::_Value_t
template<typename _Cont_t >
typedef value_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::const_reference
template<typename _Cont_t >
typedef int cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::difference_type
template<typename _Cont_t >
typedef value_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::pointer
template<typename _Cont_t >
typedef value_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::reference
template<typename _Cont_t >
typedef _Value_t cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::value_type

Constructor & Destructor Documentation

template<typename _Cont_t >
cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::ConstUncheckedRandomAccessIterator ( _Cont_t^  _Cont,
int  _Offset 
)
inline
1712  : _Mycont(_Cont), _Myoffset(_Offset)
1713  { // construct from container pointer and offset
1714  }
difference_type _Myoffset
Definition: iterator:1998
_Check_return_ _Ret_maybenull_ _In_ size_t _In_ size_t _Offset
Definition: corecrt_malloc.h:159
template<typename _Cont_t >
cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::ConstUncheckedRandomAccessIterator ( _Mygeniter_t _Right)
inline
1726  : _Mycont((_Cont_t^)_Right.container()),
1727  _Myoffset(_Right.get_bias())
1728  { // construct by copying a generic iterator
1729  }
difference_type _Myoffset
Definition: iterator:1998
constexpr const _Ty &() _Right
Definition: algorithm:3723

Member Function Documentation

template<typename _Cont_t >
virtual System::Object cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::Clone ( )
inlinevirtual
1738  { // return a copy
1739  return (gcnew ConstUncheckedRandomAccessIterator(_Mycont, _Myoffset));
1740  }
difference_type _Myoffset
Definition: iterator:1998
ConstUncheckedRandomAccessIterator(_Cont_t^_Cont, int _Offset)
Definition: iterator:1711
template<typename _Cont_t >
System::Object cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::container ( )
inline
1760  { // return owning container
1761  return (_Mycont);
1762  }
template<typename _Cont_t >
difference_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::distance ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Right)
inline
1821  { // return difference of two iterators
1822 // if (container() == nullptr // UNCHECKED
1823 // || container() != _Right->container())
1824 // throw gcnew System::ArgumentException();
1825  return (get_bias() - _Right->get_bias());
1826  }
int get_bias()
Definition: iterator:1742
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
difference_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::distance ( _Mytype_t _Right)
inline
1830  { // return difference of two iterators
1831 // if (container() == nullptr // UNCHECKED
1832 // || container() != _Right->container())
1833 // throw gcnew System::ArgumentException();
1834  return (get_bias() - _Right.get_bias());
1835  }
int get_bias()
Definition: iterator:1742
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::equal_to ( _STLCLR Generic::IInputIterator< _Value_t >^  _Right)
inline
1772  { // test if *this == _Right
1773 // if (container() == nullptr // UNCHECKED
1774 // || container() != _Right->container())
1775 // throw gcnew System::ArgumentException();
1776  return (get_bias() == _Right->get_bias()
1777  && get_node() == _Right->get_node());
1778  }
int get_bias()
Definition: iterator:1742
System::Object get_node()
Definition: iterator:1747
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::equal_to ( _Mytype_t _Right)
inline
1781  { // test if *this == _Right
1782 // if (container() == nullptr // UNCHECKED
1783 // || container() != _Right.container())
1784 // throw gcnew System::ArgumentException();
1785  return (get_bias() == _Right.get_bias()
1786  && get_node() == _Right.get_node());
1787  }
int get_bias()
Definition: iterator:1742
System::Object get_node()
Definition: iterator:1747
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
int cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::get_bias ( )
inline
1743  { // get offset from wrapped iterator
1744  return (_Myoffset);
1745  }
difference_type _Myoffset
Definition: iterator:1998
template<typename _Cont_t >
const_reference cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::get_cref ( )
inline
1790  { // return const reference to designated element
1791  return (_Mycont->at_bias(_Myoffset));
1792  }
difference_type _Myoffset
Definition: iterator:1998
template<typename _Cont_t >
System::Object cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::get_node ( )
inline
1748  { // get node from wrapped iterator
1749  return (nullptr);
1750  }
template<typename _Cont_t >
reference cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::get_ref ( )
inline
1795  { // return reference to designated element
1796 #pragma warning(push)
1797 #pragma warning(disable: 4715)
1798  throw gcnew System::InvalidOperationException();
1799 #pragma warning(pop)
1800  }
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::less_than ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Right)
inline
1838  { // test if *this < _Right
1839 // if (container() == nullptr // UNCHECKED
1840 // || container() != _Right->container())
1841 // throw gcnew System::ArgumentException();
1842  return (get_bias() < _Right->get_bias());
1843  }
int get_bias()
Definition: iterator:1742
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::less_than ( _Mytype_t _Right)
inline
1846  { // test if *this < _Right
1847 // if (container() == nullptr // UNCHECKED
1848 // || container() != _Right->container())
1849 // throw gcnew System::ArgumentException();
1850  return (get_bias() < _Right.get_bias());
1851  }
int get_bias()
Definition: iterator:1742
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
difference_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::move ( difference_type  _Offset)
inline
1810  { // incremented by integer
1811  difference_type _Newoffset = _Myoffset + _Offset; // can overflow
1812 
1813 // if (!_Mycont->valid_bias(_Newoffset)) // UNCHECKED
1814 // throw gcnew System::InvalidOperationException();
1815  _Myoffset = _Newoffset;
1816  return (_Myoffset);
1817  }
difference_type _Myoffset
Definition: iterator:1998
int difference_type
Definition: iterator:1705
_Check_return_ _Ret_maybenull_ _In_ size_t _In_ size_t _Offset
Definition: corecrt_malloc.h:159
template<typename _Cont_t >
void cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::next ( )
inline
1765  { // increment
1766 // if (!_Mycont->valid_bias(_Myoffset + 1)) // UNCHECKED
1767 // throw gcnew System::InvalidOperationException();
1768  ++_Myoffset;
1769  }
difference_type _Myoffset
Definition: iterator:1998
template<typename _Cont_t >
cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator _Mygeniter_t ( )
inline
1732  { // convert to generic iterator
1733  return (_Mygeniter_t(_Mycont, _Myoffset));
1734  }
difference_type _Myoffset
Definition: iterator:1998
_STLCLR Generic::ConstContainerRandomAccessIterator< _Value_t > _Mygeniter_t
Definition: iterator:1723
template<typename _Cont_t >
cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator ConstRandomAccessIterator< _Cont_t > ( )
inline
1717  { // convert to checked iterator
1718  return (ConstRandomAccessIterator<_Cont_t>(_Mycont, _Myoffset));
1719  }
difference_type _Myoffset
Definition: iterator:1998
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator!= ( _STLCLR Generic::IInputIterator< _Value_t >^  _Right)
inline
1887  { // test if *this != _Right
1888  return (!(*this == _Right));
1889  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator!= ( _Mytype_t _Right)
inline
1892  { // test if *this != _Right
1893  return (!(*this == _Right));
1894  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static const_reference cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator* ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left)
inlinestatic
1862  { // return const reference to designated element
1863  return (_Left.get_cref());
1864  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
template<typename _Cont_t >
static ConstUncheckedRandomAccessIterator cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator+ ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left,
difference_type  _Right 
)
inlinestatic
1908  { // return incremented by integer
1910 
1911  _Iter.move(_Right);
1912  return (_Iter);
1913  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
ConstUncheckedRandomAccessIterator(_Cont_t^_Cont, int _Offset)
Definition: iterator:1711
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static ConstUncheckedRandomAccessIterator cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator+ ( difference_type  _Left,
ConstUncheckedRandomAccessIterator< _Cont_t >  _Right 
)
inlinestatic
1918  { // return incremented by integer
1920 
1921  _Iter.move(_Left);
1922  return (_Iter);
1923  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
ConstUncheckedRandomAccessIterator(_Cont_t^_Cont, int _Offset)
Definition: iterator:1711
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static ConstUncheckedRandomAccessIterator cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator++ ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left)
inlinestatic
1870  { // return incremented
1871  _Left.next();
1872  return (_Left);
1873  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
template<typename _Cont_t >
static ConstUncheckedRandomAccessIterator cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator- ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left,
difference_type  _Right 
)
inlinestatic
1928  { // return decremented by integer
1930 
1931  _Iter.move(-_Right); // can overflow
1932  return (_Iter);
1933  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
ConstUncheckedRandomAccessIterator(_Cont_t^_Cont, int _Offset)
Definition: iterator:1711
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
difference_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator- ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Right)
inline
1937  { // return difference of two iterators
1938  return (distance(_Right));
1939  }
difference_type distance(_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
Definition: iterator:1819
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static ConstUncheckedRandomAccessIterator cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator-- ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left)
inlinestatic
1900  { // return decremented
1901  _Left.prev();
1902  return (_Left);
1903  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
template<typename _Cont_t >
static const_reference cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator-> ( ConstUncheckedRandomAccessIterator< _Cont_t >%  _Left)
inlinestatic
1856  { // return pointer to class object
1857  return (_Left.get_cref());
1858  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator< ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Right)
inline
1942  { // test if *this < _Right
1943  return (less_than(_Right));
1944  }
bool less_than(_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
Definition: iterator:1837
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator< ( _Mytype_t _Right)
inline
1947  { // test if *this < _Right
1948  return (less_than(_Right));
1949  }
bool less_than(_STLCLR Generic::IRandomAccessIterator< _Value_t >^_Right)
Definition: iterator:1837
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator<= ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Left,
_Mytype_t _Right 
)
inlinestatic
1976  { // test if _Left <= _Right
1977  return (!(_Right < _Left));
1978  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator<= ( _Mytype_t _Right)
inline
1981  { // test if *this <= _Right
1982  return (!(_Right < *this));
1983  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator== ( _STLCLR Generic::IInputIterator< _Value_t >^  _Right)
inline
1877  { // test if *this == _Right
1878  return (equal_to(_Right));
1879  }
bool equal_to(_STLCLR Generic::IInputIterator< _Value_t >^_Right)
Definition: iterator:1771
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator== ( _Mytype_t _Right)
inline
1882  { // test if *this == _Right
1883  return (equal_to(_Right));
1884  }
bool equal_to(_STLCLR Generic::IInputIterator< _Value_t >^_Right)
Definition: iterator:1771
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
static bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator> ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Left,
_Mytype_t _Right 
)
inlinestatic
1964  { // test if _Left > _Right
1965  return (_Right < _Left);
1966  }
constexpr const _Ty &() _Left
Definition: algorithm:3722
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator> ( _Mytype_t _Right)
inline
1969  { // test if *this > _Right
1970  return (_Right < *this);
1971  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator>= ( _STLCLR Generic::IRandomAccessIterator< _Value_t >^  _Right)
inline
1952  { // test if *this >= _Right
1953  return (!(*this < _Right));
1954  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::operator>= ( _Mytype_t _Right)
inline
1957  { // test if *this >= _Right
1958  return (!(*this < _Right));
1959  }
constexpr const _Ty &() _Right
Definition: algorithm:3723
template<typename _Cont_t >
void cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::prev ( )
inline
1803  { // decrement
1804 // if (!_Mycont->valid_bias(_Myoffset - 1)) // UNCHECKED
1805 // throw gcnew System::InvalidOperationException();
1806  --_Myoffset;
1807  }
difference_type _Myoffset
Definition: iterator:1998
template<typename _Cont_t >
bool cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::valid ( )
inline
1753  { // test if iterator valid
1754  return (true); // UNCHECKED
1755 // return (container() != nullptr
1756 // && _Mycont->valid_bias(_Myoffset));
1757  }

Member Data Documentation

template<typename _Cont_t >
_STLCLR_FIELD_ACCESS cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::__pad0__
template<typename _Cont_t >
difference_type cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::_Myoffset
template<typename _Cont_t >
property const_reference cliext::ConstUncheckedRandomAccessIterator< _Cont_t >::default[difference_type]
Initial value:
{
{
ConstUncheckedRandomAccessIterator _Where = *this + _Pos;
return (*_Where);
}
}

The documentation for this class was generated from the following file: