SG++-Doxygen-Documentation
|
Point ordering class with the slowest possible growth (n = 2^(l+1) - 1) that makes uniform points without boundary nested. More...
#include <ExponentialNoBoundaryPointOrdering.hpp>
Public Member Functions | |
virtual size_t | convertIndex (size_t level, size_t numPoints, size_t index) |
Converts a level-independent index into a corresponding level-dependent index in for the PointDistribution. More... | |
virtual std::shared_ptr< AbstractPermutationIterator > | getSortedPermutationIterator (size_t level, std::vector< double > const &points, size_t numPoints) |
Returns a permutation iterator which first returns the level-independent index of the leftmost point, then the level-independent index of the second-leftmost point, etc. More... | |
virtual size_t | numPoints (size_t level) |
Returns the number of points in the given level. More... | |
virtual | ~ExponentialNoBoundaryPointOrdering () |
Public Member Functions inherited from sgpp::combigrid::AbstractPointOrdering | |
virtual | ~AbstractPointOrdering () |
Point ordering class with the slowest possible growth (n = 2^(l+1) - 1) that makes uniform points without boundary nested.
|
virtual |
|
virtual |
Converts a level-independent index into a corresponding level-dependent index in for the PointDistribution.
level | The level where the index is considered |
numPoints | The number of points at the level |
index | The index of the concrete point in the level |
Implements sgpp::combigrid::AbstractPointOrdering.
References sgpp::combigrid::pow().
|
virtual |
Returns a permutation iterator which first returns the level-independent index of the leftmost point, then the level-independent index of the second-leftmost point, etc.
Implements sgpp::combigrid::AbstractPointOrdering.
References level, and numPoints().
|
virtual |
Returns the number of points in the given level.
Implements sgpp::combigrid::AbstractPointOrdering.
References sgpp::combigrid::pow().
Referenced by getSortedPermutationIterator().