IBM SYSTEMG G RUNTIME & NATIVE STORE
0.5
IBM Native Graph Computing and Storage System based on IBM Parallel Programming Library
|
implement block-based linear partitioning for container class T More...
#include <for_each.h>
Public Types | |
typedef T::iterator | iterator |
typedef T::const_iterator | const_iterator |
Public Member Functions | |
linear_task_partitioner (T &data, PARTITION_TYPE ptype, size_t chunk_size) | |
linear_task_partitioner () | |
size_t | num_partitions () |
iterator | partition_begin (task_id chunk_id) |
iterator | partition_end (task_id chunk_id) |
Protected Member Functions | |
void | setData (T *data) |
void | init (PARTITION_TYPE ptype, size_t chunk_size) |
Protected Attributes | |
size_t | _chunk_size |
size_t | _num_chunks |
size_t | _total_size |
PARTITION_TYPE | _ptype |
T * | _data |
implement block-based linear partitioning for container class T
class <T> implement the following interface: T::size(), T::begin(), T::end(), T::iterator, and T::const_iterator
ptype:
chunk_size:
|
inline |
constructor: building a linear task partitioner container <data>
|
inline |
constructor: dummy (not doing anything)
|
inline |
returns number of partitions
|
inline |
returns iterator to the beginning of a partition specified by chunk_id
|
inline |
returns iterator to the end of a partition specified by chunk_id