|
| DSFMap () |
| constructor
|
|
KEY | find (const KEY &key) const |
| Given key, find the representative key for the set in which it lives.
|
|
void | merge (const KEY &x, const KEY &y) |
| Merge two sets.
|
|
std::map< KEY, Set > | sets () const |
| return all sets, i.e. a partition of all elements
|
|
|
typedef std::set< KEY > | Set |
|
|
struct | Entry |
| We store the forest in an STL map, but parents are done with pointers. More...
|
|
|
typedef std::map< KEY, Entry > | Map |
|
typedef Map::iterator | iterator |
|
|
iterator | find__ (const KEY &key) const |
| Given key, find iterator to initial entry.
|
|
iterator | find_ (const iterator &it) const |
| Given iterator to initial entry, find the root Entry.
|
|
iterator | find_ (const KEY &key) const |
| Given key, find the root Entry.
|
|
The documentation for this class was generated from the following file:
- /Users/dellaert/git/github/gtsam/base/DSFMap.h