LLVM 17.0.0git
|
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"
Public Types | |
using | iterator = pointee_iterator< typename VectorT::iterator > |
using | const_iterator = pointee_iterator< typename VectorT::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. | |
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. | |
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 631 of file FoldingSet.h.
using llvm::FoldingSetVector< T, VectorT >::const_iterator = pointee_iterator<typename VectorT::const_iterator> |
Definition at line 643 of file FoldingSet.h.
using llvm::FoldingSetVector< T, VectorT >::iterator = pointee_iterator<typename VectorT::iterator> |
Definition at line 638 of file FoldingSet.h.
|
inlineexplicit |
Definition at line 636 of file FoldingSet.h.
|
inline |
Definition at line 640 of file FoldingSet.h.
References llvm::Vector.
|
inline |
Definition at line 645 of file FoldingSet.h.
References llvm::Vector.
|
inline |
clear - Remove all nodes from the folding set.
Definition at line 649 of file FoldingSet.h.
References llvm::FoldingSetBase::clear(), and llvm::Vector.
|
inline |
empty - Returns true if there are no nodes in the folding set.
Definition at line 686 of file FoldingSet.h.
References llvm::FoldingSetBase::empty().
|
inline |
Definition at line 641 of file FoldingSet.h.
References llvm::Vector.
|
inline |
Definition at line 646 of file FoldingSet.h.
References llvm::Vector.
|
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 654 of file FoldingSet.h.
References llvm::FoldingSetImpl< Derived, T >::FindNodeOrInsertPos().
|
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 661 of file FoldingSet.h.
References llvm::FoldingSetImpl< Derived, T >::GetOrInsertNode(), N, and llvm::Vector.
|
inline |
InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
Definition at line 677 of file FoldingSet.h.
References llvm::FoldingSetImpl< Derived, T >::InsertNode(), N, and llvm::Vector.
|
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 670 of file FoldingSet.h.
References llvm::FoldingSetImpl< Derived, T >::InsertNode(), N, and llvm::Vector.
|
inline |
size - Returns the number of nodes in the folding set.
Definition at line 683 of file FoldingSet.h.
References llvm::FoldingSetBase::size().