Inheritance diagram for gtsam::DummyFactor:

Collaboration diagram for gtsam::DummyFactor:

Public Types
typedef std::shared_ptr< This >	shared_ptr

typedef KeyVector::iterator	iterator
	Iterator over keys.

typedef KeyVector::const_iterator	const_iterator
	Const iterator over keys.

Public Member Functions
	DummyFactor ()

	DummyFactor (const Key &key1, size_t dim1, const Key &key2, size_t dim2)

void	print (const std::string &s="", const KeyFormatter &keyFormatter=DefaultKeyFormatter) const override

bool	equals (const NonlinearFactor &f, double tol=1e-9) const override

const std::vector< size_t > &	dims () const

double	error (const Values &c) const override

size_t	dim () const override

std::shared_ptr< GaussianFactor >	linearize (const Values &c) const override

NonlinearFactor::shared_ptr	clone () const override

Testable
bool	equals (const This &other, double tol=1e-9) const
	check equality

virtual void	printKeys (const std::string &s="Factor", const KeyFormatter &formatter=DefaultKeyFormatter) const
	print only keys

Standard Interface
double	error (const HybridValues &c) const override

virtual bool	active (const Values &) const

virtual shared_ptr	rekey (const std::map< Key, Key > &rekey_mapping) const

virtual shared_ptr	rekey (const KeyVector &new_keys) const

virtual bool	sendable () const

Standard Interface
bool	empty () const
	Whether the factor is empty (involves zero variables).

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

const_iterator	end () const

size_t	size () const

Advanced Interface
KeyVector &	keys ()

iterator	begin ()

iterator	end ()

Protected Types
typedef Factor	Base

typedef NonlinearFactor	This

Static Protected Member Functions
Standard Constructors
template<typename CONTAINER >
static Factor	FromKeys (const CONTAINER &keys)

template<typename ITERATOR >
static Factor	FromIterators (ITERATOR first, ITERATOR last)

Protected Attributes
std::vector< size_t >	dims_

size_t	rowDim_
	choose dimension for the rows

KeyVector	keys_
	The keys involved in this factor.

Constructor & Destructor Documentation

◆ DummyFactor() [1/2]

gtsam::DummyFactor::DummyFactor ( )

inline

Default constructor: don't use directly

◆ DummyFactor() [2/2]

gtsam::DummyFactor::DummyFactor	(	const Key &	key1,
		size_t	dim1,
		const Key &	key2,
		size_t	dim2
	)

standard binary constructor

Member Function Documentation

◆ active()

virtual bool gtsam::NonlinearFactor::active ( const Values & ) const

inlinevirtualinherited

Checks whether a factor should be used based on a set of values. This is primarily used to implement inequality constraints that require a variable active set. For all others, the default implementation returning true solves this problem.

In an inequality/bounding constraint, this active() returns true when the constraint is NOT fulfilled.

Returns: true if the constraint is active

Reimplemented in gtsam::BoundingConstraint2< VALUE1, VALUE2 >, gtsam::AntiFactor, and gtsam::BoundingConstraint1< VALUE >.

◆ begin() [1/2]

const_iterator gtsam::Factor::begin ( ) const

inlineinherited

Iterator at beginning of involved variable keys

◆ begin() [2/2]

iterator gtsam::Factor::begin ( )

inlineinherited

Iterator at beginning of involved variable keys

◆ clone()

NonlinearFactor::shared_ptr gtsam::DummyFactor::clone ( ) const

inlineoverridevirtual

Creates a shared_ptr clone of the factor - needs to be specialized to allow for subclasses

By default, throws exception if subclass does not implement the function.

Reimplemented from gtsam::NonlinearFactor.

◆ dim()

size_t gtsam::DummyFactor::dim ( ) const

inlineoverridevirtual

get the dimension of the factor (number of rows on linearization)

Implements gtsam::NonlinearFactor.

◆ end() [1/2]

const_iterator gtsam::Factor::end ( ) const

inlineinherited

Iterator at end of involved variable keys

