gtsam::CSP Member List

This is the complete list of members for gtsam::CSP, including all inherited members.

add(const DiscreteKey &j, SOURCE table) (defined in gtsam::DiscreteFactorGraph)	gtsam::DiscreteFactorGraph	inline
add(const DiscreteKey &j1, const DiscreteKey &j2, SOURCE table) (defined in gtsam::DiscreteFactorGraph)	gtsam::DiscreteFactorGraph	inline
add(const DiscreteKeys &keys, SOURCE table)	gtsam::DiscreteFactorGraph	inline
FactorGraph< DiscreteFactor >::add(boost::shared_ptr< DERIVEDFACTOR > factor)	gtsam::FactorGraph< DiscreteFactor >	inline
FactorGraph< DiscreteFactor >::add(const FACTOR_OR_CONTAINER &factorOrContainer)	gtsam::FactorGraph< DiscreteFactor >	inline
add_factors(const CONTAINER &factors, bool useEmptySlots=false)	gtsam::FactorGraph< DiscreteFactor >
addAllDiff(const DiscreteKey &key1, const DiscreteKey &key2)	gtsam::CSP	inline
addAllDiff(const DiscreteKeys &dkeys)	gtsam::CSP	inline
addSingleValue(const DiscreteKey &dkey, size_t value)	gtsam::CSP	inline
at(size_t i) const	gtsam::FactorGraph< DiscreteFactor >	inline
at(size_t i)	gtsam::FactorGraph< DiscreteFactor >	inline
back() const	gtsam::FactorGraph< DiscreteFactor >	inline
Base typedef	gtsam::DiscreteFactorGraph
BaseEliminateable typedef	gtsam::DiscreteFactorGraph
BayesNetType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
BayesTreeType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
begin() const	gtsam::FactorGraph< DiscreteFactor >	inline
begin()	gtsam::FactorGraph< DiscreteFactor >	inline
ConditionalType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
DiscreteFactorGraph()	gtsam::DiscreteFactorGraph	inline
DiscreteFactorGraph(ITERATOR firstFactor, ITERATOR lastFactor)	gtsam::DiscreteFactorGraph	inline
DiscreteFactorGraph(const CONTAINER &factors)	gtsam::DiscreteFactorGraph	inlineexplicit
DiscreteFactorGraph(const FactorGraph< DERIVEDFACTOR > &graph)	gtsam::DiscreteFactorGraph	inline
Eliminate typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminateMultifrontal(OptionalOrderingType orderingType=boost::none, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminateMultifrontal(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminatePartialMultifrontal(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminatePartialMultifrontal(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminatePartialSequential(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminatePartialSequential(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminateSequential(OptionalOrderingType orderingType=boost::none, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
eliminateSequential(const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
EliminationResult typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
EliminationTraitsType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
EliminationTreeType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
emplace_shared(Args &&... args)	gtsam::FactorGraph< DiscreteFactor >	inline
empty() const	gtsam::FactorGraph< DiscreteFactor >	inline
end() const	gtsam::FactorGraph< DiscreteFactor >	inline
end()	gtsam::FactorGraph< DiscreteFactor >	inline
equals(const This &fg, double tol=1e-9) const (defined in gtsam::DiscreteFactorGraph)	gtsam::DiscreteFactorGraph
FactorGraph< DiscreteFactor >::equals(const This &fg, double tol=1e-9) const	gtsam::FactorGraph< DiscreteFactor >
erase(iterator item)	gtsam::FactorGraph< DiscreteFactor >	inline
erase(iterator first, iterator last)	gtsam::FactorGraph< DiscreteFactor >	inline
exists(size_t idx) const	gtsam::FactorGraph< DiscreteFactor >	inline
FactorGraph()	gtsam::FactorGraph< DiscreteFactor >	inlineprotected
FactorGraph(ITERATOR firstFactor, ITERATOR lastFactor)	gtsam::FactorGraph< DiscreteFactor >	inlineprotected
FactorGraph(const CONTAINER &factors)	gtsam::FactorGraph< DiscreteFactor >	inlineexplicitprotected
factors_	gtsam::FactorGraph< DiscreteFactor >	protected
FactorType typedef	gtsam::FactorGraph< DiscreteFactor >
front() const	gtsam::FactorGraph< DiscreteFactor >	inline
Indices typedef	gtsam::CSP
JunctionTreeType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
keys() const	gtsam::DiscreteFactorGraph
keyVector() const	gtsam::FactorGraph< DiscreteFactor >
marginal(const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
marginalMultifrontalBayesNet(boost::variant< const Ordering &, const KeyVector & > variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
marginalMultifrontalBayesNet(boost::variant< const Ordering &, const KeyVector & > variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
marginalMultifrontalBayesTree(boost::variant< const Ordering &, const KeyVector & > variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
marginalMultifrontalBayesTree(boost::variant< const Ordering &, const KeyVector & > variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
nrFactors() const	gtsam::FactorGraph< DiscreteFactor >
operator()(const DiscreteFactor::Values &values) const	gtsam::DiscreteFactorGraph
operator+=(boost::shared_ptr< DERIVEDFACTOR > factor)	gtsam::FactorGraph< DiscreteFactor >	inline
operator+=(const FACTOR_OR_CONTAINER &factorOrContainer)	gtsam::FactorGraph< DiscreteFactor >	inline
operator[](size_t i) const	gtsam::FactorGraph< DiscreteFactor >	inline
operator[](size_t i)	gtsam::FactorGraph< DiscreteFactor >	inline
optimalAssignment() const	gtsam::CSP
optimalAssignment(const Ordering &ordering) const	gtsam::CSP
optimize() const	gtsam::DiscreteFactorGraph
OptionalOrderingType typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
OptionalVariableIndex typedef	gtsam::EliminateableFactorGraph< DiscreteFactorGraph >
print(const std::string &s="DiscreteFactorGraph", const KeyFormatter &formatter=DefaultKeyFormatter) const override	gtsam::DiscreteFactorGraph	virtual
product() const	gtsam::DiscreteFactorGraph
push_back(boost::shared_ptr< DERIVEDFACTOR > factor)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(const DERIVEDFACTOR &factor)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(ITERATOR firstFactor, ITERATOR lastFactor)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(ITERATOR firstFactor, ITERATOR lastFactor)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(const CONTAINER &container)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(const CONTAINER &container)	gtsam::FactorGraph< DiscreteFactor >	inline
push_back(const BayesTree< CLIQUE > &bayesTree)	gtsam::FactorGraph< DiscreteFactor >	inline
remove(size_t i)	gtsam::FactorGraph< DiscreteFactor >	inline
replace(size_t index, sharedFactor factor)	gtsam::FactorGraph< DiscreteFactor >	inline
reserve(size_t size)	gtsam::FactorGraph< DiscreteFactor >	inline
resize(size_t size)	gtsam::FactorGraph< DiscreteFactor >	inline
runArcConsistency(size_t cardinality, size_t nrIterations=10, bool print=false) const (defined in gtsam::CSP)	gtsam::CSP
shared_ptr typedef	gtsam::DiscreteFactorGraph
sharedFactor typedef	gtsam::FactorGraph< DiscreteFactor >
sharedValues typedef (defined in gtsam::CSP)	gtsam::CSP
size() const	gtsam::FactorGraph< DiscreteFactor >	inline
This typedef	gtsam::DiscreteFactorGraph
Values typedef (defined in gtsam::CSP)	gtsam::CSP
~DiscreteFactorGraph()	gtsam::DiscreteFactorGraph	inlinevirtual
~FactorGraph()=default	gtsam::FactorGraph< DiscreteFactor >	virtual