Go to the documentation of this file.
41 return cardinalities_.size() ==
f.cardinalities_.size() &&
42 std::equal(cardinalities_.begin(), cardinalities_.end(),
43 f.cardinalities_.begin());
58 throw std::runtime_error(
"AllDiff::error not implemented");
67 bool ensureArcConsistency(
Key j,
Domains* domains)
const override;
std::map< Key, size_t > cardinalities_
const KeyFormatter & formatter
DiscreteKeys is a set of keys that can be assembled using the & operator.
KeyFormatter DefaultKeyFormatter
Assign default key formatter.
Point2 operator*(double s, const Point2 &p)
multiply with scalar
bool equals(const DiscreteFactor &other, double tol) const override
equals
void print(const Matrix &A, const string &s, ostream &stream)
internal::enable_if< internal::valid_indexed_view_overload< RowIndices, ColIndices >::value &&internal::traits< typename EIGEN_INDEXED_VIEW_METHOD_TYPE< RowIndices, ColIndices >::type >::ReturnAsIndexedView, typename EIGEN_INDEXED_VIEW_METHOD_TYPE< RowIndices, ColIndices >::type >::type operator()(const RowIndices &rowIndices, const ColIndices &colIndices) EIGEN_INDEXED_VIEW_METHOD_CONST
DiscreteKey discreteKey(size_t i) const
std::function< std::string(Key)> KeyFormatter
Typedef for a function to format a key, i.e. to convert it to a string.
std::map< Key, Domain > Domains
specialized key for discrete variables
Point2(* f)(const Point3 &, OptionalJacobian< 2, 3 >)
std::pair< Key, size_t > DiscreteKey
std::shared_ptr< Constraint > shared_ptr
AlgebraicDecisionTree< Key > errorTree() const override
Compute error for each assignment and return as a tree.
std::uint64_t Key
Integer nonlinear key type.
bool equal(const T &obj1, const T &obj2, double tol)
gtsam
Author(s):
autogenerated on Fri Nov 1 2024 03:31:52