#include <ConcurrentMap.h>
Public Types | |
| typedef ConcurrentMapBase< KEY, VALUE > | Base |
 Public Types inherited from gtsam::FastMap< KEY, VALUE > | |
| typedef std::map< KEY, VALUE, std::less< KEY >, typename internal::FastDefaultAllocator< std::pair< const KEY, VALUE > >::type > | Base |
Public Member Functions | |
| ConcurrentMap () | |
| ConcurrentMap (const Base &x) | |
| ConcurrentMap (const ConcurrentMap< KEY, VALUE > &x) | |
| template<typename INPUTITERATOR > | |
| ConcurrentMap (INPUTITERATOR first, INPUTITERATOR last) | |
| bool | exists (const KEY &e) const |
| ConcurrentMap & | operator= (const ConcurrentMap &other)=default |
| Base::size_type | unsafe_erase (const KEY &k) |
| void | unsafe_erase (typename Base::iterator first, typename Base::iterator last) |
| void | unsafe_erase (typename Base::iterator position) |
| Public Member Functions inherited from gtsam::FastMap< KEY, VALUE > | |
| 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 & | operator= (const FastMap< KEY, VALUE > &x)=default |
Private Member Functions | |
| void | erase () |
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.
Definition at line 69 of file ConcurrentMap.h.
Member Typedef Documentation
◆ Base
| typedef ConcurrentMapBase<KEY,VALUE> gtsam::ConcurrentMap< KEY, VALUE >::Base |
Definition at line 73 of file ConcurrentMap.h.
Constructor & Destructor Documentation
◆ ConcurrentMap() [1/4]
|
inline |
Default constructor
Definition at line 76 of file ConcurrentMap.h.
◆ ConcurrentMap() [2/4]
|
inline |
Constructor from a range, passes through to base class
Definition at line 80 of file ConcurrentMap.h.
◆ ConcurrentMap() [3/4]
|
inline |
Copy constructor from another ConcurrentMap
Definition at line 83 of file ConcurrentMap.h.
◆ ConcurrentMap() [4/4]
|
inline |
Copy constructor from the base map class
Definition at line 86 of file ConcurrentMap.h.
Member Function Documentation
◆ erase()
|
inlineprivate |
Definition at line 101 of file ConcurrentMap.h.
◆ exists()
|
inline |
Handy 'exists' function
Definition at line 91 of file ConcurrentMap.h.
◆ operator=()
|
default |
◆ unsafe_erase() [1/3]
|
inline |
Definition at line 97 of file ConcurrentMap.h.
◆ unsafe_erase() [2/3]
|
inline |
Definition at line 98 of file ConcurrentMap.h.
◆ unsafe_erase() [3/3]
|
inline |
Definition at line 96 of file ConcurrentMap.h.
The documentation for this class was generated from the following file: