llvm::FoldingSetVector< T, VectorT > Class Template Reference

#include <FoldingSet.h>

Public Types
typedef FoldingSetVectorIterator< T, typename VectorT::iterator >	iterator
typedef FoldingSetVectorIterator < const T, 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)
T *	GetOrInsertNode (T *N)
void	InsertNode (T *N, void *InsertPos)
void	InsertNode (T *N)
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 576 of file FoldingSet.h.

Member Typedef Documentation

template<class T , class VectorT = SmallVector<T*, 8>>

typedef FoldingSetVectorIterator<const T, typename VectorT::const_iterator> llvm::FoldingSetVector< T, VectorT >::const_iterator

Definition at line 590 of file FoldingSet.h.

template<class T , class VectorT = SmallVector<T*, 8>>

typedef FoldingSetVectorIterator<T, typename VectorT::iterator> llvm::FoldingSetVector< T, VectorT >::iterator

Definition at line 585 of file FoldingSet.h.

Constructor & Destructor Documentation

template<class T , class VectorT = SmallVector<T*, 8>>

llvm::FoldingSetVector< T, VectorT >::FoldingSetVector ( unsigned  Log2InitSize = 6 )

inlineexplicit

Definition at line 581 of file FoldingSet.h.

Member Function Documentation

template<class T , class VectorT = SmallVector<T*, 8>>

iterator llvm::FoldingSetVector< T, VectorT >::begin ( )

inline

Definition at line 586 of file FoldingSet.h.

template<class T , class VectorT = SmallVector<T*, 8>>

const_iterator llvm::FoldingSetVector< T, VectorT >::begin ( ) const

inline

Definition at line 591 of file FoldingSet.h.

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

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

template<class T , class VectorT = SmallVector<T*, 8>>

iterator llvm::FoldingSetVector< T, VectorT >::end ( )

inline

Definition at line 587 of file FoldingSet.h.

template<class T , class VectorT = SmallVector<T*, 8>>

const_iterator llvm::FoldingSetVector< T, VectorT >::end ( ) const

inline

Definition at line 592 of file FoldingSet.h.

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

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

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

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

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

---

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

• FoldingSet.h