LLVM  6.0.0svn
Public Types | Public Member Functions | List of all members
llvm::FoldingSetVector< T, VectorT > Class Template Reference

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

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...
 
TFindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos)
 FindNodeOrInsertPos - Look up the node specified by ID. More...
 
TGetOrInsertNode (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...
 

Detailed Description

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 567 of file FoldingSet.h.

Member Typedef Documentation

◆ const_iterator

template<class T , class VectorT = SmallVector<T*, 8>>
typedef pointee_iterator<typename VectorT::const_iterator> llvm::FoldingSetVector< T, VectorT >::const_iterator

Definition at line 580 of file FoldingSet.h.

◆ iterator

template<class T , class VectorT = SmallVector<T*, 8>>
typedef pointee_iterator<typename VectorT::iterator> llvm::FoldingSetVector< T, VectorT >::iterator

Definition at line 576 of file FoldingSet.h.

Constructor & Destructor Documentation

◆ FoldingSetVector()

template<class T , class VectorT = SmallVector<T*, 8>>
llvm::FoldingSetVector< T, VectorT >::FoldingSetVector ( unsigned  Log2InitSize = 6)
inlineexplicit

Definition at line 572 of file FoldingSet.h.

Member Function Documentation

◆ begin() [1/2]

template<class T , class VectorT = SmallVector<T*, 8>>
iterator llvm::FoldingSetVector< T, VectorT >::begin ( )
inline

Definition at line 577 of file FoldingSet.h.

◆ begin() [2/2]

template<class T , class VectorT = SmallVector<T*, 8>>
const_iterator llvm::FoldingSetVector< T, VectorT >::begin ( ) const
inline

Definition at line 581 of file FoldingSet.h.

◆ clear()

template<class T , class VectorT = SmallVector<T*, 8>>
void llvm::FoldingSetVector< T, VectorT >::clear ( )
inline

clear - Remove all nodes from the folding set.

Definition at line 585 of file FoldingSet.h.

References llvm::FoldingSetBase::clear().

◆ empty()

template<class T , class VectorT = SmallVector<T*, 8>>
bool llvm::FoldingSetVector< T, VectorT >::empty ( ) const
inline

empty - Returns true if there are no nodes in the folding set.

Definition at line 622 of file FoldingSet.h.

References llvm::FoldingSetBase::empty().

◆ end() [1/2]

template<class T , class VectorT = SmallVector<T*, 8>>
iterator llvm::FoldingSetVector< T, VectorT >::end ( )
inline

Definition at line 578 of file FoldingSet.h.

◆ end() [2/2]

template<class T , class VectorT = SmallVector<T*, 8>>
const_iterator llvm::FoldingSetVector< T, VectorT >::end ( ) const
inline

Definition at line 582 of file FoldingSet.h.

◆ FindNodeOrInsertPos()

template<class T , class VectorT = SmallVector<T*, 8>>
T* llvm::FoldingSetVector< T, VectorT >::FindNodeOrInsertPos ( const FoldingSetNodeID ID,
void *&  InsertPos 
)
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 590 of file FoldingSet.h.

References llvm::FoldingSetImpl< T >::FindNodeOrInsertPos().

◆ GetOrInsertNode()

template<class T , class VectorT = SmallVector<T*, 8>>
T* llvm::FoldingSetVector< T, VectorT >::GetOrInsertNode ( T N)
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 597 of file FoldingSet.h.

References llvm::FoldingSetImpl< T >::GetOrInsertNode().

◆ InsertNode() [1/2]

template<class T , class VectorT = SmallVector<T*, 8>>
void llvm::FoldingSetVector< T, VectorT >::InsertNode ( T N,
void *  InsertPos 
)
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 606 of file FoldingSet.h.

References llvm::FoldingSetImpl< T >::InsertNode().

◆ InsertNode() [2/2]

template<class T , class VectorT = SmallVector<T*, 8>>
void llvm::FoldingSetVector< T, VectorT >::InsertNode ( T N)
inline

InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.

Definition at line 613 of file FoldingSet.h.

References llvm::FoldingSetImpl< T >::InsertNode().

◆ size()

template<class T , class VectorT = SmallVector<T*, 8>>
unsigned llvm::FoldingSetVector< T, VectorT >::size ( ) const
inline

size - Returns the number of nodes in the folding set.

Definition at line 619 of file FoldingSet.h.

References llvm::FoldingSetBase::size().


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