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

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 ()
	Remove all nodes from the folding set.
T *	lookup (const FoldingSetNodeID &ID, FoldingSetInsertToken &Token)
	Look up the node specified by ID.
T *	getOrInsert (T *N)
	If there is an existing node exactly equal to the specified node, return it.
void	insert (T *N, FoldingSetInsertToken Token)
	Insert the specified node into the folding set, knowing that it is not already in the folding set.
void	insert (T *N)
	Insert the specified node into the folding set, knowing that it is not already in the folding set.
unsigned	size () const
	Returns the number of nodes in the folding set.
bool	empty () const
	Returns true if there are no nodes in the folding set.

Detailed Description

template<class T, class VectorT = SmallVector<T *, 8>>
class llvm::FoldingSetVector< T, VectorT >

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

Member Typedef Documentation

const_iterator

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

using llvm::FoldingSetVector< T, VectorT >::const_iterator = pointee_iterator<typename VectorT::const_iterator>

Definition at line 589 of file FoldingSet.h.

iterator

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

using llvm::FoldingSetVector< T, VectorT >::iterator = pointee_iterator<typename VectorT::iterator>

Definition at line 584 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 582 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 586 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 591 of file FoldingSet.h.

clear()

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

void llvm::FoldingSetVector< T, VectorT >::clear ( )

inline

Remove all nodes from the folding set.

Definition at line 595 of file FoldingSet.h.

empty()

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

bool llvm::FoldingSetVector< T, VectorT >::empty ( ) const

inlinenodiscard

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

Definition at line 634 of file FoldingSet.h.

end() [1/2]

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

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

inline

Definition at line 587 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 592 of file FoldingSet.h.

getOrInsert()

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

T * llvm::FoldingSetVector< T, VectorT >::getOrInsert ( T * N )

inline

If there is an existing node exactly equal to the specified node, return it.

Otherwise, insert 'N' and return it instead.

Definition at line 608 of file FoldingSet.h.

References N, and T.

insert() [1/2]

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

void llvm::FoldingSetVector< T, VectorT >::insert ( T * N )

inline

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

Definition at line 625 of file FoldingSet.h.

References N, and T.

insert() [2/2]

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

void llvm::FoldingSetVector< T, VectorT >::insert ( T * N, FoldingSetInsertToken Token )

inline

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

Token must come from lookup for an ID that N profiles identically to.

Definition at line 618 of file FoldingSet.h.

References N, and T.

lookup()

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

T * llvm::FoldingSetVector< T, VectorT >::lookup ( const FoldingSetNodeID & ID, FoldingSetInsertToken & Token )

inline

Look up the node specified by ID.

If it exists, return it and clear Token; otherwise return null and set Token for a subsequent insert.

Definition at line 602 of file FoldingSet.h.

References T.

size()

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

unsigned llvm::FoldingSetVector< T, VectorT >::size ( ) const

inline

Returns the number of nodes in the folding set.

Definition at line 631 of file FoldingSet.h.

---

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

• include/llvm/ADT/FoldingSet.h