gtsam::ConcurrentMap< KEY, VALUE > Class Template Reference

#include <ConcurrentMap.h>

Inheritance diagram for gtsam::ConcurrentMap< KEY, VALUE >:

Collaboration diagram for gtsam::ConcurrentMap< KEY, VALUE >:

Public Types
typedef ConcurrentMapBase< KEY, VALUE >	Base

Public Member Functions
	ConcurrentMap ()
template<typename INPUTITERATOR >
	ConcurrentMap (INPUTITERATOR first, INPUTITERATOR last)
	ConcurrentMap (const ConcurrentMap< KEY, VALUE > &x)
	ConcurrentMap (const Base &x)
bool	exists (const KEY &e) const
void	unsafe_erase (typename Base::iterator position)
Base::size_type	unsafe_erase (const KEY &k)
void	unsafe_erase (typename Base::iterator first, typename Base::iterator last)
	operator std::map< KEY, VALUE > () const
bool	insert2 (const KEY &key, const VALUE &val)

Detailed Description

template<typename KEY, typename VALUE>
class gtsam::ConcurrentMap< KEY, VALUE >

FastMap is a thin wrapper around std::map that uses the boost fast_pool_allocator instead of the default STL allocator. This is just a convenience to avoid having lengthy types in the code. Through timing, we've seen that the fast_pool_allocator can lead to speedups of several percent.

Constructor & Destructor Documentation

ConcurrentMap() [1/4]

template<typename KEY, typename VALUE>

gtsam::ConcurrentMap< KEY, VALUE >::ConcurrentMap ( )

inline

Default constructor

ConcurrentMap() [2/4]

template<typename KEY, typename VALUE>

template<typename INPUTITERATOR >

gtsam::ConcurrentMap< KEY, VALUE >::ConcurrentMap ( INPUTITERATOR  first, INPUTITERATOR  last  )

inline

Constructor from a range, passes through to base class

ConcurrentMap() [3/4]

template<typename KEY, typename VALUE>

gtsam::ConcurrentMap< KEY, VALUE >::ConcurrentMap ( const ConcurrentMap< KEY, VALUE > &  x )

inline

Copy constructor from another ConcurrentMap

ConcurrentMap() [4/4]

template<typename KEY, typename VALUE>

gtsam::ConcurrentMap< KEY, VALUE >::ConcurrentMap ( const Base &  x )

inline

Copy constructor from the base map class

Member Function Documentation

exists()

template<typename KEY, typename VALUE>

bool gtsam::ConcurrentMap< KEY, VALUE >::exists ( const KEY &  e ) const

inline

Handy 'exists' function

insert2()

template<typename KEY, typename VALUE>

bool gtsam::FastMap< KEY, VALUE >::insert2 ( const KEY &  key, const VALUE &  val  )

inlineinherited

Handy 'insert' function for Matlab wrapper

operator std::map< KEY, VALUE >()

template<typename KEY, typename VALUE>

gtsam::FastMap< KEY, VALUE >::operator std::map< KEY, VALUE > ( ) const

inlineinherited

Conversion to a standard STL container

---

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

• /home/docs/checkouts/readthedocs.org/user_builds/gtsam-jlblanco-docs/checkouts/latest/gtsam/base/ConcurrentMap.h