gtsam::BinaryAllDiff Class Reference
Detailed Description
Binary AllDiff constraint Returns 1 if values for two keys are different, 0 otherwise DiscreteFactors are all awkward in that they have to store two types of keys: for each variable we have a Index and an Index.
In this factor, we keep the Indices locally, and the Indices are stored in IndexFactor.
Inheritance diagram for gtsam::BinaryAllDiff:
Public Member Functions | |
| BinaryAllDiff (const DiscreteKey &key1, const DiscreteKey &key2) | |
| cardinality More... | |
| virtual void | print (const std::string &s="", const KeyFormatter &formatter=DefaultKeyFormatter) const |
| bool | equals (const DiscreteFactor &other, double tol) const |
| equals | |
| virtual double | operator() (const Values &values) const |
| Calculate value. | |
| virtual DecisionTreeFactor | toDecisionTreeFactor () const |
| Convert into a decisiontree. | |
| virtual DecisionTreeFactor | operator * (const DecisionTreeFactor &f) const |
| Multiply into a decisiontree. | |
| bool | ensureArcConsistency (size_t j, std::vector< Domain > &domains) const |
| virtual Constraint::shared_ptr | partiallyApply (const Values &) const |
| Partially apply known values. | |
| virtual Constraint::shared_ptr | partiallyApply (const std::vector< Domain > &) const |
| Partially apply known values, domain version. | |
| Public Member Functions inherited from gtsam::Constraint | |
| Constraint () | |
| Default constructor for I/O. | |
| virtual | ~Constraint () |
| Virtual destructor. | |
| Public Member Functions inherited from gtsam::DiscreteFactor | |
| DiscreteFactor () | |
| Default constructor creates empty factor. | |
| template<typename CONTAINER > | |
| DiscreteFactor (const CONTAINER &keys) | |
| Construct from container of keys. More... | |
| virtual | ~DiscreteFactor () |
| Virtual destructor. | |
| virtual bool | empty () const |
| Test whether the factor is empty. | |
| Public Member Functions inherited from gtsam::Factor | |
| KeyVector & | keys () |
| iterator | begin () |
| Iterator at beginning of involved variable keys. | |
| iterator | end () |
| Iterator at end of involved variable keys. | |
| void | print (const std::string &s="Factor", const KeyFormatter &formatter=DefaultKeyFormatter) const |
| print | |
| void | printKeys (const std::string &s="Factor", const KeyFormatter &formatter=DefaultKeyFormatter) const |
| print only keys | |
| Key | front () const |
| First key. | |
| Key | back () const |
| Last key. | |
| const_iterator | find (Key key) const |
| find | |
| const KeyVector & | keys () const |
| Access the factor's involved variable keys. | |
| const_iterator | begin () const |
| Iterator at beginning of involved variable keys. | |
| const_iterator | end () const |
| Iterator at end of involved variable keys. | |
| size_t | size () const |
Additional Inherited Members | |
| Public Types inherited from gtsam::Constraint | |
| typedef boost::shared_ptr< Constraint > | shared_ptr |
| Public Types inherited from gtsam::DiscreteFactor | |
| typedef DiscreteFactor | This |
| This class. | |
| typedef boost::shared_ptr< DiscreteFactor > | shared_ptr |
| shared_ptr to this class | |
| typedef Factor | Base |
| Our base class. | |
| typedef Assignment< Key > | Values |
| A map from keys to values TODO: Do we need this? Should we just use gtsam::Values? We just need another special DiscreteValue to represent labels, However, all other Lie's operators are undefined in this class. More... | |
| typedef boost::shared_ptr< Values > | sharedValues |
| Public Types inherited from gtsam::Factor | |
| typedef KeyVector::iterator | iterator |
| Iterator over keys. | |
| typedef KeyVector::const_iterator | const_iterator |
| Const iterator over keys. | |
| Protected Member Functions inherited from gtsam::Constraint | |
| Constraint (const KeyVector &js) | |
| Construct n-way factor. | |
| Constraint (Key j) | |
| Construct unary factor. | |
| Constraint (Key j1, Key j2) | |
| Construct binary factor. | |
| template<class KeyIterator > | |
| Constraint (KeyIterator beginKey, KeyIterator endKey) | |
| construct from container | |
| Protected Member Functions inherited from gtsam::Factor | |
| Factor () | |
| Default constructor for I/O. | |
| template<typename CONTAINER > | |
| Factor (const CONTAINER &keys) | |
| Construct factor from container of keys. More... | |
| template<typename ITERATOR > | |
| Factor (ITERATOR first, ITERATOR last) | |
| Construct factor from iterator keys. More... | |
| bool | equals (const This &other, double tol=1e-9) const |
| check equality | |
| Static Protected Member Functions inherited from gtsam::Factor | |
| template<typename CONTAINER > | |
| static Factor | FromKeys (const CONTAINER &keys) |
| Construct factor from container of keys. More... | |
| template<typename ITERATOR > | |
| static Factor | FromIterators (ITERATOR first, ITERATOR last) |
| Construct factor from iterator keys. More... | |
| Protected Attributes inherited from gtsam::Factor | |
| KeyVector | keys_ |
| The keys involved in this factor. | |
Constructor & Destructor Documentation
◆ BinaryAllDiff()
|
inline |
cardinality
Constructor
The documentation for this class was generated from the following file:
- /Users/dellaert/git/gtsam/gtsam_unstable/discrete/BinaryAllDiff.h