◆ end() [2/2]

iterator gtsam::Factor::end ( )

inlineinherited

Iterator at end of involved variable keys

◆ equals()

bool gtsam::DummyFactor::equals	(	const NonlinearFactor &	f,
		double	tol = `1e-9`
	)		const

overridevirtual

Check if two factors are equal

Reimplemented from gtsam::NonlinearFactor.

◆ error() [1/2]

double gtsam::DummyFactor::error ( const Values & c ) const

inlineoverridevirtual

Calculate the error of the factor - zero for dummy factors

Reimplemented from gtsam::NonlinearFactor.

◆ error() [2/2]

double gtsam::NonlinearFactor::error ( const HybridValues & c ) const

overridevirtualinherited

All factor types need to implement an error function. In factor graphs, this is the negative log-likelihood.

Reimplemented from gtsam::Factor.

◆ FromIterators()

template<typename ITERATOR >

static Factor gtsam::Factor::FromIterators	(	ITERATOR	first,
		ITERATOR	last
	)

inlinestaticprotectedinherited

Construct factor from iterator keys. This is called internally from derived factor static factor methods, as a workaround for not being able to call the protected constructors above.

◆ FromKeys()

template<typename CONTAINER >

static Factor gtsam::Factor::FromKeys ( const CONTAINER & keys )

inlinestaticprotectedinherited

Construct factor from container of keys. This is called internally from derived factor static factor methods, as a workaround for not being able to call the protected constructors above.

◆ keys()

KeyVector& gtsam::Factor::keys ( )

inlineinherited

Returns: keys involved in this factor

◆ linearize()

std::shared_ptr<GaussianFactor> gtsam::DummyFactor::linearize ( const Values & c ) const

overridevirtual

linearize to a GaussianFactor

Implements gtsam::NonlinearFactor.

◆ print()

void gtsam::DummyFactor::print	(	const std::string &	s = `""`,
		const KeyFormatter &	keyFormatter = `DefaultKeyFormatter`
	)		const

overridevirtual

print

Reimplemented from gtsam::NonlinearFactor.

◆ rekey() [1/2]

virtual shared_ptr gtsam::NonlinearFactor::rekey ( const std::map< Key, Key > & rekey_mapping ) const

virtualinherited

Creates a shared_ptr clone of the factor with different keys using a map from old->new keys

Reimplemented in gtsam::LinearContainerFactor.

◆ rekey() [2/2]

virtual shared_ptr gtsam::NonlinearFactor::rekey ( const KeyVector & new_keys ) const

virtualinherited

Clones a factor and fully replaces its keys

Parameters

new_keys is the full replacement set of keys

Reimplemented in gtsam::LinearContainerFactor.

◆ sendable()

virtual bool gtsam::NonlinearFactor::sendable ( ) const

inlinevirtualinherited

Should the factor be evaluated in the same thread as the caller This is to enable factors that has shared states (like the Python GIL lock)

Reimplemented in gtsam::CustomFactor.

◆ size()

size_t gtsam::Factor::size ( ) const

inlineinherited

Returns: the number of variables involved in this factor

The documentation for this class was generated from the following file:

/home/docs/checkouts/readthedocs.org/user_builds/gtsam-jlblanco-docs/checkouts/latest/gtsam_unstable/slam/DummyFactor.h

Public Types

Public Member Functions

Protected Types

Static Protected Member Functions

Protected Attributes

Constructor & Destructor Documentation

◆ DummyFactor() [1/2]

◆ DummyFactor() [2/2]

Member Function Documentation

◆ active()

◆ begin() [1/2]

◆ begin() [2/2]

◆ clone()

◆ dim()

◆ end() [1/2]

◆ end() [2/2]

◆ equals()

◆ error() [1/2]

◆ error() [2/2]

◆ FromIterators()

◆ FromKeys()

◆ keys()

◆ linearize()

◆ print()

◆ rekey() [1/2]

◆ rekey() [2/2]

◆ sendable()

◆ size()