gtsam 4.2.0
gtsam
|
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.
Public Member Functions | |
ConcurrentMap () | |
Default constructor. | |
template<typename INPUTITERATOR > | |
ConcurrentMap (INPUTITERATOR first, INPUTITERATOR last) | |
Constructor from a range, passes through to base class. | |
ConcurrentMap (const ConcurrentMap< KEY, VALUE > &x) | |
Copy constructor from another ConcurrentMap. | |
ConcurrentMap (const Base &x) | |
Copy constructor from the base map class. | |
bool | exists (const KEY &e) const |
Handy 'exists' function. | |
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) |
![]() | |
FastMap () | |
Default constructor. | |
template<typename INPUTITERATOR > | |
FastMap (INPUTITERATOR first, INPUTITERATOR last) | |
Constructor from a range, passes through to base class. | |
FastMap (const FastMap< KEY, VALUE > &x) | |
Copy constructor from another FastMap. | |
FastMap (const Base &x) | |
Copy constructor from the base map class. | |
operator std::map< KEY, VALUE > () const | |
Conversion to a standard STL container. | |
bool | insert2 (const KEY &key, const VALUE &val) |
Handy 'insert' function for Matlab wrapper. | |
bool | exists (const KEY &e) const |
Handy 'exists' function. | |
Public Types | |
typedef ConcurrentMapBase< KEY, VALUE > | Base |
![]() | |
typedef std::map< KEY, VALUE, std::less< KEY >, typename internal::FastDefaultAllocator< std::pair< const KEY, VALUE > >::type > | Base |
Friends | |
class | boost::serialization::access |
Serialization function. | |