#include <vector>#include <algorithm>#include <string>#include <sstream>Classes | |
| class | TMVA::Experimental::BranchlessTree< T > |
| Branchless representation of a decision tree using topological ordering. More... | |
Namespaces | |
| namespace | TMVA |
| create variable transformations | |
| namespace | TMVA::Experimental |
| namespace | TMVA::Experimental::Internal |
Functions | |
| template<typename T > | |
| void | TMVA::Experimental::Internal::RecursiveFill (int thisIndex, int lastIndex, int treeDepth, int maxTreeDepth, std::vector< T > &thresholds, std::vector< int > &inputs) |
| Fill the empty nodes of a sparse tree recursively. | |