LLVM: llvm::FoldingSetVector< T, VectorT > Class Template Reference (original) (raw)
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 "[llvm/ADT/FoldingSet.h](FoldingSet%5F8h%5Fsource.html)"
| 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. | |
| T * | FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos) |
| FindNodeOrInsertPos - Look up the node specified by ID. | |
| T * | GetOrInsertNode (T *N) |
| GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. | |
| 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. | |
| void | InsertNode (T *N) |
| InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. | |
| unsigned | size () const |
| size - Returns the number of nodes in the folding set. | |
| bool | empty () const |
| empty - Returns true if there are no nodes in the folding set. | |
template<class T, class VectorT = SmallVector<T*, 8>>
class llvm::FoldingSetVector< T, VectorT >
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 647 of file FoldingSet.h.
◆ const_iterator
template<class T , class VectorT = SmallVector<T*, 8>>
◆ iterator
template<class T , class VectorT = SmallVector<T*, 8>>
template<class T , class VectorT = SmallVector<T*, 8>>
◆ begin() [1/2]
template<class T , class VectorT = SmallVector<T*, 8>>
◆ begin() [2/2]
template<class T , class VectorT = SmallVector<T*, 8>>
◆ clear()
template<class T , class VectorT = SmallVector<T*, 8>>
◆ empty()
template<class T , class VectorT = SmallVector<T*, 8>>
empty - Returns true if there are no nodes in the folding set.
Definition at line 702 of file FoldingSet.h.
◆ end() [1/2]
template<class T , class VectorT = SmallVector<T*, 8>>
◆ end() [2/2]
template<class T , class VectorT = SmallVector<T*, 8>>
◆ FindNodeOrInsertPos()
template<class T , class VectorT = SmallVector<T*, 8>>
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 670 of file FoldingSet.h.
◆ GetOrInsertNode()
template<class T , class VectorT = SmallVector<T*, 8>>
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 677 of file FoldingSet.h.
References N, and llvm::Vector.
◆ InsertNode() [1/2]
template<class T , class VectorT = SmallVector<T*, 8>>
InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
Definition at line 693 of file FoldingSet.h.
References N, and llvm::Vector.
◆ InsertNode() [2/2]
template<class T , class VectorT = SmallVector<T*, 8>>
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 686 of file FoldingSet.h.
References N, and llvm::Vector.
◆ size()
template<class T , class VectorT = SmallVector<T*, 8>>
size - Returns the number of nodes in the folding set.
Definition at line 699 of file FoldingSet.h.
The documentation for this class was generated from the following file:
- include/llvm/ADT/FoldingSet.h