class DenseSetImpl
Declaration
template <typename ValueT, typename MapTy, typename ValueInfoT>
class DenseSetImpl { /* full declaration omitted */ };
Description
Base class for DenseSet and DenseSmallSet. MapTy should be either DenseMap <ValueT , detail::DenseSetEmpty, ValueInfoT, detail::DenseSetPair <ValueT >> or the equivalent SmallDenseMap type. ValueInfoT must implement the DenseMapInfo "concept".
Declared at: llvm/include/llvm/ADT/DenseSet.h:54
Templates
- ValueT
- MapTy
- ValueInfoT
Method Overview
- public DenseSetImpl<ValueT, MapTy, ValueInfoT>(std::initializer_list<ValueT> Elems)
- public DenseSetImpl<ValueT, MapTy, ValueInfoT>(unsigned int InitialReserve = 0)
- public llvm::detail::DenseSetImpl::const_iterator begin() const
- public llvm::detail::DenseSetImpl::iterator begin()
- public void clear()
- public llvm::detail::DenseSetImpl::size_type count(int V) const
- public bool empty() const
- public llvm::detail::DenseSetImpl::iterator end()
- public llvm::detail::DenseSetImpl::const_iterator end() const
- public bool erase(const ValueT & V)
- public void erase(llvm::detail::DenseSetImpl::Iterator I)
- public void erase(llvm::detail::DenseSetImpl::ConstIterator CI)
- public llvm::detail::DenseSetImpl::iterator find(int V)
- public llvm::detail::DenseSetImpl::const_iterator find(int V) const
- public template <class LookupKeyT>llvm::detail::DenseSetImpl::const_iterator find_as(const LookupKeyT & Val) const
- public template <class LookupKeyT>llvm::detail::DenseSetImpl::iterator find_as(const LookupKeyT & Val)
- public size_t getMemorySize() const
- public template <typename InputIt>void insert(InputIt I, InputIt E)
- public std::pair<iterator, bool> insert(ValueT && V)
- public std::pair<iterator, bool> insert(const ValueT & V)
- public template <typename LookupKeyT>std::pair<iterator, bool> insert_as(const ValueT & V, const LookupKeyT & LookupKey)
- public template <typename LookupKeyT>std::pair<iterator, bool> insert_as(ValueT && V, const LookupKeyT & LookupKey)
- public void reserve(size_t Size)
- public void resize(size_t Size)
- public llvm::detail::DenseSetImpl::size_type size() const
- public void swap(DenseSetImpl<ValueT, MapTy, ValueInfoT> & RHS)
Methods
¶DenseSetImpl<ValueT, MapTy, ValueInfoT>(
std::initializer_list<ValueT> Elems)
DenseSetImpl<ValueT, MapTy, ValueInfoT>(
std::initializer_list<ValueT> Elems)
Declared at: llvm/include/llvm/ADT/DenseSet.h:69
Parameters
- std::initializer_list<ValueT> Elems
¶DenseSetImpl<ValueT, MapTy, ValueInfoT>(
unsigned int InitialReserve = 0)
DenseSetImpl<ValueT, MapTy, ValueInfoT>(
unsigned int InitialReserve = 0)
Declared at: llvm/include/llvm/ADT/DenseSet.h:67
Parameters
- unsigned int InitialReserve = 0
¶llvm::detail::DenseSetImpl::const_iterator begin()
const
llvm::detail::DenseSetImpl::const_iterator begin()
const
Declared at: llvm/include/llvm/ADT/DenseSet.h:162
¶llvm::detail::DenseSetImpl::iterator begin()
llvm::detail::DenseSetImpl::iterator begin()
Declared at: llvm/include/llvm/ADT/DenseSet.h:159
¶void clear()
void clear()
Declared at: llvm/include/llvm/ADT/DenseSet.h:86
¶llvm::detail::DenseSetImpl::size_type count(
int V) const
llvm::detail::DenseSetImpl::size_type count(
int V) const
Declared at: llvm/include/llvm/ADT/DenseSet.h:91
Parameters
- int V
¶bool empty() const
bool empty() const
Declared at: llvm/include/llvm/ADT/DenseSet.h:74
¶llvm::detail::DenseSetImpl::iterator end()
llvm::detail::DenseSetImpl::iterator end()
Declared at: llvm/include/llvm/ADT/DenseSet.h:160
¶llvm::detail::DenseSetImpl::const_iterator end()
const
llvm::detail::DenseSetImpl::const_iterator end()
const
Declared at: llvm/include/llvm/ADT/DenseSet.h:163
¶bool erase(const ValueT& V)
bool erase(const ValueT& V)
Declared at: llvm/include/llvm/ADT/DenseSet.h:95
Parameters
- const ValueT& V
¶void erase(llvm::detail::DenseSetImpl::Iterator I)
void erase(llvm::detail::DenseSetImpl::Iterator I)
Declared at: llvm/include/llvm/ADT/DenseSet.h:184
Parameters
¶void erase(
llvm::detail::DenseSetImpl::ConstIterator CI)
void erase(
llvm::detail::DenseSetImpl::ConstIterator CI)
Declared at: llvm/include/llvm/ADT/DenseSet.h:185
Parameters
¶llvm::detail::DenseSetImpl::iterator find(int V)
llvm::detail::DenseSetImpl::iterator find(int V)
Declared at: llvm/include/llvm/ADT/DenseSet.h:165
Parameters
- int V
¶llvm::detail::DenseSetImpl::const_iterator find(
int V) const
llvm::detail::DenseSetImpl::const_iterator find(
int V) const
Declared at: llvm/include/llvm/ADT/DenseSet.h:166
Parameters
- int V
¶template <class LookupKeyT>
llvm::detail::DenseSetImpl::const_iterator
find_as(const LookupKeyT& Val) const
template <class LookupKeyT>
llvm::detail::DenseSetImpl::const_iterator
find_as(const LookupKeyT& Val) const
Declared at: llvm/include/llvm/ADT/DenseSet.h:180
Templates
- LookupKeyT
Parameters
- const LookupKeyT& Val
¶template <class LookupKeyT>
llvm::detail::DenseSetImpl::iterator find_as(
const LookupKeyT& Val)
template <class LookupKeyT>
llvm::detail::DenseSetImpl::iterator find_as(
const LookupKeyT& Val)
Description
Alternative version of find() which allows a different, and possibly less expensive, key type. The DenseMapInfo is responsible for supplying methods getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key type used.
Declared at: llvm/include/llvm/ADT/DenseSet.h:176
Templates
- LookupKeyT
Parameters
- const LookupKeyT& Val
¶size_t getMemorySize() const
size_t getMemorySize() const
Declared at: llvm/include/llvm/ADT/DenseSet.h:76
¶template <typename InputIt>
void insert(InputIt I, InputIt E)
template <typename InputIt>
void insert(InputIt I, InputIt E)
Declared at: llvm/include/llvm/ADT/DenseSet.h:211
Templates
- InputIt
Parameters
- InputIt I
- InputIt E
¶std::pair<iterator, bool> insert(ValueT&& V)
std::pair<iterator, bool> insert(ValueT&& V)
Declared at: llvm/include/llvm/ADT/DenseSet.h:192
Parameters
- ValueT&& V
¶std::pair<iterator, bool> insert(const ValueT& V)
std::pair<iterator, bool> insert(const ValueT& V)
Declared at: llvm/include/llvm/ADT/DenseSet.h:187
Parameters
- const ValueT& V
¶template <typename LookupKeyT>
std::pair<iterator, bool> insert_as(
const ValueT& V,
const LookupKeyT& LookupKey)
template <typename LookupKeyT>
std::pair<iterator, bool> insert_as(
const ValueT& V,
const LookupKeyT& LookupKey)
Description
Alternative version of insert that uses a different (and possibly less expensive) key type.
Declared at: llvm/include/llvm/ADT/DenseSet.h:200
Templates
- LookupKeyT
Parameters
- const ValueT& V
- const LookupKeyT& LookupKey
¶template <typename LookupKeyT>
std::pair<iterator, bool> insert_as(
ValueT&& V,
const LookupKeyT& LookupKey)
template <typename LookupKeyT>
std::pair<iterator, bool> insert_as(
ValueT&& V,
const LookupKeyT& LookupKey)
Declared at: llvm/include/llvm/ADT/DenseSet.h:205
Templates
- LookupKeyT
Parameters
- ValueT&& V
- const LookupKeyT& LookupKey
¶void reserve(size_t Size)
void reserve(size_t Size)
Description
Grow the DenseSet so that it can contain at least \p NumEntries items before resizing again.
Declared at: llvm/include/llvm/ADT/DenseSet.h:84
Parameters
- size_t Size
¶void resize(size_t Size)
void resize(size_t Size)
Description
Grow the DenseSet so that it has at least Size buckets. Will not shrink the Size of the set.
Declared at: llvm/include/llvm/ADT/DenseSet.h:80
Parameters
- size_t Size
¶llvm::detail::DenseSetImpl::size_type size() const
llvm::detail::DenseSetImpl::size_type size() const
Declared at: llvm/include/llvm/ADT/DenseSet.h:75
¶void swap(
DenseSetImpl<ValueT, MapTy, ValueInfoT>& RHS)
void swap(
DenseSetImpl<ValueT, MapTy, ValueInfoT>& RHS)
Declared at: llvm/include/llvm/ADT/DenseSet.h:99
Parameters
- DenseSetImpl<ValueT, MapTy, ValueInfoT>& RHS