|
LLVM
4.0.0
|
EquivalenceClasses - This represents a collection of equivalence classes and supports three efficient operations: insert an element into a class of its own, union two classes, and find the class for a given element. More...
#include <EquivalenceClasses.h>
Classes | |
| class | member_iterator |
Public Types | |
| typedef std::set< ECValue > ::const_iterator | iterator |
| iterator* - Provides a way to iterate over all values in the set. More... | |
Public Member Functions | |
| EquivalenceClasses ()=default | |
| EquivalenceClasses (const EquivalenceClasses &RHS) | |
| const EquivalenceClasses & | operator= (const EquivalenceClasses &RHS) |
| iterator | begin () const |
| iterator | end () const |
| bool | empty () const |
| member_iterator | member_begin (iterator I) const |
| member_iterator | member_end () const |
| iterator | findValue (const ElemTy &V) const |
| findValue - Return an iterator to the specified value. More... | |
| const ElemTy & | getLeaderValue (const ElemTy &V) const |
| getLeaderValue - Return the leader for the specified value that is in the set. More... | |
| const ElemTy & | getOrInsertLeaderValue (const ElemTy &V) |
| getOrInsertLeaderValue - Return the leader for the specified value that is in the set. More... | |
| unsigned | getNumClasses () const |
| getNumClasses - Return the number of equivalence classes in this set. More... | |
| iterator | insert (const ElemTy &Data) |
| insert - Insert a new value into the union/find set, ignoring the request if the value already exists. More... | |
| member_iterator | findLeader (iterator I) const |
| findLeader - Given a value in the set, return a member iterator for the equivalence class it is in. More... | |
| member_iterator | findLeader (const ElemTy &V) const |
| member_iterator | unionSets (const ElemTy &V1, const ElemTy &V2) |
| union - Merge the two equivalence sets for the specified values, inserting them if they do not already exist in the equivalence set. More... | |
| member_iterator | unionSets (member_iterator L1, member_iterator L2) |
EquivalenceClasses - This represents a collection of equivalence classes and supports three efficient operations: insert an element into a class of its own, union two classes, and find the class for a given element.
In addition to these modification methods, it is possible to iterate over all of the equivalence classes and all of the elements in a class.
This implementation is an efficient implementation that only stores one copy of the element being indexed per entry in the set, and allows any arbitrary type to be indexed (as long as it can be ordered with operator<).
Here is a simple example using integers:
This example prints: 4 5 1 2
Definition at line 59 of file EquivalenceClasses.h.
| typedef std::set<ECValue>::const_iterator llvm::EquivalenceClasses< ElemTy >::iterator |
iterator* - Provides a way to iterate over all values in the set.
Definition at line 144 of file EquivalenceClasses.h.
|
default |
|
inline |
Definition at line 123 of file EquivalenceClasses.h.
|
inline |
Definition at line 145 of file EquivalenceClasses.h.
Referenced by llvm::computeMinimumValueSizes(), llvm::EquivalenceClasses< llvm::Instruction * >::getNumClasses(), and llvm::EquivalenceClasses< llvm::Instruction * >::operator=().
|
inline |
Definition at line 148 of file EquivalenceClasses.h.
|
inline |
Definition at line 146 of file EquivalenceClasses.h.
Referenced by llvm::computeMinimumValueSizes(), llvm::EquivalenceClasses< llvm::Instruction * >::getNumClasses(), and llvm::EquivalenceClasses< llvm::Instruction * >::operator=().
|
inline |
findLeader - Given a value in the set, return a member iterator for the equivalence class it is in.
This does the path-compression part that makes union-find "union findy". This returns an end iterator if the value is not in the equivalence class.
Definition at line 208 of file EquivalenceClasses.h.
Referenced by llvm::EquivalenceClasses< llvm::Instruction * >::findLeader(), llvm::EquivalenceClasses< llvm::Instruction * >::getLeaderValue(), llvm::EquivalenceClasses< llvm::Instruction * >::getOrInsertLeaderValue(), and llvm::EquivalenceClasses< llvm::Instruction * >::unionSets().
|
inline |
Definition at line 212 of file EquivalenceClasses.h.
|
inline |
findValue - Return an iterator to the specified value.
If it does not exist, end() is returned.
Definition at line 163 of file EquivalenceClasses.h.
Referenced by llvm::MemoryDepChecker::areDepsSafe().
|
inline |
getLeaderValue - Return the leader for the specified value that is in the set.
It is an error to call this method for a value that is not yet in the set. For that, call getOrInsertLeaderValue(V).
Definition at line 170 of file EquivalenceClasses.h.
Referenced by llvm::MemoryDepChecker::areDepsSafe().
|
inline |
getNumClasses - Return the number of equivalence classes in this set.
Note that this is a linear time operation.
Definition at line 187 of file EquivalenceClasses.h.
|
inline |
getOrInsertLeaderValue - Return the leader for the specified value that is in the set.
If the member is not in the set, it is inserted, then returned.
Definition at line 179 of file EquivalenceClasses.h.
Referenced by llvm::computeMinimumValueSizes().
|
inline |
insert - Insert a new value into the union/find set, ignoring the request if the value already exists.
Definition at line 199 of file EquivalenceClasses.h.
Referenced by llvm::EquivalenceClasses< llvm::Instruction * >::getOrInsertLeaderValue(), llvm::MaximumSpanningTree< T >::MaximumSpanningTree(), llvm::EquivalenceClasses< llvm::Instruction * >::operator=(), and llvm::EquivalenceClasses< llvm::Instruction * >::unionSets().
|
inline |
Definition at line 153 of file EquivalenceClasses.h.
Referenced by llvm::MemoryDepChecker::areDepsSafe(), llvm::computeMinimumValueSizes(), and llvm::EquivalenceClasses< llvm::Instruction * >::operator=().
|
inline |
Definition at line 157 of file EquivalenceClasses.h.
Referenced by llvm::MemoryDepChecker::areDepsSafe(), llvm::computeMinimumValueSizes(), llvm::EquivalenceClasses< llvm::Instruction * >::findLeader(), llvm::EquivalenceClasses< llvm::Instruction * >::getLeaderValue(), llvm::EquivalenceClasses< llvm::Instruction * >::getOrInsertLeaderValue(), llvm::EquivalenceClasses< llvm::Instruction * >::operator=(), and llvm::EquivalenceClasses< llvm::Instruction * >::unionSets().
|
inline |
Definition at line 127 of file EquivalenceClasses.h.
Referenced by llvm::EquivalenceClasses< llvm::Instruction * >::EquivalenceClasses().
|
inline |
union - Merge the two equivalence sets for the specified values, inserting them if they do not already exist in the equivalence set.
Definition at line 218 of file EquivalenceClasses.h.
Referenced by llvm::computeMinimumValueSizes(), llvm::EquivalenceClasses< llvm::Instruction * >::operator=(), and llvm::EquivalenceClasses< llvm::Instruction * >::unionSets().
|
inline |
Definition at line 222 of file EquivalenceClasses.h.
1.8.6