|
| BinarySumExpression (const Expression< T > &e1, const Expression< T > &e2) |
|
std::set< Key > | keys () const |
| Return keys that play in this expression.
|
|
void | dims (std::map< Key, int > &map) const |
| Return dimensions for each argument, as a map.
|
|
void | print (const std::string &s) const |
| Print.
|
|
T | value (const Values &values, std::vector< Matrix > *H=nullptr) const |
| Return value and optional derivatives, reverse AD version Notes: this is not terribly efficient, and H should have correct size. The order of the Jacobians is same as keys in either keys() or dims()
|
|
T | value (const Values &values, std::vector< Matrix > &H) const |
|
virtual std::shared_ptr< Expression > | clone () const |
|
const std::shared_ptr< internal::ExpressionNode< T > > & | root () const |
| Return root.
|
|
size_t | traceSize () const |
| Return size needed for memory buffer in traceExecution.
|
|
Expression< T > & | operator+= (const Expression< T > &e) |
| Add another expression to this expression.
|
|
template<typename T>
class gtsam::BinarySumExpression< T >
A BinarySumExpression is a specialization of Expression that adds two expressions together It optimizes the Jacobian calculation for this specific case