|
|
| Leaf () |
| | Default constructor for serialization.
|
|
| Leaf (const Y &constant) |
| | Constructor from constant.
|
|
const Y & | constant () const |
| | Return the constant.
|
| bool | sameLeaf (const Leaf &q) const override |
| | Leaf-Leaf equality.
|
| bool | sameLeaf (const Node &q) const override |
| | polymorphic equality: is q a leaf and is it the same as this leaf?
|
| bool | equals (const Node &q, const CompareFunc &compare) const override |
| | equality up to tolerance
|
| void | print (const std::string &s, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter) const override |
| | print
|
| void | dot (std::ostream &os, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero) const override |
| | Write graphviz format to stream os.
|
| const Y & | operator() (const Assignment< L > &x) const override |
| | evaluate
|
| NodePtr | apply (const Unary &op) const override |
| | apply unary operator
|
| NodePtr | apply (const UnaryAssignment &op, const Assignment< L > &assignment) const override |
| | Apply unary operator with assignment.
|
| NodePtr | apply_f_op_g (const Node &g, const Binary &op) const override |
| NodePtr | apply_g_op_fL (const Leaf &fL, const Binary &op) const override |
| NodePtr | apply_g_op_fC (const Choice &fC, const Binary &op) const override |
| NodePtr | choose (const L &label, size_t index) const override |
| | choose a branch, create new memory !
|
| bool | isLeaf () const override |
|
const void * | id () const |
|
|
Y | constant_ |
| | constant stored in this leaf
|
|
|
using | Ptr = std::shared_ptr<Node> |
◆ apply() [1/2]
template<typename L, typename Y>
template<typename L, typename Y>
◆ apply() [2/2]
template<typename L, typename Y>
template<typename L, typename Y>
◆ apply_f_op_g()
template<typename L, typename Y>
template<typename L, typename Y>
◆ apply_g_op_fC()
template<typename L, typename Y>
template<typename L, typename Y>
◆ apply_g_op_fL()
template<typename L, typename Y>
template<typename L, typename Y>
◆ choose()
template<typename L, typename Y>
template<typename L, typename Y>
◆ dot()
template<typename L, typename Y>
template<typename L, typename Y>
| void gtsam::DecisionTree< L, Y >::Leaf< L, Y >::dot |
( |
std::ostream & | os, |
|
|
const LabelFormatter & | labelFormatter, |
|
|
const ValueFormatter & | valueFormatter, |
|
|
bool | showZero ) const |
|
inlineoverridevirtual |
◆ equals()
template<typename L, typename Y>
template<typename L, typename Y>
◆ isLeaf()
template<typename L, typename Y>
template<typename L, typename Y>
◆ operator()()
template<typename L, typename Y>
template<typename L, typename Y>
◆ print()
template<typename L, typename Y>
template<typename L, typename Y>
| void gtsam::DecisionTree< L, Y >::Leaf< L, Y >::print |
( |
const std::string & | s, |
|
|
const LabelFormatter & | labelFormatter, |
|
|
const ValueFormatter & | valueFormatter ) const |
|
inlineoverridevirtual |
◆ sameLeaf() [1/2]
template<typename L, typename Y>
template<typename L, typename Y>
◆ sameLeaf() [2/2]
template<typename L, typename Y>
template<typename L, typename Y>
The documentation for this struct was generated from the following file: