LLVM  6.0.0svn
Public Types | Public Member Functions | List of all members
llvm::df_iterator_default_set< NodeRef, SmallSize > Struct Template Reference

#include "llvm/ADT/DepthFirstIterator.h"

Inheritance diagram for llvm::df_iterator_default_set< NodeRef, SmallSize >:
Inheritance graph
[legend]
Collaboration diagram for llvm::df_iterator_default_set< NodeRef, SmallSize >:
Collaboration graph
[legend]

Public Types

using BaseSet = SmallPtrSet< NodeRef, SmallSize >
 
using iterator = typename BaseSet::iterator
 
- Public Types inherited from llvm::SmallPtrSetImpl< NodeRef >
using iterator = SmallPtrSetIterator< NodeRef >
 
using const_iterator = SmallPtrSetIterator< NodeRef >
 
using key_type = ConstPtrType
 
using value_type = NodeRef
 
- Public Types inherited from llvm::SmallPtrSetImplBase
using size_type = unsigned
 

Public Member Functions

std::pair< iterator, boolinsert (NodeRef N)
 
template<typename IterT >
void insert (IterT Begin, IterT End)
 
void completed (NodeRef)
 
- Public Member Functions inherited from llvm::SmallPtrSet< NodeRef, SmallSize >
 SmallPtrSet ()
 
 SmallPtrSet (const SmallPtrSet &that)
 
 SmallPtrSet (SmallPtrSet &&that)
 
 SmallPtrSet (It I, It E)
 
 SmallPtrSet (std::initializer_list< NodeRef > IL)
 
SmallPtrSet< NodeRef, SmallSize > & operator= (const SmallPtrSet< NodeRef, SmallSize > &RHS)
 
SmallPtrSet< NodeRef, SmallSize > & operator= (SmallPtrSet< NodeRef, SmallSize > &&RHS)
 
SmallPtrSet< NodeRef, SmallSize > & operator= (std::initializer_list< NodeRef > IL)
 
void swap (SmallPtrSet< NodeRef, SmallSize > &RHS)
 swap - Swaps the elements of two sets. More...
 
- Public Member Functions inherited from llvm::SmallPtrSetImpl< NodeRef >
 SmallPtrSetImpl (const SmallPtrSetImpl &)=delete
 
std::pair< iterator, boolinsert (NodeRef Ptr)
 Inserts Ptr if and only if there is no element in the container equal to Ptr. More...
 
void insert (IterT I, IterT E)
 
void insert (std::initializer_list< NodeRef > IL)
 
bool erase (NodeRef Ptr)
 erase - If the set contains the specified pointer, remove it and return true, otherwise return false. More...
 
size_type count (ConstPtrType Ptr) const
 count - Return 1 if the specified pointer is in the set, 0 otherwise. More...
 
iterator find (ConstPtrType Ptr) const
 
iterator begin () const
 
iterator end () const
 
- Public Member Functions inherited from llvm::SmallPtrSetImplBase
SmallPtrSetImplBaseoperator= (const SmallPtrSetImplBase &)=delete
 
LLVM_NODISCARD bool empty () const
 
size_type size () const
 
void clear ()
 
- Public Member Functions inherited from llvm::DebugEpochBase
 DebugEpochBase ()
 
void incrementEpoch ()
 Calling incrementEpoch invalidates all handles pointing into the calling instance. More...
 
 ~DebugEpochBase ()
 The destructor calls incrementEpoch to make use-after-free bugs more likely to crash deterministically. More...
 

Additional Inherited Members

- Protected Member Functions inherited from llvm::SmallPtrSetImpl< NodeRef >
 SmallPtrSetImpl (const void **SmallStorage, const SmallPtrSetImpl &that)
 
 SmallPtrSetImpl (const void **SmallStorage, unsigned SmallSize, SmallPtrSetImpl &&that)
 
 SmallPtrSetImpl (const void **SmallStorage, unsigned SmallSize)
 
- Protected Member Functions inherited from llvm::SmallPtrSetImplBase
 SmallPtrSetImplBase (const void **SmallStorage, const SmallPtrSetImplBase &that)
 
 SmallPtrSetImplBase (const void **SmallStorage, unsigned SmallSize, SmallPtrSetImplBase &&that)
 
 SmallPtrSetImplBase (const void **SmallStorage, unsigned SmallSize)
 
 ~SmallPtrSetImplBase ()
 
const void ** EndPointer () const
 
std::pair< const void *const *, boolinsert_imp (const void *Ptr)
 insert_imp - This returns true if the pointer was new to the set, false if it was already in the set. More...
 
bool erase_imp (const void *Ptr)
 erase_imp - If the set contains the specified pointer, remove it and return true, otherwise return false. More...
 
const void *constfind_imp (const void *Ptr) const
 Returns the raw pointer needed to construct an iterator. More...
 
void swap (SmallPtrSetImplBase &RHS)
 swap - Swaps the elements of two sets. More...
 
void CopyFrom (const SmallPtrSetImplBase &RHS)
 
void MoveFrom (unsigned SmallSize, SmallPtrSetImplBase &&RHS)
 
- Static Protected Member Functions inherited from llvm::SmallPtrSetImplBase
static void * getTombstoneMarker ()
 
static void * getEmptyMarker ()
 
- Protected Attributes inherited from llvm::SmallPtrSetImplBase
const void ** SmallArray
 SmallArray - Points to a fixed size set of buckets, used in 'small mode'. More...
 
const void ** CurArray
 CurArray - This is the current set of buckets. More...
 
unsigned CurArraySize
 CurArraySize - The allocated size of CurArray, always a power of two. More...
 
unsigned NumNonEmpty
 Number of elements in CurArray that contain a value or are a tombstone. More...
 
unsigned NumTombstones
 Number of tombstones in CurArray. More...
 

Detailed Description

template<typename NodeRef, unsigned SmallSize = 8>
struct llvm::df_iterator_default_set< NodeRef, SmallSize >

Definition at line 70 of file DepthFirstIterator.h.

Member Typedef Documentation

◆ BaseSet

template<typename NodeRef, unsigned SmallSize = 8>
using llvm::df_iterator_default_set< NodeRef, SmallSize >::BaseSet = SmallPtrSet<NodeRef, SmallSize>

Definition at line 71 of file DepthFirstIterator.h.

◆ iterator

template<typename NodeRef, unsigned SmallSize = 8>
using llvm::df_iterator_default_set< NodeRef, SmallSize >::iterator = typename BaseSet::iterator

Definition at line 72 of file DepthFirstIterator.h.

Member Function Documentation

◆ completed()

template<typename NodeRef, unsigned SmallSize = 8>
void llvm::df_iterator_default_set< NodeRef, SmallSize >::completed ( NodeRef  )
inline

Definition at line 78 of file DepthFirstIterator.h.

◆ insert() [1/2]

template<typename NodeRef, unsigned SmallSize = 8>
std::pair<iterator,bool> llvm::df_iterator_default_set< NodeRef, SmallSize >::insert ( NodeRef  N)
inline

◆ insert() [2/2]

template<typename NodeRef, unsigned SmallSize = 8>
template<typename IterT >
void llvm::df_iterator_default_set< NodeRef, SmallSize >::insert ( IterT  Begin,
IterT  End 
)
inline

Definition at line 76 of file DepthFirstIterator.h.


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