#include <range.h>
|
| GeneratedRange () |
|
| GeneratedRange (const T &t, const Advance &a, const End &e) |
|
void | removeFirst () |
|
void | setToEmpty () |
|
T | head () const |
|
bool | isEnd () const |
|
bool | operator<= (const GeneratedRange &r) const |
|
const GeneratedRange< T, _Advance, _End > & | self () const |
|
iterator | begin () const |
|
iterator | end () const |
|
T | head () |
|
GeneratedRange< T, _Advance, _End > | tail () const |
|
void | output (Consumer< T > t) const |
|
bool | empty () const |
|
| ~RangeMixin () |
|
const GeneratedRange< T, _Advance, _End > & | cmpSelf () const |
|
bool | operator!= (const GeneratedRange< T, _Advance, _End > &o) const |
|
bool | operator== (const GeneratedRange< T, _Advance, _End > &o) const |
|
bool | operator< (const GeneratedRange< T, _Advance, _End > &o) const |
|
bool | operator> (const GeneratedRange< T, _Advance, _End > &o) const |
|
bool | operator>= (const GeneratedRange< T, _Advance, _End > &o) const |
|
◆ Advance
template<typename T, typename _Advance, typename _End>
◆ End
template<typename T, typename _Advance, typename _End>
◆ GeneratedRange() [1/2]
template<typename T, typename _Advance, typename _End>
◆ GeneratedRange() [2/2]
template<typename T, typename _Advance, typename _End>
◆ head()
template<typename T, typename _Advance, typename _End>
◆ isEnd()
template<typename T, typename _Advance, typename _End>
◆ operator<=()
template<typename T, typename _Advance, typename _End>
◆ removeFirst()
template<typename T, typename _Advance, typename _End>
◆ setToEmpty()
template<typename T, typename _Advance, typename _End>
◆ m_advance
template<typename T, typename _Advance, typename _End>
◆ m_current
template<typename T, typename _Advance, typename _End>
◆ m_end
template<typename T, typename _Advance, typename _End>
◆ m_endPred
template<typename T, typename _Advance, typename _End>
The documentation for this struct was generated from the following file: