#include <yat/utility/Range.h>
Public Types | |
typedef T | iterator_type |
Public Member Functions | |
Range (void) | |
Default Constructor. | |
Range (T first, T last) | |
Constructor. | |
T | begin (void) const |
T | end (void) const |
Range & | operator= (const Range &) |
Does not modify underlying data. | |
Related Functions | |
(Note that these are not member functions.) | |
template<typename T1 , typename T2 > | |
bool | operator== (const Range< T1 > &, const Range< T2 > &) |
Equality comparison. | |
template<typename T1 , typename T2 > | |
bool | operator!= (const Range< T1 > &, const Range< T2 > &) |
Based on operator==. | |
template<typename T1 , typename T2 > | |
bool | operator< (const Range< T1 > &lhs, const Range< T2 > &rhs) |
Ordering relation. | |
template<typename T1 , typename T2 > | |
bool | operator<= (const Range< T1 > &lhs, const Range< T2 > &rhs) |
template<typename T1 , typename T2 > | |
bool | operator> (const Range< T1 > &, const Range< T2 > &) |
template<typename T1 , typename T2 > | |
bool | operator>= (const Range< T1 > &, const Range< T2 > &) |
This class can be used to create a shallow copy of range, [first, end), defined by two iterators of type T. This can be useful, for example, when creating numerous sub-ranges of a larger container.
typedef T theplu::yat::utility::Range< T >::iterator_type |
Iterator type T.
T theplu::yat::utility::Range< T >::begin | ( | void | ) | const [inline] |
T theplu::yat::utility::Range< T >::end | ( | void | ) | const [inline] |
Range< T > & theplu::yat::utility::Range< T >::operator= | ( | const Range< T > & | rhs | ) | [inline] |
bool operator< | ( | const Range< T1 > & | lhs, | |
const Range< T2 > & | rhs | |||
) | [related] |
Ordering relation.
Using std::lexicographical_compare