LLVM  6.0.0svn
Public Member Functions | List of all members
llvm::FoldingSet< T > Class Template Referencefinal

FoldingSet - This template class is used to instantiate a specialized implementation of the folding set to the node class T. More...

#include "llvm/ADT/FoldingSet.h"

Inheritance diagram for llvm::FoldingSet< T >:
Inheritance graph
[legend]
Collaboration diagram for llvm::FoldingSet< T >:
Collaboration graph
[legend]

Public Member Functions

 FoldingSet (unsigned Log2InitSize=6)
 
 FoldingSet (FoldingSet &&Arg)=default
 
FoldingSetoperator= (FoldingSet &&RHS)=default
 
- Public Member Functions inherited from llvm::FoldingSetImpl< T >
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
bucket_iterator bucket_begin (unsigned hash)
 
bucket_iterator bucket_end (unsigned hash)
 
bool RemoveNode (T *N)
 RemoveNode - Remove a node from the folding set, returning true if one was removed or false if the node was not in the folding set. More...
 
TGetOrInsertNode (T *N)
 GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. More...
 
TFindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos)
 FindNodeOrInsertPos - Look up the node specified by ID. 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...
 
- Public Member Functions inherited from llvm::FoldingSetBase
void clear ()
 clear - Remove all nodes from 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...
 
void reserve (unsigned EltCount)
 reserve - Increase the number of buckets such that adding the EltCount-th node won't cause a rebucket operation. More...
 
unsigned capacity ()
 capacity - Returns the number of nodes permitted in the folding set before a rebucket operation is performed. More...
 

Additional Inherited Members

- Public Types inherited from llvm::FoldingSetImpl< T >
using iterator = FoldingSetIterator< T >
 
using const_iterator = FoldingSetIterator< const T >
 
using bucket_iterator = FoldingSetBucketIterator< T >
 
- Protected Member Functions inherited from llvm::FoldingSetImpl< T >
 FoldingSetImpl (unsigned Log2InitSize)
 
 FoldingSetImpl (FoldingSetImpl &&Arg)=default
 
FoldingSetImploperator= (FoldingSetImpl &&RHS)=default
 
 ~FoldingSetImpl ()=default
 
- Protected Member Functions inherited from llvm::FoldingSetBase
 FoldingSetBase (unsigned Log2InitSize=6)
 
 FoldingSetBase (FoldingSetBase &&Arg)
 
FoldingSetBaseoperator= (FoldingSetBase &&RHS)
 
 ~FoldingSetBase ()
 
virtual void GetNodeProfile (Node *N, FoldingSetNodeID &ID) const =0
 GetNodeProfile - Instantiations of the FoldingSet template implement this function to gather data bits for the given node. More...
 
virtual bool NodeEquals (Node *N, const FoldingSetNodeID &ID, unsigned IDHash, FoldingSetNodeID &TempID) const =0
 NodeEquals - Instantiations of the FoldingSet template implement this function to compare the given node with the given ID. More...
 
virtual unsigned ComputeNodeHash (Node *N, FoldingSetNodeID &TempID) const =0
 ComputeNodeHash - Instantiations of the FoldingSet template implement this function to compute a hash value for the given node. More...
 
bool RemoveNode (Node *N)
 RemoveNode - Remove a node from the folding set, returning true if one was removed or false if the node was not in the folding set. More...
 
NodeGetOrInsertNode (Node *N)
 GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. More...
 
NodeFindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos)
 FindNodeOrInsertPos - Look up the node specified by ID. More...
 
void InsertNode (Node *N, void *InsertPos)
 InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. More...
 
- Protected Attributes inherited from llvm::FoldingSetBase
void ** Buckets
 Buckets - Array of bucket chains. More...
 
unsigned NumBuckets
 NumBuckets - Length of the Buckets array. Always a power of 2. More...
 
unsigned NumNodes
 NumNodes - Number of nodes in the folding set. More...
 

Detailed Description

template<class T>
class llvm::FoldingSet< T >

FoldingSet - This template class is used to instantiate a specialized implementation of the folding set to the node class T.

T must be a subclass of FoldingSetNode and implement a Profile function.

Note that this set type is movable and move-assignable. However, its moved-from state is not a valid state for anything other than move-assigning and destroying. This is primarily to enable movable APIs that incorporate these objects.

Definition at line 474 of file FoldingSet.h.

Constructor & Destructor Documentation

◆ FoldingSet() [1/2]

template<class T>
llvm::FoldingSet< T >::FoldingSet ( unsigned  Log2InitSize = 6)
inlineexplicit

Definition at line 501 of file FoldingSet.h.

◆ FoldingSet() [2/2]

template<class T>
llvm::FoldingSet< T >::FoldingSet ( FoldingSet< T > &&  Arg)
default

Member Function Documentation

◆ operator=()

template<class T>
FoldingSet& llvm::FoldingSet< T >::operator= ( FoldingSet< T > &&  RHS)
default

The documentation for this class was generated from the following file: