#include <FastMap.h>
Public Types | |
typedef std::map< KEY, VALUE, std::less< KEY >, typename internal::FastDefaultAllocator< std::pair< const KEY, VALUE > >::type > | Base |
Public Member Functions | |
bool | exists (const KEY &e) const |
FastMap () | |
FastMap (const Base &x) | |
FastMap (const FastMap< KEY, VALUE > &x) | |
template<typename INPUTITERATOR > | |
FastMap (INPUTITERATOR first, INPUTITERATOR last) | |
bool | insert2 (const KEY &key, const VALUE &val) |
operator std::map< KEY, VALUE > () const | |
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.
typedef std::map<KEY, VALUE, std::less<KEY>, typename internal::FastDefaultAllocator<std::pair<const KEY, VALUE> >::type > gtsam::FastMap< KEY, VALUE >::Base |
|
inline |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |