DiscreteGradient Member List
This is the complete list of members for DiscreteGradient, including all inherited members.
| BACKEND enum name | DiscreteGradient | |
| BackEnd | DiscreteGradient | protected |
| buildGradient(const triangulationType &triangulation, bool bypassCache=false, const std::vector< bool > *updateMask=nullptr) | DiscreteGradient | |
| buildGradient(const triangulationType &triangulation, bool bypassCache=false, const std::vector< bool > *updateMask=nullptr) | DiscreteGradient | |
| clearCache(const AbstractTriangulation &triangulation) | DiscreteGradient | inlinestatic |
| criticalTypeFromCellDimension(const int dim) const | DiscreteGradient | |
| detectGradientCycle(const Cell &cell, const triangulationType &triangulation) const | DiscreteGradient | |
| dimensionality_ | DiscreteGradient | protected |
| DiscreteGradient() | DiscreteGradient | inline |
| filterSaddleConnectors(const bool allowBoundary, const triangulationType &triangulation) | DiscreteGradient | |
| getAscendingPath(const Cell &cell, std::vector< Cell > &vpath, const triangulationType &triangulation, const bool enableCycleDetector=false) const | DiscreteGradient | |
| getAscendingPathThroughWall(const Cell &saddle1, const Cell &saddle2, const std::vector< bool > &isVisited, std::vector< Cell > *const vpath, const triangulationType &triangulation, const bool stopIfMultiConnected=false, const bool enableCycleDetector=false, bool *const cycleFound=nullptr) const | DiscreteGradient | |
| getAscendingWall(const Cell &cell, VisitedMask &mask, const triangulationType &triangulation, std::vector< Cell > *const wall=nullptr, std::vector< SimplexId > *const saddles=nullptr) const | DiscreteGradient | |
| getCellGreaterVertex(const Cell c, const triangulationType &triangulation) const | DiscreteGradient | |
| getCellGreaterVertex(const Cell c, const triangulationType &triangulation) const | DiscreteGradient | |
| getCellLowerVertex(const Cell c, const triangulationType &triangulation) const | DiscreteGradient | |
| getCellLowerVertex(const Cell c, const triangulationType &triangulation) const | DiscreteGradient | |
| getCriticalPointMap(const std::vector< std::pair< SimplexId, char > > &criticalPoints, std::vector< char > &isPL) | DiscreteGradient | |
| getCriticalPoints(std::array< std::vector< SimplexId >, 4 > &criticalCellsByDim, const triangulationType &triangulation) const | DiscreteGradient | |
| getCriticalPoints(std::vector< Cell > &criticalPoints, const triangulationType &triangulation) const | DiscreteGradient | |
| getDescendingPath(const Cell &cell, std::vector< Cell > &vpath, const triangulationType &triangulation) const | DiscreteGradient | |
| getDescendingPathThroughWall(const Cell &saddle2, const Cell &saddle1, const std::vector< bool > &isVisited, std::vector< Cell > *const vpath, const triangulationType &triangulation, const bool stopIfMultiConnected=false, const bool enableCycleDetector=false) const | DiscreteGradient | |
| getDescendingWall(const Cell &cell, VisitedMask &mask, const triangulationType &triangulation, std::vector< Cell > *const wall=nullptr, std::vector< SimplexId > *const saddles=nullptr) const | DiscreteGradient | |
| getDimensionality() const | DiscreteGradient | |
| getNumberOfCells(const int dimension, const triangulationType &triangulation) const | DiscreteGradient | |
| getNumberOfDimensions() const | DiscreteGradient | |
| getPairedCell(const Cell &cell, const triangulationType &triangulation, bool isReverse=false) const | DiscreteGradient | |
| getPersistence(const Cell &up, const Cell &down, const dataType *const scalars, const triangulationType &triangulation) const | DiscreteGradient | |
| gradient_ | DiscreteGradient | protected |
| inputOffsets_ | DiscreteGradient | protected |
| inputScalarField_ | DiscreteGradient | protected |
| isBoundary(const Cell &cell, const triangulationType &triangulation) const | DiscreteGradient | |
| isCellCritical(const int cellDim, const SimplexId cellId) const | DiscreteGradient | |
| isCellCritical(const Cell &cell) const | DiscreteGradient | |
| isMaximum(const Cell &cell) const | DiscreteGradient | |
| isMinimum(const Cell &cell) const | DiscreteGradient | |
| isSaddle1(const Cell &cell) const | DiscreteGradient | |
| isSaddle2(const Cell &cell) const | DiscreteGradient | |
| IterationThreshold | DiscreteGradient | protected |
| localGradient_ | DiscreteGradient | protected |
| newParameters() | DiscreteGradient | inline |
| numberOfVertices_ | DiscreteGradient | protected |
| OldBackEnd | DiscreteGradient | protected |
| OldReturnSaddleConnectors | DiscreteGradient | protected |
| OldSeed | DiscreteGradient | protected |
| preconditionTriangulation(AbstractTriangulation *const data) | DiscreteGradient | inline |
| ReturnSaddleConnectors | DiscreteGradient | protected |
| reverseAscendingPath(const std::vector< Cell > &vpath, const triangulationType &triangulation) const | DiscreteGradient | |
| reverseAscendingPathOnWall(const std::vector< Cell > &vpath, const triangulationType &triangulation, bool cancelReversal=false) const | DiscreteGradient | |
| reverseDescendingPath(const std::vector< Cell > &vpath, const triangulationType &triangulation) const | DiscreteGradient | |
| reverseDescendingPathOnWall(const std::vector< Cell > &vpath, const triangulationType &triangulation) const | DiscreteGradient | |
| SaddleConnectorsPersistenceThreshold | DiscreteGradient | protected |
| Seed | DiscreteGradient | protected |
| setBackend(const BACKEND newBackend) | DiscreteGradient | inline |
| setCriticalPoints(const std::array< std::vector< SimplexId >, 4 > &criticalCellsByDim, std::vector< std::array< float, 3 > > &points, std::vector< char > &cellDimensions, std::vector< SimplexId > &cellIds, std::vector< char > &isOnBoundary, std::vector< SimplexId > &PLVertexIdentifiers, const triangulationType &triangulation) const | DiscreteGradient | |
| setCriticalPoints(std::vector< std::array< float, 3 > > &points, std::vector< char > &cellDimensions, std::vector< SimplexId > &cellIds, std::vector< char > &isOnBoundary, std::vector< SimplexId > &PLVertexIdentifiers, const triangulationType &triangulation) const | DiscreteGradient | |
| setGradientGlyphs(std::vector< std::array< float, 3 > > &points, std::vector< char > &points_pairOrigins, std::vector< char > &cells_pairTypes, std::vector< SimplexId > &cellsIds, std::vector< char > &cellsDimensions, const triangulationType &triangulation) const | DiscreteGradient | |
| setInputOffsets(const SimplexId *const data) | DiscreteGradient | inline |
| setInputScalarField(const void *const data, const size_t mTime) | DiscreteGradient | inline |
| setLocalGradient() | DiscreteGradient | inline |
| setManifoldSize(const std::array< std::vector< SimplexId >, 4 > &criticalCellsByDim, const SimplexId *const ascendingManifold, const SimplexId *const descendingManifold, std::vector< SimplexId > &manifoldSize) const | DiscreteGradient | |
| setReturnSaddleConnectors(const bool &returnSaddleConnectors) | DiscreteGradient | inline |
| setSaddleConnectorsPersistenceThreshold(double threshold) | DiscreteGradient | inline |
| setSeed(const unsigned int &newSeed) | DiscreteGradient | inline |
| simplifySaddleSaddleConnections1(const std::vector< std::pair< SimplexId, char > > &criticalPoints, const std::vector< char > &isPL, const int iterationThreshold, const bool allowBoundary, const bool allowBruteForce, const bool returnSaddleConnectors, const triangulationType &triangulation) | DiscreteGradient | |
| simplifySaddleSaddleConnections2(const std::vector< std::pair< SimplexId, char > > &criticalPoints, const std::vector< char > &isPL, const int iterationThreshold, const bool allowBoundary, const bool allowBruteForce, const bool returnSaddleConnectors, const triangulationType &triangulation) | DiscreteGradient |
Generated on Fri Apr 10 2026 10:02:10 for TTK by
1.13.2