Zoltan2
|
#include <Zoltan2_OrderingSolution.hpp>
Public Member Functions | |
GlobalOrderingSolution (gno_t perm_size) | |
![]() | |
OrderingSolution (gno_t perm_size) | |
Constructor allocates memory for the solution. | |
bool | havePerm () const |
Do we have the direct permutation? | |
void | setHavePerm (bool status) |
Set havePerm (intended for ordering algorithms only) | |
bool | haveInverse () const |
Do we have the inverse permutation? | |
void | setHaveInverse (bool status) |
Set haveInverse (intended for ordering algorithms only) | |
void | setHaveSeparator (bool status) |
set all separator flags. | |
bool | haveSeparatorRange () const |
Do we have the separator range? | |
void | setHaveSeparatorRange (bool status) |
Set haveSeparatorRange (intended for ordering algorithms only) | |
bool | haveSeparatorTree () const |
Do we have the separator tree? | |
bool | haveSeparators () const |
Do we have the separators? | |
void | setHaveSeparatorTree (bool status) |
Set haveSeparatorTree (intended for ordering algorithms only) | |
void | computePerm () |
Compute direct permutation from inverse. | |
void | computeInverse () |
Compute inverse permutation. | |
void | setNumSeparatorBlocks (gno_t nblks) |
Set number of separator column blocks. | |
size_t | getPermutationSize () const |
Get (local) size of permutation. | |
gno_t | getNumSeparatorBlocks () const |
Get number of separator column blocks. | |
const ArrayRCP< gno_t > & | getPermutationRCP (bool inverse=false) const |
Get (local) permuted GIDs by RCP. | |
bool | getVertexSeparator (gno_t &numBlocks, gno_t *range, gno_t *tree) const |
return vertex separator variables by reference. | |
const ArrayRCP< gno_t > & | getSeparatorRangeRCP () const |
Get (local) separator range by RCP. | |
const ArrayRCP< gno_t > & | getSeparatorTreeRCP () const |
Get (local) separator tree by RCP. | |
ArrayRCP< gno_t > & | getPermutationRCPConst (bool inverse=false) const |
Get (local) permuted GIDs by const RCP. | |
ArrayRCP< gno_t > & | getSeparatorRangeRCPConst () const |
Get separator range by const RCP. | |
ArrayRCP< gno_t > & | getSeparatorTreeRCPConst () const |
Get separator tree by const RCP. | |
gno_t * | getPermutationView (bool inverse=false) const |
Get pointer to 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. | |
gno_t * | getSeparatorRangeView () const |
Get pointer to separator range. | |
gno_t * | getSeparatorTreeView () const |
Get pointer to separator tree. | |
gno_t & | NumSeparatorBlocks () |
Get reference to separator column block. | |
int | validatePerm () |
returns 0 if permutation is valid, negative if invalid. | |
![]() | |
virtual | ~Solution () |
Additional Inherited Members | |
![]() | |
size_t | perm_size_ |
bool | havePerm_ |
bool | haveInverse_ |
bool | haveSeparatorRange_ |
bool | haveSeparatorTree_ |
ArrayRCP< gno_t > | perm_ |
ArrayRCP< gno_t > | invperm_ |
ArrayRCP< gno_t > | separatorRange_ |
ArrayRCP< gno_t > | separatorTree_ |
gno_t | separatorColBlocks_ |
Definition at line 393 of file Zoltan2_OrderingSolution.hpp.
|
inline |
Definition at line 396 of file Zoltan2_OrderingSolution.hpp.