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 >:
Additional Inherited Members | |
 Public Types inherited from llvm::detail::DenseSetImpl< ValueT, MapTy, 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, MapTy, ValueInfoT > | |
| DenseSetImpl (unsigned InitialReserve=0) | |
| template<typename InputIt > | |
| DenseSetImpl (const InputIt &I, const InputIt &E) | |
| 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. | |
| void | reserve (size_t Size) |
Grow the DenseSet so that it can contain at least NumEntries items before resizing again. | |
| void | clear () |
| size_type | count (const_arg_type_t< ValueT > V) const |
| Return 1 if the specified key is in the set, 0 otherwise. | |
| bool | erase (const ValueT &V) |
| void | swap (DenseSetImpl &RHS) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | find (const_arg_type_t< ValueT > V) |
| const_iterator | find (const_arg_type_t< ValueT > V) const |
| bool | contains (const_arg_type_t< ValueT > V) const |
| Check if the set contains the given element. | |
| template<class LookupKeyT > | |
| iterator | find_as (const LookupKeyT &Val) |
| Alternative version of find() which allows a different, and possibly less expensive, key type. | |
| template<class LookupKeyT > | |
| const_iterator | find_as (const LookupKeyT &Val) const |
| void | erase (Iterator I) |
| void | erase (ConstIterator CI) |
| std::pair< iterator, bool > | insert (const ValueT &V) |
| std::pair< iterator, bool > | insert (ValueT &&V) |
| template<typename LookupKeyT > | |
| std::pair< iterator, bool > | insert_as (const ValueT &V, const LookupKeyT &LookupKey) |
| Alternative version of insert that uses a different (and possibly less expensive) key type. | |
| template<typename LookupKeyT > | |
| std::pair< iterator, bool > | insert_as (ValueT &&V, const LookupKeyT &LookupKey) |
| template<typename InputIt > | |
| void | insert (InputIt I, InputIt E) |
Detailed Description
template<typename ValueT, unsigned InlineBuckets = 4, typename ValueInfoT = DenseMapInfo<ValueT>>
class llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >
class llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >
Implements a dense probed hash-table based set with some number of buckets stored inline.
Definition at line 293 of file DenseSet.h.
The documentation for this class was generated from the following file:
- include/llvm/ADT/DenseSet.h
