Go to the documentation of this file.
27 using namespace gtsam;
56 M(1), std::make_shared<JacobianFactor>(
X(1), I_3x3,
Z_3x1),
57 std::make_shared<JacobianFactor>(
X(1), I_3x3, Vector3::Ones()));
60 KeySet expected_continuous{
X(0),
X(1)};
static int runAllTests(TestResult &result)
Implementation of a discrete conditional mixture factor. Implements a joint discrete-continuous facto...
#define EXPECT(condition)
static const Eigen::MatrixBase< Vector3 >::ConstantReturnType Z_3x1
const KeySet continuousKeySet() const
Get all the continuous keys in the factor graph.
Provides additional testing facilities for common data structures.
TEST(HybridFactorGraph, Constructor)
KeySet discreteKeySet() const
Get all the discrete keys in the factor graph, as a set.
a decision tree is a function from assignments to values.
Factor graph with utilities for hybrid factors.
Linearized Hybrid factor graph that uses type erasure.
std::pair< Key, size_t > DiscreteKey
bool assert_container_equality(const std::map< size_t, V2 > &expected, const std::map< size_t, V2 > &actual)
IsDerived< DERIVEDFACTOR > add(std::shared_ptr< DERIVEDFACTOR > factor)
add is a synonym for push_back.
Matrix< RealScalar, Dynamic, Dynamic > M
gtsam
Author(s):
autogenerated on Tue Jun 25 2024 03:05:58