|
TTK
|
This is the complete list of members for ttk::MergeTreeDistance, including all inherited members.
| assignmentSolverID_ | ttk::MergeTreeBase | protected |
| barycenterMergeTree_ | ttk::MergeTreeBase | protected |
| BaseClass() | ttk::BaseClass | |
| branchDecomposition_ | ttk::MergeTreeBase | protected |
| branchDecompositionToTree(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| classicalPersistenceAssignmentProblem(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2) | ttk::MergeTreeDistance | inline |
| classicEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool processTree1, bool computeEmptyTree, ftm::idNode nodeI, ftm::idNode nodeJ, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int nRows, int nCols) | ttk::MergeTreeDistance | inline |
| cleanTree_ | ttk::MergeTreeBase | protected |
| computeBranchDecomposition(ftm::FTMTree_MT *tree, std::vector< std::vector< ftm::idNode > > &treeNodeMerged) | ttk::MergeTreeBase | inline |
| computeDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching) | ttk::MergeTreeDistance | inline |
| computeDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching) | ttk::MergeTreeDistance | inline |
| ttk::MergeTreeBase::computeDistance(dataType x1, dataType x2, dataType y1, dataType y2, double power=2) | ttk::MergeTreeBase | inline |
| computeEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int nRows, int nCols) | ttk::MergeTreeDistance | inline |
| computeEmptyToForestDistance(ftm::FTMTree_MT *tree2, ftm::idNode nodeJ, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable) | ttk::MergeTreeDistance | inline |
| computeEmptyToSubtreeDistance(ftm::FTMTree_MT *tree2, ftm::idNode nodeJ, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable) | ttk::MergeTreeDistance | inline |
| computeForestsDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, int i, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2) | ttk::MergeTreeDistance | inline |
| computeForestToEmptyDistance(ftm::FTMTree_MT *tree1, ftm::idNode nodeI, int i, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable) | ttk::MergeTreeDistance | inline |
| computeMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching, int startR, int startC) | ttk::MergeTreeDistance | inline |
| computeSubtreesDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, int i, int j, ftm::idNode nodeI, ftm::idNode nodeJ, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2) | ttk::MergeTreeDistance | inline |
| computeSubtreeToEmptyDistance(ftm::FTMTree_MT *tree1, ftm::idNode nodeI, int i, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable) | ttk::MergeTreeDistance | inline |
| computeTerm1_2(std::vector< ftm::idNode > &childrens, int ind, std::vector< std::vector< dataType > > &table, bool computeTerm1) | ttk::MergeTreeDistance | inline |
| convertBranchDecompositionMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching) | ttk::MergeTreeBase | inline |
| convertBranchDecompositionMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching) | ttk::MergeTreeBase | inline |
| convertToDiagram_ | ttk::MergeTreeBase | protected |
| copyMinMaxPair(ftm::MergeTree< dataType > &mTree1, ftm::MergeTree< dataType > &mTree2, bool setOrigins=false) | ttk::MergeTreeBase | inline |
| createCostMatrix(std::vector< std::vector< dataType > > &treeTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::vector< dataType > > &costMatrix) | ttk::MergeTreeDistance | inline |
| Debug() | ttk::Debug | |
| debugLevel_ | ttk::Debug | mutableprotected |
| debugMsgNamePrefix_ | ttk::Debug | protected |
| debugMsgPrefix_ | ttk::Debug | protected |
| deleteCost(ftm::FTMTree_MT *tree, ftm::idNode nodeId) | ttk::MergeTreeBase | inline |
| deleteMultiPersPairs(ftm::FTMTree_MT *tree, bool useBD) | ttk::MergeTreeBase | inline |
| deleteMultiPersPairs_ | ttk::MergeTreeBase | protected |
| distanceSquaredRoot_ | ttk::MergeTreeBase | protected |
| dontUseMinMaxPair(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| epsilon1UseFarthestSaddle_ | ttk::MergeTreeBase | protected |
| epsilon2Tree1_ | ttk::MergeTreeBase | protected |
| epsilon2Tree2_ | ttk::MergeTreeBase | protected |
| epsilon3Tree1_ | ttk::MergeTreeBase | protected |
| epsilon3Tree2_ | ttk::MergeTreeBase | protected |
| epsilonTree1_ | ttk::MergeTreeBase | protected |
| epsilonTree2_ | ttk::MergeTreeBase | protected |
| execute(ftm::MergeTree< dataType > &mTree1, ftm::MergeTree< dataType > &mTree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching) | ttk::MergeTreeDistance | inline |
| execute(ftm::MergeTree< dataType > &tree1, ftm::MergeTree< dataType > &tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching) | ttk::MergeTreeDistance | inline |
| fixMergedRootOrigin(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| forestAssignmentProblem(ftm::FTMTree_MT *ttkNotUsed(tree1), ftm::FTMTree_MT *ttkNotUsed(tree2), std::vector< std::vector< dataType > > &treeTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::tuple< int, int > > &forestAssignment) | ttk::MergeTreeDistance | inline |
| getParamNames(std::vector< std::string > ¶mNames) | ttk::MergeTreeBase | inline |
| getParamValueFromName(std::string ¶mName) | ttk::MergeTreeBase | inline |
| getSizeLimitMetric(std::vector< ftm::FTMTree_MT * > &trees) | ttk::MergeTreeBase | inline |
| getThreadNumber() const | ttk::BaseClass | inline |
| getTreesNodeCorr() | ttk::MergeTreeBase | inline |
| getTreesStats(std::vector< ftm::FTMTree_MT * > &trees, std::array< double, 3 > &stats) | ttk::MergeTreeBase | inline |
| identifyRealMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching, std::vector< std::tuple< ftm::idNode, ftm::idNode, bool > > &realMatching) | ttk::MergeTreeBase | inline |
| insertCost(ftm::FTMTree_MT *tree, ftm::idNode nodeId) | ttk::MergeTreeBase | inline |
| isPersistenceDiagram_ | ttk::MergeTreeBase | protected |
| keepMostImportantPairs(ftm::FTMTree_MT *tree, int n, bool useBD) | ttk::MergeTreeBase | inline |
| keepSubtree_ | ttk::MergeTreeBase | protected |
| lastLineMode | ttk::Debug | protectedstatic |
| lastObject_ | ttk::BaseClass | protected |
| mergeSaddle(ftm::FTMTree_MT *tree, double epsilon, std::vector< std::vector< ftm::idNode > > &treeNodeMerged, bool mergeByPersistence=false) | ttk::MergeTreeBase | inline |
| MergeTreeBase() | ttk::MergeTreeBase | inline |
| MergeTreeDistance() | ttk::MergeTreeDistance | inline |
| mixDistances(dataType distance1, dataType distance2) | ttk::MergeTreeBase | inline |
| mixDistancesMatrix(std::vector< std::vector< dataType > > &distanceMatrix, std::vector< std::vector< dataType > > &distanceMatrix2) | ttk::MergeTreeBase | inline |
| mixDistancesMinMaxPairWeight(bool isFirstInput) | ttk::MergeTreeBase | inline |
| mixDistancesWeight(bool isFirstInput) | ttk::MergeTreeBase | inline |
| mixtureCoefficient_ | ttk::MergeTreeBase | protected |
| mtFlattening(ftm::MergeTree< dataType > &mt) | ttk::MergeTreeBase | inline |
| mtsFlattening(std::vector< ftm::MergeTree< dataType > > &mts) | ttk::MergeTreeBase | inline |
| nodePerTask_ | ttk::MergeTreeBase | protected |
| nonMatchingWeight_ | ttk::MergeTreeBase | protected |
| normalizedWasserstein_ | ttk::MergeTreeBase | protected |
| parallelEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int ttkNotUsed(nRows), int ttkNotUsed(nCols)) | ttk::MergeTreeDistance | inline |
| parallelEmptyTreeDistance_v2(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &treeLeaves, std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable) | ttk::MergeTreeDistance | inline |
| parallelEmptyTreeDistancePara(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &treeLeaves, std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue) | ttk::MergeTreeDistance | inline |
| parallelEmptyTreeDistanceTask(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &ttkNotUsed(treeLeaves), std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue) | ttk::MergeTreeDistance | inline |
| parallelize_ | ttk::MergeTreeBase | protected |
| parallelTreeDistance_v2(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, bool firstCall=false) | ttk::MergeTreeDistance | inline |
| parallelTreeDistancePara(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, bool firstCall, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue) | ttk::MergeTreeDistance | inline |
| parallelTreeDistanceTask(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue) | ttk::MergeTreeDistance | inline |
| persistenceMerging(ftm::FTMTree_MT *tree, double epsilon2, double epsilon3=100) | ttk::MergeTreeBase | inline |
| persistenceThreshold_ | ttk::MergeTreeBase | protected |
| persistenceThresholding(ftm::FTMTree_MT *tree, double persistenceThresholdT, std::vector< ftm::idNode > &deletedNodes) | ttk::MergeTreeBase | inline |
| persistenceThresholding(ftm::FTMTree_MT *tree, std::vector< ftm::idNode > &deletedNodes) | ttk::MergeTreeBase | inline |
| persistenceThresholding(ftm::FTMTree_MT *tree, double persistenceThresholdT) | ttk::MergeTreeBase | inline |
| persistenceThresholding(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| postprocessAssignment(std::vector< MatchingType > &matchings, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::tuple< int, int > > &forestAssignment) | ttk::MergeTreeDistance | inline |
| postprocessingPipeline(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| preprocessingPipeline(ftm::MergeTree< dataType > &mTree, double epsilonTree, double epsilon2Tree, double epsilon3Tree, bool branchDecompositionT, bool useMinMaxPairT, bool cleanTreeT, double persistenceThreshold, std::vector< int > &nodeCorr, bool deleteInconsistentNodes=true) | ttk::MergeTreeBase | inline |
| preprocessingPipeline(ftm::MergeTree< dataType > &mTree, double epsilonTree, double epsilon2Tree, double epsilon3Tree, bool branchDecompositionT, bool useMinMaxPairT, bool cleanTreeT, std::vector< int > &nodeCorr, bool deleteInconsistentNodes=true) | ttk::MergeTreeBase | inline |
| preprocessTree(ftm::FTMTree_MT *tree, bool deleteInconsistentNodes=true) | ttk::MergeTreeBase | inline |
| printErr(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) const | ttk::Debug | inline |
| printMapIntInt(std::map< int, int > theMap) | ttk::MergeTreeDistance | inline |
| printMatching(std::vector< MatchingType > &matchings) | ttk::MergeTreeBase | inline |
| printMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &matchings) | ttk::MergeTreeBase | inline |
| printMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode > > &matchings) | ttk::MergeTreeBase | inline |
| printMsg(const std::string &msg, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::vector< std::string > &msgs, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const double &progress, const double &time, const int &threads, const double &memory, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const double &progress, const double &time, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const double &progress, const double &time, const int &threads, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const double &progress, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const double &progress, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::vector< std::vector< std::string > > &rows, const debug::Priority &priority=debug::Priority::INFO, const bool hasHeader=true, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const debug::Separator &separator, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsg(const std::string &msg, const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) const | ttk::Debug | inline |
| printMsgInternal(const std::string &msg, const std::string &right, const std::string &filler, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const | ttk::Debug | inlineprotected |
| printMsgInternal(const std::string &msg, const debug::Priority &priority, const debug::LineMode &lineMode, std::ostream &stream=std::cout) const | ttk::Debug | inlineprotected |
| printOutputMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching, ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool computeCosts=true) | ttk::MergeTreeBase | inline |
| printPairs(std::vector< std::tuple< SimplexId, SimplexId, dataType > > &treePairs) | ttk::MergeTreeBase | inline |
| printTable(dataType *table, int nRows, int nCols) | ttk::MergeTreeBase | inline |
| printTableVector(std::vector< std::vector< dataType > > &table) | ttk::MergeTreeBase | inline |
| printTreesStats(std::vector< ftm::FTMTree_MT * > &trees) | ttk::MergeTreeBase | inline |
| printTreesStats(std::vector< ftm::MergeTree< dataType > > &trees) | ttk::MergeTreeBase | inline |
| printWrn(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) const | ttk::Debug | inline |
| putBackMergedNodes(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| relabelCost(ftm::FTMTree_MT *tree1, ftm::idNode nodeId1, ftm::FTMTree_MT *tree2, ftm::idNode nodeId2) | ttk::MergeTreeBase | inline |
| relabelCostOnly(ftm::FTMTree_MT *tree1, ftm::idNode nodeId1, ftm::FTMTree_MT *tree2, ftm::idNode nodeId2) | ttk::MergeTreeBase | inline |
| reverseNodeCorr(ftm::FTMTree_MT *tree, std::vector< int > &nodeCorr) | ttk::MergeTreeBase | inline |
| runAssignmentProblemSolver(std::vector< std::vector< dataType > > &costMatrix, std::vector< MatchingType > &matchings) | ttk::MergeTreeDistance | inline |
| setAssignmentSolver(int assignmentSolver) | ttk::MergeTreeBase | inline |
| setAuctionEpsilon(double aucEpsilon) | ttk::MergeTreeDistance | inline |
| setAuctionEpsilonDiviser(double aucEpsilonDiviser) | ttk::MergeTreeDistance | inline |
| setAuctionNoRounds(double aucNoRounds) | ttk::MergeTreeDistance | inline |
| setBarycenterMergeTree(bool imt) | ttk::MergeTreeBase | inline |
| setBranchDecomposition(bool useBD) | ttk::MergeTreeBase | inline |
| setCleanTree(bool clean) | ttk::MergeTreeBase | inline |
| setDebugLevel(const int &debugLevel) | ttk::Debug | virtual |
| setDebugMsgPrefix(const std::string &prefix) | ttk::Debug | inline |
| setDeleteMultiPersPairs(bool deleteMultiPersPairsT) | ttk::MergeTreeBase | inline |
| setDistanceSquaredRoot(bool distanceSquaredRoot) | ttk::MergeTreeBase | inline |
| setEpsilon1UseFarthestSaddle(bool b) | ttk::MergeTreeBase | inline |
| setEpsilon2Tree1(double epsilon) | ttk::MergeTreeBase | inline |
| setEpsilon2Tree2(double epsilon) | ttk::MergeTreeBase | inline |
| setEpsilon3Tree1(double epsilon) | ttk::MergeTreeBase | inline |
| setEpsilon3Tree2(double epsilon) | ttk::MergeTreeBase | inline |
| setEpsilonTree1(double epsilon) | ttk::MergeTreeBase | inline |
| setEpsilonTree2(double epsilon) | ttk::MergeTreeBase | inline |
| setIsCalled(bool ic) | ttk::MergeTreeDistance | inline |
| setIsPersistenceDiagram(bool isPD) | ttk::MergeTreeBase | inline |
| setKeepSubtree(bool keepSubtree) | ttk::MergeTreeBase | inline |
| setMinMaxPairWeight(double weight) | ttk::MergeTreeDistance | inline |
| setNodePerTask(int npt) | ttk::MergeTreeBase | inline |
| setNonMatchingWeight(double weight) | ttk::MergeTreeBase | inline |
| setNormalizedWasserstein(bool normalizedWasserstein) | ttk::MergeTreeBase | inline |
| setOnlyEmptyTreeDistance(double only) | ttk::MergeTreeDistance | inline |
| setParallelize(bool para) | ttk::MergeTreeBase | inline |
| setParamValueFromName(std::string ¶mName, double value) | ttk::MergeTreeBase | inline |
| setPersistenceThreshold(double pt) | ttk::MergeTreeBase | inline |
| setPostprocess(bool postproc) | ttk::MergeTreeDistance | inline |
| setPreprocess(bool preproc) | ttk::MergeTreeDistance | inline |
| setSaveTree(bool save) | ttk::MergeTreeDistance | inline |
| setTesting(bool test) | ttk::MergeTreeDistance | inline |
| setThreadNumber(const int threadNumber) | ttk::BaseClass | inlinevirtual |
| setUseMinMaxPair(bool useMinMaxPair) | ttk::MergeTreeBase | inline |
| setWrapper(const Wrapper *wrapper) override | ttk::Debug | virtual |
| threadNumber_ | ttk::BaseClass | mutableprotected |
| treesNodeCorr_ | ttk::MergeTreeBase | protected |
| useDoubleInput_ | ttk::MergeTreeBase | protected |
| useFullMerge_ | ttk::MergeTreeBase | protected |
| useMinMaxPair_ | ttk::MergeTreeBase | protected |
| verifyMergeTreeStructure(ftm::FTMTree_MT *tree) | ttk::MergeTreeDistance | inline |
| verifyOrigins(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| verifyPairsTree(ftm::FTMTree_MT *tree) | ttk::MergeTreeBase | inline |
| wassersteinPower_ | ttk::MergeTreeBase | protected |
| welcomeMsg(std::ostream &stream) | ttk::Debug | protected |
| wrapper_ | ttk::BaseClass | protected |
| ~BaseClass()=default | ttk::BaseClass | virtual |
| ~Debug() override | ttk::Debug | |
| ~MergeTreeDistance() override=default | ttk::MergeTreeDistance |
1.9.8