#include <common.h>
Public Types | |
typedef range_out | range_type |
typedef It2 | iterator |
typedef It2 | result_t |
Public Member Functions | |
range_out (result_t &aBeg) | |
const result_t & | result (void) const |
void | leave_seq (const iterator &aIter) |
void | leave_par (const iterator &aIter) |
It2 & | begout (void) |
seqnum_t | sequence_number (void) const |
Private Member Functions | |
range_out () | |
range_out & | operator= (const range_out &) |
Private Attributes | |
It2 | _It |
Classes | |
struct | slice |
typedef It2 rpa::range_void< It >::range_out< It2, IterCat >::iterator |
typedef range_out rpa::range_void< It >::range_out< It2, IterCat >::range_type |
typedef It2 rpa::range_void< It >::range_out< It2, IterCat >::result_t |
rpa::range_void< It >::range_out< It2, IterCat >::range_out | ( | ) | [private] |
rpa::range_void< It >::range_out< It2, IterCat >::range_out | ( | result_t & | aBeg | ) | [inline, explicit] |
It2& rpa::range_void< It >::range_out< It2, IterCat >::begout | ( | void | ) | [inline] |
void rpa::range_void< It >::range_out< It2, IterCat >::leave_par | ( | const iterator & | aIter | ) | [inline] |
void rpa::range_void< It >::range_out< It2, IterCat >::leave_seq | ( | const iterator & | aIter | ) | [inline] |
This is for storing the result of a plain STL algorithm, when the return value is the result of incrementations of an input iterator given by this sequence with its 'begin' member. After this, the internal state of the sequence is consistent.
range_out& rpa::range_void< It >::range_out< It2, IterCat >::operator= | ( | const range_out< It2, IterCat > & | ) | [private] |
const result_t& rpa::range_void< It >::range_out< It2, IterCat >::result | ( | void | ) | const [inline] |
seqnum_t rpa::range_void< It >::range_out< It2, IterCat >::sequence_number | ( | void | ) | const [inline] |
It2 rpa::range_void< It >::range_out< It2, IterCat >::_It [private] |