#include <common.h>
Public Types | |
| typedef It | iterator |
Public Member Functions | |
| It | begin (void) const |
| It | end (void) const |
| void | check (void) const |
| bool | empty (void) const |
| slice (const It &aBeg, const It &aEnd) | |
Private Attributes | |
| It | _Beg |
| It | _End |
It is not necessary to store the size, but it is technically easy : One just needs to store the result of adv().
| typedef It rpa::range_step_base< It >::slice::iterator |
| rpa::range_step_base< It >::slice::slice | ( | const It & | aBeg, | |
| const It & | aEnd | |||
| ) | [inline] |
When the output has a limited size, we pick up fixed-size slices for processing, but no mutex is necessary because this is inside a single thread (See obuf_iterator).
| It rpa::range_step_base< It >::slice::begin | ( | void | ) | const [inline] |
| void rpa::range_step_base< It >::slice::check | ( | void | ) | const [inline] |
| bool rpa::range_step_base< It >::slice::empty | ( | void | ) | const [inline] |
Necessary for a slice created by an input range. If the size was stored, we would just need to check its zeroness.
| It rpa::range_step_base< It >::slice::end | ( | void | ) | const [inline] |
It rpa::range_step_base< It >::slice::_Beg [private] |
It rpa::range_step_base< It >::slice::_End [private] |
1.4.7