|
LLVM
4.0.0
|
Implements a dense probed hash-table based set with some number of buckets stored inline. More...
#include <DenseSet.h>
Additional Inherited Members | |
Public Types inherited from llvm::detail::DenseSetImpl< ValueT, SmallDenseMap< ValueT, detail::DenseSetEmpty, InlineBuckets, ValueInfoT, detail::DenseSetPair< ValueT > >, ValueInfoT > | |
| typedef ValueT | key_type |
| typedef ValueT | value_type |
| typedef unsigned | size_type |
| typedef Iterator | iterator |
| typedef ConstIterator | const_iterator |
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 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 ValueT &V) |
| const_iterator | find (const 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, bool > | insert (const ValueT &V) |
| std::pair< iterator, bool > | insert (ValueT &&V) |
| void | insert (InputIt I, InputIt E) |
| 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. More... | |
| std::pair< iterator, bool > | insert_as (ValueT &&V, const LookupKeyT &LookupKey) |
Implements a dense probed hash-table based set with some number of buckets stored inline.
Definition at line 220 of file DenseSet.h.
1.8.6