#include <pipeline.h>
Inheritance diagram for rpa::pipe_archiver< Container, void >:
Public Types | |
typedef container_traits< Container >::value_type | value_type |
typedef pipe_itr< value_type, reader > | iterator |
Public Member Functions | |
pipe_archiver () | |
template<class Iter> | |
pipe_archiver (Iter begIter, Iter endIter) | |
The pipe can be init with any kind of data range. | |
pipe_archiver (const Container &aCont) | |
iterator | begin (void) |
These two iterators can be used into algorithm of std. | |
iterator | end (void) |
Private Types | |
typedef pipe_container< Container > | pip_cont_t |
typedef container_traits< Container >::iterator | intrn_iter |
Private Member Functions | |
void | init (void) |
By default, the pipe is not shut: Readers wait even if there is no data. | |
Private Attributes | |
intrn_iter | _it_rd |
intrn_iter | _it_end |
bool | _shut |
Classes | |
class | reader |
Template parameter for 'pipe_itr'. More... |
NOTE: We have seen that the containers are not 'pipe_archiver'. It may be possible to use a real 'pipe_archiver' buffer, that is, a pipe_archiver, endless list. See the concept of 'circulator'.
typedef container_traits< Container >::iterator rpa::pipe_archiver< Container, void >::intrn_iter [private] |
typedef pipe_itr< value_type, reader > rpa::pipe_archiver< Container, void >::iterator |
Reimplemented from rpa::pipe_container< Container >.
typedef pipe_container< Container > rpa::pipe_archiver< Container, void >::pip_cont_t [private] |
typedef container_traits< Container >::value_type rpa::pipe_archiver< Container, void >::value_type |
rpa::pipe_archiver< Container, void >::pipe_archiver | ( | ) | [inline] |
rpa::pipe_archiver< Container, void >::pipe_archiver | ( | Iter | begIter, | |
Iter | endIter | |||
) | [inline] |
The pipe can be init with any kind of data range.
rpa::pipe_archiver< Container, void >::pipe_archiver | ( | const Container & | aCont | ) | [inline] |
iterator rpa::pipe_archiver< Container, void >::begin | ( | void | ) | [inline] |
These two iterators can be used into algorithm of std.
Reimplemented from rpa::pipe_container< Container >.
iterator rpa::pipe_archiver< Container, void >::end | ( | void | ) | [inline] |
Reimplemented from rpa::pipe_container< Container >.
void rpa::pipe_archiver< Container, void >::init | ( | void | ) | [inline, private] |
By default, the pipe is not shut: Readers wait even if there is no data.
intrn_iter rpa::pipe_archiver< Container, void >::_it_end [private] |
intrn_iter rpa::pipe_archiver< Container, void >::_it_rd [private] |
bool rpa::pipe_archiver< Container, void >::_shut [private] |