|
| | AlgebraicDecisionTree (double leaf=1.0) |
| |
| | AlgebraicDecisionTree (const Base &add) |
| |
| | AlgebraicDecisionTree (const L &label, double y1, double y2) |
| |
| | AlgebraicDecisionTree (const typename Base::LabelC &labelC, double y1, double y2) |
| |
| | AlgebraicDecisionTree (const std::vector< typename Base::LabelC > &labelCs, const std::vector< double > &ys) |
| |
| | AlgebraicDecisionTree (const std::vector< typename Base::LabelC > &labelCs, const std::string &table) |
| |
| template<typename Iterator > |
| | AlgebraicDecisionTree (Iterator begin, Iterator end, const L &label) |
| |
| template<typename M > |
| | AlgebraicDecisionTree (const AlgebraicDecisionTree< M > &other, const std::map< M, L > &map) |
| |
| bool | equals (const AlgebraicDecisionTree &other, double tol=1e-9) const |
| | Equality method customized to value type double. More...
|
| |
| AlgebraicDecisionTree | operator* (const AlgebraicDecisionTree &g) const |
| |
| AlgebraicDecisionTree | operator+ (const AlgebraicDecisionTree &g) const |
| |
| AlgebraicDecisionTree | operator/ (const AlgebraicDecisionTree &g) const |
| |
| void | print (const std::string &s="", const typename Base::LabelFormatter &labelFormatter=&DefaultFormatter) const |
| | print method customized to value type double. More...
|
| |
| AlgebraicDecisionTree | sum (const L &label, size_t cardinality) const |
| |
| AlgebraicDecisionTree | sum (const typename Base::LabelC &labelC) const |
| |
| | DecisionTree () |
| |
| | DecisionTree (const double &y) |
| |
| | DecisionTree (const L &label, const double &y1, const double &y2) |
| | Create tree with 2 assignments y1, y2, splitting on variable label More...
|
| |
| | DecisionTree (const LabelC &label, const double &y1, const double &y2) |
| |
| | DecisionTree (const std::vector< LabelC > &labelCs, const std::vector< double > &ys) |
| |
| | DecisionTree (const std::vector< LabelC > &labelCs, const std::string &table) |
| |
| | DecisionTree (Iterator begin, Iterator end, const L &label) |
| |
| | DecisionTree (const L &label, const DecisionTree &f0, const DecisionTree &f1) |
| |
| | DecisionTree (const DecisionTree< L, X > &other, Func Y_of_X) |
| | Convert from a different value type. More...
|
| |
| | DecisionTree (const DecisionTree< M, X > &other, const std::map< M, L > &map, Func Y_of_X) |
| | Convert from a different value type X to value type Y, also transate labels via map from type M to L. More...
|
| |
| | DecisionTree (const NodePtr &root) |
| |
| NodePtr | compose (Iterator begin, Iterator end, const L &label) const |
| |
| void | print (const std::string &s, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter) const |
| | GTSAM-style print. More...
|
| |
| bool | equals (const DecisionTree &other, const CompareFunc &compare=&DefaultCompare) const |
| |
| virtual | ~DecisionTree ()=default |
| | Make virtual. More...
|
| |
| bool | empty () const |
| | Check if tree is empty. More...
|
| |
| bool | operator== (const DecisionTree &q) const |
| |
| const double & | operator() (const Assignment< L > &x) const |
| |
| void | visit (Func f) const |
| | Visit all leaves in depth-first fashion. More...
|
| |
| void | visitLeaf (Func f) const |
| | Visit all leaves in depth-first fashion. More...
|
| |
| void | visitWith (Func f) const |
| | Visit all leaves in depth-first fashion. More...
|
| |
| size_t | nrLeaves () const |
| | Return the number of leaves in the tree. More...
|
| |
| X | fold (Func f, X x0) const |
| | Fold a binary function over the tree, returning accumulator. More...
|
| |
| std::set< L > | labels () const |
| |
| DecisionTree | apply (const Unary &op) const |
| |
| DecisionTree | apply (const UnaryAssignment &op) const |
| | Apply Unary operation "op" to f while also providing the corresponding assignment. More...
|
| |
| DecisionTree | apply (const DecisionTree &g, const Binary &op) const |
| |
| DecisionTree | choose (const L &label, size_t index) const |
| |
| DecisionTree | combine (const L &label, size_t cardinality, const Binary &op) const |
| |
| DecisionTree | combine (const LabelC &labelC, const Binary &op) const |
| |
| void | dot (std::ostream &os, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero=true) const |
| |
| void | dot (const std::string &name, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero=true) const |
| |
| std::string | dot (const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero=true) const |
| |
template<typename L>
class gtsam::AlgebraicDecisionTree< L >
Algebraic Decision Trees fix the range to double Just has some nice constructors and some syntactic sugar TODO: consider eliminating this class altogether?
Definition at line 39 of file AlgebraicDecisionTree.h.