Go to the documentation of this file.
43 typedef std::set<KEY>
Set;
76 return this->
add(key,
key);
82 *
this = this->
add(key,
key);
120 t.findSet_(pair.first);
128 t =
t.add(
func(pair.first),
func(pair.second));
136 if (pair.first == pair.second)
147 std::map<KEY, Set>
sets()
const {
148 std::map<KEY, Set>
sets;
156 std::map<KEY, Set> partitions;
166 if (pair.second == label ||
findSet(pair.second) == label)
167 set.insert(pair.first);
184 std::cout <<
name << std::endl;
186 std::cout << (std::string) pair.first <<
" " << (std::string) pair.second
202 *
this = this->
add(key, label);
const Symbol key1('v', 1)
Set set(const KEY &label) const
void makeSetInPlace(const KEY &key)
Annotation for function names.
DSF(const std::set< KEY > &keys)
Self makeUnion(const KEY &key1, const KEY &key2) const
DSF map(std::function< KEY(const KEY &)> func) const
int EIGEN_BLAS_FUNC() copy(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy)
Self makePair(const KEY &key1, const KEY &key2) const
std::pair< KEY, KEY > KeyLabel
Self makeList(const std::list< KEY > &keys) const
KEY findSet(const KEY &key) const
void makeUnionInPlace(const KEY &key1, const KEY &key2)
BTree add(const value_type &xd) const
const KEY & find(const KEY &k) const
Self makeSet(const KEY &key) const
purely functional binary tree
const Symbol key2('v', 2)
KEY findSet_(const KEY &key)
bool operator==(const Self &t) const
void print(const std::string &name="DSF") const
std::map< KEY, Set > sets() const
DSF(const std::list< KEY > &keys)
std::map< KEY, Set > partition(const std::list< KEY > &keys) const
bool mem(const KEY &x) const
bool operator!=(const Self &t) const
gtsam
Author(s):
autogenerated on Sat Nov 16 2024 04:02:14