llvm::SmallPtrSet< PtrType, SmallSize > Class Template Reference
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements.
More...
#include <SmallPtrSet.h>
List of all members.
Detailed Description
template<class PtrType, unsigned SmallSize>
class llvm::SmallPtrSet< PtrType, SmallSize >
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements.
This internally rounds up SmallSize to the next power of two if it is not already a power of two. See the comments above SmallPtrSetImpl for details of the algorithm.
Member Typedef Documentation
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
Member Enumeration Documentation
template<class PtrType, unsigned SmallSize>
Constructor & Destructor Documentation
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
template<typename It >
Member Function Documentation
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
count - Return true if the specified pointer is in the set.
template<class PtrType, unsigned SmallSize>
template<class PtrType, unsigned SmallSize>
erase - If the set contains the specified pointer, remove it and return true, otherwise return false.
template<class PtrType, unsigned SmallSize>
template<typename IterT >
template<class PtrType, unsigned SmallSize>
insert - This returns true if the pointer was new to the set, false if it was already in the set.
template<class PtrType, unsigned SmallSize>
Member Data Documentation
template<class PtrType, unsigned SmallSize>
SmallStorage - Fixed size storage used in 'small mode'.
The extra element ensures that the end iterator actually points to valid memory.
The documentation for this class was generated from the following file: