#include <DSFMap.h>
Classes | |
struct | Entry |
We store the forest in an STL map, but parents are done with pointers. More... | |
Public Types | |
typedef std::set< KEY > | Set |
Public Member Functions | |
DSFMap () | |
constructor More... | |
KEY | find (const KEY &key) const |
Given key, find the representative key for the set in which it lives. More... | |
void | merge (const KEY &x, const KEY &y) |
Merge two sets. More... | |
std::map< KEY, Set > | sets () const |
return all sets, i.e. a partition of all elements More... | |
Protected Types | |
typedef Map::iterator | iterator |
typedef std::map< KEY, Entry > | Map |
Protected Member Functions | |
iterator | find_ (const iterator &it) const |
Given iterator to initial entry, find the root Entry. More... | |
iterator | find_ (const KEY &key) const |
Given key, find the root Entry. More... | |
iterator | find__ (const KEY &key) const |
Given key, find iterator to initial entry. More... | |
Protected Attributes | |
Map | entries_ |
Disjoint set forest using an STL map data structure underneath Uses rank compression and union by rank, iterator version
|
protected |
|
protected |
typedef std::set<KEY> gtsam::DSFMap< KEY >::Set |
|
inline |
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inline |
|
mutableprotected |