Intrusive union-find implementation. More...
#include <UnionFind.h>
Public Types | |
| typedef UnionFindNode< T > | SuperTy |
Public Member Functions | |
| bool | isRep () const |
| const T * | find () const |
| T * | find () |
| T * | findAndCompress () |
| T * | merge (T *b) |
| Lock-free merge. Returns if merge was done. | |
Protected Member Functions | |
| UnionFindNode () | |
Protected Attributes | |
| T * | m_component |
Private Member Functions | |
| T * | findImpl () const |
Intrusive union-find implementation.
Users subclass this to get disjoint functionality for the subclass object.
| typedef UnionFindNode<T> Galois::UnionFindNode< T >::SuperTy |
| Galois::UnionFindNode< T >::UnionFindNode | ( | ) | [inline, protected] |
| T* Galois::UnionFindNode< T >::find | ( | ) | [inline] |
| const T* Galois::UnionFindNode< T >::find | ( | ) | const [inline] |
| T* Galois::UnionFindNode< T >::findAndCompress | ( | ) | [inline] |
| T* Galois::UnionFindNode< T >::findImpl | ( | ) | const [inline, private] |
| bool Galois::UnionFindNode< T >::isRep | ( | ) | const [inline] |
| T* Galois::UnionFindNode< T >::merge | ( | T * | b | ) | [inline] |
Lock-free merge. Returns if merge was done.
T* Galois::UnionFindNode< T >::m_component [protected] |
1.6.1