LLVM: llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT (original) (raw)
Implements a dense probed hash-table based set with some number of buckets stored inline. More...
#include "[llvm/ADT/DenseSet.h](DenseSet%5F8h%5Fsource.html)"
Inheritance diagram for llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >:
| Additional Inherited Members | |
|---|---|
| Public Types inherited from llvm::detail::DenseSetImpl< ValueT, SmallDenseMap< ValueT, DenseSetEmpty, InlineBuckets, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT > | |
| using | key_type |
| using | value_type |
| using | size_type |
| using | iterator |
| using | const_iterator |
| Public Member Functions inherited from llvm::detail::DenseSetImpl< ValueT, SmallDenseMap< ValueT, DenseSetEmpty, InlineBuckets, ValueInfoT, DenseSetPair< ValueT > >, ValueInfoT > | |
| DenseSetImpl (unsigned InitialReserve=0) | |
| DenseSetImpl (const InputIt &I, const InputIt &E) | |
| DenseSetImpl (std::initializer_list< ValueT > Elems) | |
| DenseSetImpl (llvm::from_range_t, Range &&R) | |
| 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 () |
| 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. | |
| size_type | count (const_arg_type_t< ValueT > V) const |
| Return 1 if the specified key is in the set, 0 otherwise. | |
| iterator | find_as (const LookupKeyT &Val) |
| Alternative version of find() which allows a different, and possibly less expensive, key type. | |
| const_iterator | find_as (const LookupKeyT &Val) const |
| void | erase (iterator I) |
| void | erase (const_iterator CI) |
| std::pair< iterator, bool > | insert (const ValueT &V) |
| std::pair< iterator, bool > | insert (ValueT &&V) |
| 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. | |
| std::pair< iterator, bool > | insert_as (ValueT &&V, const LookupKeyT &LookupKey) |
| void | insert (InputIt I, InputIt E) |
| void | insert_range (Range &&R) |
Detailed Description
template<typename ValueT, unsigned InlineBuckets = 4, typename ValueInfoT = DenseMapInfo>
class llvm::SmallDenseSet< ValueT, InlineBuckets, ValueInfoT >
Implements a dense probed hash-table based set with some number of buckets stored inline.
Definition at line 290 of file DenseSet.h.
The documentation for this class was generated from the following file:
- include/llvm/ADT/DenseSet.h