|
LLVM
4.0.0
|
FoldingSetVector - This template class combines a FoldingSet and a vector to provide the interface of FoldingSet but with deterministic iteration order based on the insertion order. More...
#include <FoldingSet.h>
Public Types | |
| typedef pointee_iterator < typename VectorT::iterator > | iterator |
| typedef pointee_iterator < typename VectorT::const_iterator > | const_iterator |
Public Member Functions | |
| FoldingSetVector (unsigned Log2InitSize=6) | |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| void | clear () |
| clear - Remove all nodes from the folding set. More... | |
| T * | FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos) |
| FindNodeOrInsertPos - Look up the node specified by ID. More... | |
| T * | GetOrInsertNode (T *N) |
| GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. More... | |
| void | InsertNode (T *N, void *InsertPos) |
| InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. More... | |
| void | InsertNode (T *N) |
| InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. More... | |
| unsigned | size () const |
| size - Returns the number of nodes in the folding set. More... | |
| bool | empty () const |
| empty - Returns true if there are no nodes in the folding set. More... | |
FoldingSetVector - This template class combines a FoldingSet and a vector to provide the interface of FoldingSet but with deterministic iteration order based on the insertion order.
T must be a subclass of FoldingSetNode and implement a Profile function.
Definition at line 572 of file FoldingSet.h.
| typedef pointee_iterator<typename VectorT::const_iterator> llvm::FoldingSetVector< T, VectorT >::const_iterator |
Definition at line 585 of file FoldingSet.h.
| typedef pointee_iterator<typename VectorT::iterator> llvm::FoldingSetVector< T, VectorT >::iterator |
Definition at line 581 of file FoldingSet.h.
|
inlineexplicit |
Definition at line 577 of file FoldingSet.h.
|
inline |
Definition at line 582 of file FoldingSet.h.
|
inline |
Definition at line 586 of file FoldingSet.h.
|
inline |
clear - Remove all nodes from the folding set.
Definition at line 590 of file FoldingSet.h.
|
inline |
empty - Returns true if there are no nodes in the folding set.
Definition at line 627 of file FoldingSet.h.
|
inline |
Definition at line 583 of file FoldingSet.h.
|
inline |
Definition at line 587 of file FoldingSet.h.
|
inline |
FindNodeOrInsertPos - Look up the node specified by ID.
If it exists, return it. If not, return the insertion token that will make insertion faster.
Definition at line 595 of file FoldingSet.h.
|
inline |
GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it.
Otherwise, insert 'N' and return it instead.
Definition at line 602 of file FoldingSet.h.
|
inline |
InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
InsertPos must be obtained from FindNodeOrInsertPos.
Definition at line 611 of file FoldingSet.h.
|
inline |
InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
Definition at line 618 of file FoldingSet.h.
|
inline |
size - Returns the number of nodes in the folding set.
Definition at line 624 of file FoldingSet.h.
1.8.6