createChildren(Node *parentNode) | DynTree< AProperties, ASubPropertiesFactory > | inlineprivate |
DynTree(const Properties &properties, const SubPropertiesFactory &subPropertiesFactory=SubPropertiesFactory()) | DynTree< AProperties, ASubPropertiesFactory > | inlineexplicit |
DynTree(const DynTree &node)=delete | DynTree< AProperties, ASubPropertiesFactory > | |
fell() | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
fillWalk(AItemInDomainMeasure &weightItemInDomain, AIsLeafPredicate &isLeaf) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findHeaviestLeaf(AItemInDomainMeasure &weightItemInDomain, int maxLevel, ASkipNodePredicate &skipNode) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findHeaviestLeafRepeated(AItemInDomainMeasure &weightItemInDomain, int maxLevel, const Weight minWeight=NAN) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findHeaviestLeafRepeated(AItemInDomainMeasure &weightItemInDomain, int maxLevel, ASkipNodePredicate &skipNode) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findHeaviestLeafSingle(AItemInDomainMeasure &weightItemInDomain, int maxLevel, ASkipNodePredicate &skipNode) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findHeavyLeavesDisjoint(AItemInDomainMeasure &weightItemInDomain, int maxLevel, double minWeight) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
findLeavesDisjoint(AItemInDomainMeasure &weightItemInDomain, int maxLevel, ASkipNodePredicate &skipNode) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
getNNodes() const | DynTree< AProperties, ASubPropertiesFactory > | inline |
getNNodesByLevel() const | DynTree< AProperties, ASubPropertiesFactory > | inline |
getTopNode() | DynTree< AProperties, ASubPropertiesFactory > | inline |
getTopNode() const | DynTree< AProperties, ASubPropertiesFactory > | inline |
getUnusedChildren() | DynTree< AProperties, ASubPropertiesFactory > | inlineprivate |
m_children | DynTree< AProperties, ASubPropertiesFactory > | |
m_marks | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | private |
m_nUsedChildren | DynTree< AProperties, ASubPropertiesFactory > | |
m_subPropertiesFactory | DynTree< AProperties, ASubPropertiesFactory > | |
m_topNode | DynTree< AProperties, ASubPropertiesFactory > | |
Node typedef | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | |
operator=(const DynTree &)=delete | DynTree< AProperties, ASubPropertiesFactory > | |
Properties typedef | DynTree< AProperties, ASubPropertiesFactory > | private |
raze() | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
seed(const Ts &items) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
SubPropertiesFactory typedef | DynTree< AProperties, ASubPropertiesFactory > | private |
Super typedef | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | private |
This typedef | DynTree< AProperties, ASubPropertiesFactory > | private |
walk(AWalker &walker) | DynTree< AProperties, ASubPropertiesFactory > | inline |
walk(AWalker &walker, APriorityMeasure &priority) | DynTree< AProperties, ASubPropertiesFactory > | inline |
walkHeighWeightFirst(ATreeWalker &walker) | WeightedFastHoughTree< T, ADomain, ADomainDivsion > | inline |
WeightedParititioningDynTree(ADomain topDomain, ADomainDivsion domainDivsion) | WeightedParititioningDynTree< WithSharedMark< T >, ADomain, ADomainDivsion > | inline |