base class for the 2D partitioning algorithm More...
#include <twod/part_base.hpp>
base class for the 2D partitioning algorithm
| T | type of the element in the matrix | |
| Pr | type of the prefix sum array |
Public Member Functions | |
| virtual T | part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts)=0 |
| Applies a 2d partitioning algorithm to a given 2d prefixSumArray . | |
| virtual | ~PartBase () |
| twod::PartBase< T, Pr >::~PartBase | ( | ) | [virtual] |
| virtual T twod::PartBase< T, Pr >::part | ( | int | procCount, | |
| const Pr & | prefixSumArray, | |||
| util::RectList< T, Pr > & | parts | |||
| ) | [pure virtual] |
Applies a 2d partitioning algorithm to a given 2d prefixSumArray .
| [in] | procCount | is the number of processors |
| [in] | prefixSumArray | first column and first row consists of zero only. But the borders of rectangles in rect_list never touch this area (index 0 in row or column) |
| [out] | parts | must be empty before calling this function. It will contain the partition after the function return |
Implemented in twod::JagPQHeurHor< T, Pr, onedalgoY, onedalgoX >, twod::JagPQHeurVer< T, Pr, onedalgoY, onedalgoX >, twod::JagPQHeurBest< T, Pr >, twod::Hybrid< T, Pr >, twod::JagPQOptIntervalHor< T, Pr >, twod::JagPQOptIntervalVer< T, Pr >, twod::JagPQOptIntervalBest< T, Pr >, twod::JagMOptHor< T, Pr >, twod::JagMOptVer< T, Pr >, twod::JagMOptBest< T, Pr >, twod::JagPQOptHor< T, Pr >, twod::JagPQOptVer< T, Pr >, twod::JagPQOptBest< T, Pr >, twod::JagMHeurHor< T, Pr, onedalgoY, onedalgoX >, twod::JagMHeurVer< T, Pr, onedalgoY, onedalgoX >, twod::JagMHeurBest< T, Pr >, twod::JagMHeurProbeHor< T, Pr, onedalgoY, onedalgoX >, twod::JagMHeurProbeVer< T, Pr, onedalgoY, onedalgoX >, twod::JagMHeurProbeBest< T, Pr >, twod::RectNicol< T, Pr, DEBUG >, twod::RecBisect2D< T, Pr, type >, twod::HierRelaxed< T, Pr, type, middle >, and twod::Uniform< T, Pr >.
1.7.1
