#include <FastSet.h>

Public Types | |
| typedef std::set< VALUE, std::less< VALUE >, typename internal::FastDefaultAllocator< VALUE >::type > | Base |
Public Member Functions | |
| Base ()=default | |
| Base (const Base &)=delete | |
| bool | equals (const FastSet< VALUE > &other, double tol=1e-9) const |
| bool | exists (const VALUE &e) const |
| FastSet ()=default | |
| Default constructor. More... | |
| FastSet (const Base &x) | |
| FastSet (const FastSet< VALUE > &x) | |
| template<typename INPUTCONTAINER > | |
| FastSet (const INPUTCONTAINER &container) | |
| void | merge (const FastSet &other) |
| operator std::set< VALUE > () const | |
| FastSet & | operator= (const FastSet &other)=default |
| void | print (const std::string &str="") const |
Private Member Functions | |
| GTSAM_CONCEPT_ASSERT (IsTestable< VALUE >) | |
FastSet is a thin wrapper around std::set 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 %.
| typedef std::set<VALUE, std::less<VALUE>, typename internal::FastDefaultAllocator<VALUE>::type> gtsam::FastSet< VALUE >::Base |
|
default |
Default constructor.
|
inlineexplicit |
|
inline |
|
inline |
|
default |
|
delete |
|
inline |
|
inline |
|
private |
|
inline |
|
inline |
|
default |
|
inline |