|
| OrderingSolution (size_t perm_size) |
| Constructor allocates memory for the solution. More...
|
|
bool | havePerm () |
| Do we have the direct permutation? More...
|
|
void | setHavePerm (bool status) |
| Set havePerm (intended for ordering algorithms only) More...
|
|
bool | haveInverse () |
| Do we have the inverse permutation? More...
|
|
void | setHaveInverse (bool status) |
| Set haveInverse (intended for ordering algorithms only) More...
|
|
void | computePerm () |
| Compute direct permutation from inverse. More...
|
|
void | computeInverse () |
| Compute inverse permutation. More...
|
|
size_t | getPermutationSize () |
| Get (local) size of permutation. More...
|
|
ArrayRCP< gno_t > & | getGidsRCP () |
| Get (local) permuted GIDs by RCP. More...
|
|
ArrayRCP< lno_t > & | getPermutationRCP (bool inverse=false) |
| Get (local) permutation by RCP. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering. More...
|
|
ArrayRCP< gno_t > & | getGidsRCPConst () const |
| Get (local) permuted GIDs by const RCP. More...
|
|
ArrayRCP< lno_t > & | getPermutationRCPConst (bool inverse=false) const |
| Get (local) permutation by const RCP. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering. More...
|
|
gno_t * | getGids () |
| Get pointer to (local) GIDs. More...
|
|
lno_t * | getPermutation (bool inverse=false) |
| Get pointer to (local) permutation. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering. More...
|
|
template<typename lno_t, typename gno_t>
class Zoltan2::OrderingSolution< lno_t, gno_t >
The class containing ordering solutions.
Template parameters:
gno_t
data type for application global Ids
lno_t
data type for local indices and local counts
The ordering solution always contains the permutation and the inverse permutation. These should be accessed through the accessor methods defined in this class, such as getPermutation(). Some ordering algorithms may compute and store other information. Currently, only serial ordering of the local data is supported.
In Zoltan2, perm[i]=j means index i in the reordered vector/matrix corresponds to index j in the old ordering. In Matlab notation, A(perm,perm) is the reordered matrix. This is consistent with SuiteSparse (AMD) and several other ordering packages. Unfortunately, this notation may conflict with a few other packages (such as Ifpack2).
Definition at line 71 of file Zoltan2_OrderingSolution.hpp.
template<typename lno_t , typename gno_t >
Get (local) permutation by RCP. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering.
Definition at line 170 of file Zoltan2_OrderingSolution.hpp.
template<typename lno_t , typename gno_t >
Get (local) permutation by const RCP. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering.
Definition at line 190 of file Zoltan2_OrderingSolution.hpp.
template<typename lno_t , typename gno_t >
Get pointer to (local) permutation. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering.
Definition at line 210 of file Zoltan2_OrderingSolution.hpp.