Partners for merge-reduce.
More...
#include <diy/partners/merge.hpp>
|
| template<class Decomposer > |
| | RegularMergePartners (const Decomposer &decomposer, int k, bool contiguous=true) |
| |
| | RegularMergePartners (const DivisionVector &divs, const KVSVector &kvs, bool contiguous=true) |
| |
|
bool | active (int round, int gid, const Master &) const |
| |
|
void | incoming (int round, int gid, std::vector< int > &partners, const Master &) const |
| |
|
void | outgoing (int round, int gid, std::vector< int > &partners, const Master &) const |
| |
|
template<class Decomposer_ > |
| | RegularPartners (const Decomposer_ &decomposer, int k, bool contiguous=true) |
| |
|
| RegularPartners (const DivisionVector &divs, const KVSVector &kvs, bool contiguous=true) |
| |
|
size_t | rounds () const |
| |
|
int | size (int round) const |
| |
|
int | dim (int round) const |
| |
|
int | step (int round) const |
| |
|
const DivisionVector & | divisions () const |
| |
|
const KVSVector & | kvs () const |
| |
|
bool | contiguous () const |
| |
|
void | fill (int round, int gid, std::vector< int > &partners) const |
| |
|
int | group_position (int round, int c, int step) const |
| |
|
|
static void | factor (int k, const DivisionVector &divisions, KVSVector &kvs) |
| |
Partners for merge-reduce.
- Examples:
- reduce/merge-reduce.cpp.
template<class Decomposer >
| diy::RegularMergePartners::RegularMergePartners |
( |
const Decomposer & |
decomposer, |
|
|
int |
k, |
|
|
bool |
contiguous = true |
|
) |
| |
|
inline |
- Parameters
-
| decomposer | domain decomposition |
| k | target k value |
| contiguous | distance doubling (true) or halving (false) |
| diy::RegularMergePartners::RegularMergePartners |
( |
const DivisionVector & |
divs, |
|
|
const KVSVector & |
kvs, |
|
|
bool |
contiguous = true |
|
) |
| |
|
inline |
- Parameters
-
| divs | explicit division vector |
| kvs | explicit k vector |
| contiguous | distance doubling (true) or halving (false) |
The documentation for this struct was generated from the following file: