Go to the documentation of this file.
16 dims_.push_back(dim1);
17 dims_.push_back(dim2);
26 std::cout <<
s <<
" DummyFactor dim = " <<
rowDim_ <<
", keys = { ";
27 for(
Key key: this->
keys()) { std::cout << keyFormatter(
key) <<
" "; }
28 std::cout <<
"}" << std::endl;
38 std::shared_ptr<GaussianFactor>
42 return std::shared_ptr<JacobianFactor>();
45 std::vector<std::pair<Key, Matrix> > terms(this->
size());
46 for(
size_t j=0;
j<this->
size(); ++
j) {
47 terms[
j].first =
keys()[
j];
const Symbol key1('v', 1)
Array< double, 1, 3 > e(1./3., 0.5, 2.)
std::vector< size_t > dims_
virtual bool active(const Values &) const
FastVector< Key > KeyVector
Define collection type once and for all - also used in wrappers.
size_t rowDim_
choose dimension for the rows
A simple factor that can be used to trick gtsam solvers into believing a graph is connected.
const Symbol key2('v', 2)
std::function< std::string(Key)> KeyFormatter
Typedef for a function to format a key, i.e. to convert it to a string.
std::shared_ptr< This > shared_ptr
shared_ptr to this class
static shared_ptr Create(size_t dim)
bool equals(const NonlinearFactor &f, double tol=1e-9) const override
noiseModel::Diagonal::shared_ptr model
const gtsam::Symbol key('X', 0)
Point2(* f)(const Point3 &, OptionalJacobian< 2, 3 >)
void print(const std::string &s="", const KeyFormatter &keyFormatter=DefaultKeyFormatter) const override
const KeyVector & keys() const
Access the factor's involved variable keys.
bool equals(const This &other, double tol=1e-9) const
check equality
std::shared_ptr< Diagonal > shared_ptr
std::shared_ptr< GaussianFactor > linearize(const Values &c) const override
std::uint64_t Key
Integer nonlinear key type.
gtsam
Author(s):
autogenerated on Sun Dec 22 2024 04:11:29