Go to the documentation of this file.
18 using namespace gtsam;
23 TEST( testDummyFactor, basics ) {
26 size_t dim1 = 3, dim2 = 3;
47 CHECK(actLinearization);
const Symbol key1('v', 1)
static int runAllTests(TestResult &result)
Array< double, 1, 3 > e(1./3., 0.5, 2.)
#define EXPECT_LONGS_EQUAL(expected, actual)
#define EXPECT(condition)
static const Eigen::MatrixBase< Vector3 >::ConstantReturnType Z_3x1
Provides additional testing facilities for common data structures.
A simple factor that can be used to trick gtsam solvers into believing a graph is connected.
const Symbol key2('v', 2)
#define DOUBLES_EQUAL(expected, actual, threshold)
std::shared_ptr< This > shared_ptr
shared_ptr to this class
static shared_ptr Create(size_t dim)
TEST(SmartFactorBase, Pinhole)
const KeyVector & keys() const
Access the factor's involved variable keys.
std::shared_ptr< Diagonal > shared_ptr
bool assert_equal(const Matrix &expected, const Matrix &actual, double tol)
const std::vector< size_t > & dims() const
std::shared_ptr< GaussianFactor > linearize(const Values &c) const override
const SharedNoiseModel model3
std::uint64_t Key
Integer nonlinear key type.
double error(const Values &c) const override
#define LONGS_EQUAL(expected, actual)
gtsam
Author(s):
autogenerated on Sun Dec 22 2024 04:16:14