MADNESS
version 0.9
|
Range vaguely a la Intel TBB encapsulates random-access STL-like start and end iterators with chunksize. More...
#include <worldrange.h>
Public Types | |
typedef iteratorT | iterator |
Public Member Functions | |
Range (const iterator &start, const iterator &finish, int chunk=1) | |
Makes the range [start,finish) More... | |
Range (const Range &r) | |
Copy constructor ... cost is O(1) More... | |
Range (Range &left, const Split &) | |
Splits range between new and old (r) objects ... cost is O(1) More... | |
size_t | size () const |
Returns number of items in the range (cost is O(1)) More... | |
bool | empty () const |
Returns true if size=0. More... | |
const iterator & | begin () const |
const iterator & | end () const |
unsigned int | get_chunksize () const |
Range vaguely a la Intel TBB encapsulates random-access STL-like start and end iterators with chunksize.
typedef iteratorT madness::Range< iteratorT >::iterator |
|
inline |
Makes the range [start,finish)
The motivated reader should look at the Intel TBB range, partitioner, split, concepts, etc..
|
inline |
Copy constructor ... cost is O(1)
|
inline |
Splits range between new and old (r) objects ... cost is O(1)
|
inline |
|
inline |
Returns true if size=0.
|
inline |
|
inline |
|
inline |
Returns number of items in the range (cost is O(1))