LLVM  6.0.0svn
List of all members
llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT > Class Template Reference

Implements a dense probed hash-table based set with some number of buckets stored inline. More...

#include "llvm/ADT/DenseSet.h"

Inheritance diagram for llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >:
Inheritance graph
[legend]
Collaboration diagram for llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >:
Collaboration graph
[legend]

Additional Inherited Members

- Public Types inherited from llvm::detail::DenseSetImpl< ValueT, SmallDenseMap< ValueT, detail::DenseSetEmpty, InlineBuckets, ValueInfoT, detail::DenseSetPair< ValueT > >, ValueInfoT >
using key_type = ValueT
 
using value_type = ValueT
 
using size_type = unsigned
 
using iterator = Iterator
 
using const_iterator = ConstIterator
 
- Public Member Functions inherited from llvm::detail::DenseSetImpl< ValueT, SmallDenseMap< ValueT, detail::DenseSetEmpty, InlineBuckets, ValueInfoT, detail::DenseSetPair< ValueT > >, ValueInfoT >
 DenseSetImpl (unsigned InitialReserve=0)
 
 DenseSetImpl (std::initializer_list< ValueT > Elems)
 
bool empty () const
 
size_type size () const
 
size_t getMemorySize () const
 
void resize (size_t Size)
 Grow the DenseSet so that it has at least Size buckets. More...
 
void reserve (size_t Size)
 Grow the DenseSet so that it can contain at least NumEntries items before resizing again. More...
 
void clear ()
 
size_type count (const_arg_type_t< ValueT > V) const
 Return 1 if the specified key is in the set, 0 otherwise. More...
 
bool erase (const ValueT &V)
 
void erase (Iterator I)
 
void erase (ConstIterator CI)
 
void swap (DenseSetImpl &RHS)
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
iterator find (const_arg_type_t< ValueT > V)
 
const_iterator find (const_arg_type_t< ValueT > V) const
 
iterator find_as (const LookupKeyT &Val)
 Alternative version of find() which allows a different, and possibly less expensive, key type. More...
 
const_iterator find_as (const LookupKeyT &Val) const
 
std::pair< iterator, boolinsert (const ValueT &V)
 
std::pair< iterator, boolinsert (ValueT &&V)
 
void insert (InputIt I, InputIt E)
 
std::pair< iterator, boolinsert_as (const ValueT &V, const LookupKeyT &LookupKey)
 Alternative version of insert that uses a different (and possibly less expensive) key type. More...
 
std::pair< iterator, boolinsert_as (ValueT &&V, const LookupKeyT &LookupKey)
 

Detailed Description

template<typename ValueT, unsigned InlineBuckets = 4, typename ValueInfoT = DenseMapInfo<ValueT>>
class llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >

Implements a dense probed hash-table based set with some number of buckets stored inline.

Definition at line 239 of file DenseSet.h.


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