Go to the documentation of this file.
10 #ifndef CPROVER_UTIL_UNION_FIND_H
11 #define CPROVER_UTIL_UNION_FIND_H
42 mutable std::vector<nodet>
nodes;
69 INVARIANT(
false,
"we don't implement shrinking yet");
88 return nodes[a].parent==a;
135 template <
typename T>
287 #endif // CPROVER_UTIL_UNION_FIND_H
typename data_typet::size_type size_type
const T & find(const T &a)
size_type find(size_type a) const
size_type get_other(size_type a)
void isolate(typename numbering< T >::const_iterator it)
T & operator[](size_type t)
bool is_root(typename numbering< T >::const_iterator it) const
const_iterator end() const
bool same_set(typename numbering< T >::const_iterator it_a, typename numbering< T >::const_iterator it_b) const
void check_index(size_type a)
void resize(size_type size)
size_type find_number(typename numbering< T >::const_iterator it) const
bool is_root_number(size_type a) const
const_iterator cbegin() const
const T & operator[](size_type t) const
const_iterator begin() const
void intersection(const unsigned_union_find &other)
typename data_typet::iterator iterator
optionalt< number_type > get_number(const key_type &a) const
const T & find(typename numbering< T >::const_iterator it) const
number_type number(const key_type &a)
size_type number(const T &a)
void swap(unsigned_union_find &other)
size_type count(size_type a) const
void make_union(size_type a, size_type b)
numbering< T > numbering_typet
bool same_set(const T &a, const T &b) const
bool make_union(typename numbering< T >::const_iterator it_a, typename numbering< T >::const_iterator it_b)
size_type find_number(size_type a) const
nonstd::optional< T > optionalt
bool same_set(size_type a, size_type b) const
bool is_root(const T &a) const
numbering_typet::iterator iterator
typename Map::mapped_type number_type
const_iterator cbegin() const
numbering_typet::const_iterator const_iterator
bool make_union(const T &a, const T &b)
optionalt< number_type > get_number(const T &a) const
const_iterator cend() const
size_type count_roots() const
std::vector< nodet > nodes
bool is_root(size_type a) const
size_type find_number(const T &a)
numbering_typet::number_type number_type
void isolate(size_type a)
const_iterator cend() const
typename data_typet::const_iterator const_iterator
numbering_typet::size_type size_type
void re_root(size_type old, size_type new_root)