|
template<class... Args> |
void | add (Args &&...args) |
| Add a linear inequality, forwards arguments to LinearInequality. More...
|
|
bool | equals (const InequalityFactorGraph &other, double tol=1e-9) const |
|
double | error (const VectorValues &x) const |
|
void | print (const std::string &str="", const KeyFormatter &keyFormatter=DefaultKeyFormatter) const override |
|
virtual | ~FactorGraph ()=default |
| Default destructor. More...
|
|
void | reserve (size_t size) |
|
IsDerived< DERIVEDFACTOR > | push_back (boost::shared_ptr< DERIVEDFACTOR > factor) |
| Add a factor directly using a shared_ptr. More...
|
|
IsDerived< DERIVEDFACTOR > | push_back (const DERIVEDFACTOR &factor) |
|
IsDerived< DERIVEDFACTOR > | emplace_shared (Args &&...args) |
| Emplace a shared pointer to factor of given type. More...
|
|
IsDerived< DERIVEDFACTOR > | add (boost::shared_ptr< DERIVEDFACTOR > factor) |
| add is a synonym for push_back. More...
|
|
std::enable_if< std::is_base_of< FactorType, DERIVEDFACTOR >::value, boost::assign::list_inserter< RefCallPushBack< This > > >::type | operator+= (boost::shared_ptr< DERIVEDFACTOR > factor) |
| += works well with boost::assign list inserter. More...
|
|
HasDerivedElementType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
|
HasDerivedValueType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
| Push back many factors with an iterator (factors are copied) More...
|
|
HasDerivedElementType< CONTAINER > | push_back (const CONTAINER &container) |
|
HasDerivedValueType< CONTAINER > | push_back (const CONTAINER &container) |
| Push back non-pointer objects in a container (factors are copied). More...
|
|
void | add (const FACTOR_OR_CONTAINER &factorOrContainer) |
|
boost::assign::list_inserter< CRefCallPushBack< This > > | operator+= (const FACTOR_OR_CONTAINER &factorOrContainer) |
|
std::enable_if< std::is_base_of< This, typename CLIQUE::FactorGraphType >::value >::type | push_back (const BayesTree< CLIQUE > &bayesTree) |
|
FactorIndices | add_factors (const CONTAINER &factors, bool useEmptySlots=false) |
|
bool | equals (const This &fg, double tol=1e-9) const |
|
size_t | size () const |
|
bool | empty () const |
|
const sharedFactor | at (size_t i) const |
|
sharedFactor & | at (size_t i) |
|
const sharedFactor | operator[] (size_t i) const |
|
sharedFactor & | operator[] (size_t i) |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
sharedFactor | front () const |
|
sharedFactor | back () const |
|
iterator | begin () |
|
iterator | end () |
|
void | resize (size_t size) |
|
void | remove (size_t i) |
|
void | replace (size_t index, sharedFactor factor) |
|
iterator | erase (iterator item) |
|
iterator | erase (iterator first, iterator last) |
|
size_t | nrFactors () const |
|
KeySet | keys () const |
|
KeyVector | keyVector () const |
|
bool | exists (size_t idx) const |
|
Collection of all Linear Inequality constraints Ax-b <= 0 of a Programming problem as a Factor Graph
Definition at line 32 of file InequalityFactorGraph.h.