gtsam 4.2.0
gtsam
|
Public Member Functions | |
Choice () | |
Default constructor for serialization. | |
bool | isLeaf () const override |
Choice (const L &label, size_t count) | |
Constructor, given choice label and mandatory expected branch count. | |
Choice (const Choice &f, const Choice &g, const Binary &op) | |
Construct from applying binary op to two Choice nodes. | |
const L & | label () const |
Return the label of this choice node. | |
size_t | nrChoices () const |
const std::vector< NodePtr > & | branches () const |
void | push_back (const NodePtr &node) |
add a branch: TODO merge into constructor | |
void | print (const std::string &s, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter) const override |
print (as a tree). | |
void | dot (std::ostream &os, const LabelFormatter &labelFormatter, const ValueFormatter &valueFormatter, bool showZero) const override |
output to graphviz (as a a graph) | |
bool | sameLeaf (const Leaf &q) const override |
Choice-Leaf equality: always false. | |
bool | sameLeaf (const Node &q) const override |
polymorphic equality: if q is a leaf, could be... | |
bool | equals (const Node &q, const CompareFunc &compare) const override |
equality | |
const Y & | operator() (const Assignment< L > &x) const override |
evaluate | |
Choice (const L &label, const Choice &f, const Unary &op) | |
Construct from applying unary op to a Choice node. | |
Choice (const L &label, const Choice &f, const UnaryAssignment &op, const Assignment< L > &assignment) | |
Constructor which accepts a UnaryAssignment op and the corresponding assignment. | |
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 |
template<typename OP > | |
NodePtr | apply_fC_op_gL (const Leaf &gL, OP op) const |
NodePtr | choose (const L &label, size_t index) const override |
choose a branch, recursively | |
![]() | |
const void * | id () const |
Static Public Member Functions | |
static NodePtr | Unique (const ChoicePtr &f) |
If all branches of a choice node f are the same, just return a branch. | |
Public Attributes | |
L | label_ |
the label of the variable on which we split | |
std::vector< NodePtr > | branches_ |
The children of this Choice node. | |
Additional Inherited Members | |
![]() | |
using | Ptr = boost::shared_ptr< const Node > |
|
inline |
Constructor which accepts a UnaryAssignment op and the corresponding assignment.
label | The label for this node. |
f | The original choice node to apply the op on. |
op | Function to apply on the choice node. Takes Assignment and value as arguments. |
assignment | The Assignment that will go to op. |
|
inlineoverridevirtual |
apply unary operator.
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Apply unary operator with assignment.
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
choose a branch, recursively
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
output to graphviz (as a a graph)
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
equality
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
evaluate
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
print (as a tree).
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
Choice-Leaf equality: always false.
Implements gtsam::DecisionTree< L, Y >::Node.
|
inlineoverridevirtual |
polymorphic equality: if q is a leaf, could be...
Implements gtsam::DecisionTree< L, Y >::Node.