|
LLVM
4.0.0
|
Base class for DenseSet and DenseSmallSet. More...
#include <DenseSet.h>
Classes | |
| class | ConstIterator |
| class | Iterator |
Public Types | |
| typedef ValueT | key_type |
| typedef ValueT | value_type |
| typedef unsigned | size_type |
| typedef Iterator | iterator |
| typedef ConstIterator | const_iterator |
Public Member Functions | |
| 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 | swap (DenseSetImpl &RHS) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | find (const ValueT &V) |
| const_iterator | find (const ValueT &V) const |
| template<class LookupKeyT > | |
| iterator | find_as (const LookupKeyT &Val) |
| Alternative version of find() which allows a different, and possibly less expensive, key type. More... | |
| 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. More... | |
| template<typename LookupKeyT > | |
| std::pair< iterator, bool > | insert_as (ValueT &&V, const LookupKeyT &LookupKey) |
| template<typename InputIt > | |
| void | insert (InputIt I, InputIt E) |
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".
Definition at line 47 of file DenseSet.h.
| typedef ConstIterator llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::const_iterator |
Definition at line 138 of file DenseSet.h.
| typedef Iterator llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::iterator |
Definition at line 137 of file DenseSet.h.
| typedef ValueT llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::key_type |
Definition at line 53 of file DenseSet.h.
| typedef unsigned llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::size_type |
Definition at line 55 of file DenseSet.h.
| typedef ValueT llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::value_type |
Definition at line 54 of file DenseSet.h.
|
inlineexplicit |
Definition at line 57 of file DenseSet.h.
|
inline |
Definition at line 59 of file DenseSet.h.
|
inline |
Definition at line 140 of file DenseSet.h.
Referenced by llvm::ConstantUniqueMap< llvm::ConstantExpr >::begin().
|
inline |
Definition at line 143 of file DenseSet.h.
|
inline |
Definition at line 76 of file DenseSet.h.
|
inline |
Return 1 if the specified key is in the set, 0 otherwise.
Definition at line 81 of file DenseSet.h.
Referenced by relocationViaAlloca().
|
inline |
Definition at line 64 of file DenseSet.h.
|
inline |
Definition at line 141 of file DenseSet.h.
Referenced by llvm::ConstantUniqueMap< llvm::ConstantExpr >::end(), llvm::FunctionType::get(), llvm::StructType::get(), llvm::ConstantUniqueMap< llvm::ConstantExpr >::getOrCreate(), llvm::PBQP::ValuePool< AllowedRegVector >::getValue(), llvm::ConstantUniqueMap< llvm::ConstantExpr >::remove(), and llvm::ConstantUniqueMap< llvm::ConstantExpr >::replaceOperandsInPlace().
|
inline |
Definition at line 144 of file DenseSet.h.
|
inline |
Definition at line 85 of file DenseSet.h.
Referenced by llvm::ConstantUniqueMap< llvm::ConstantExpr >::remove().
|
inline |
Definition at line 165 of file DenseSet.h.
|
inline |
Definition at line 166 of file DenseSet.h.
|
inline |
Definition at line 146 of file DenseSet.h.
Referenced by llvm::ConstantUniqueMap< llvm::ConstantExpr >::remove().
|
inline |
Definition at line 147 of file DenseSet.h.
|
inline |
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.
Definition at line 157 of file DenseSet.h.
Referenced by llvm::FunctionType::get(), llvm::StructType::get(), llvm::ConstantUniqueMap< llvm::ConstantExpr >::getOrCreate(), llvm::PBQP::ValuePool< AllowedRegVector >::getValue(), and llvm::ConstantUniqueMap< llvm::ConstantExpr >::replaceOperandsInPlace().
|
inline |
Definition at line 161 of file DenseSet.h.
|
inline |
Definition at line 66 of file DenseSet.h.
|
inline |
Definition at line 168 of file DenseSet.h.
Referenced by appendsGenericAddressExpressionToPostorderStack(), llvm::detail::DenseSetImpl< const llvm::MDNode *, DenseMap< const llvm::MDNode *, detail::DenseSetEmpty, DenseMapInfo< const llvm::MDNode * >, detail::DenseSetPair< const llvm::MDNode * > >, DenseMapInfo< const llvm::MDNode * > >::DenseSetImpl(), llvm::DWARFDebugAranges::generate(), llvm::FunctionType::get(), llvm::StructType::get(), getPostIncrementOperand(), llvm::PBQP::ValuePool< AllowedRegVector >::getValue(), llvm::detail::DenseSetImpl< const llvm::MDNode *, DenseMap< const llvm::MDNode *, detail::DenseSetEmpty, DenseMapInfo< const llvm::MDNode * >, detail::DenseSetPair< const llvm::MDNode * > >, DenseMapInfo< const llvm::MDNode * > >::insert(), insertRelocationStores(), insertRematerializationStores(), and recomputeLiveInValues().
|
inline |
Definition at line 173 of file DenseSet.h.
|
inline |
Definition at line 192 of file DenseSet.h.
|
inline |
Alternative version of insert that uses a different (and possibly less expensive) key type.
Definition at line 181 of file DenseSet.h.
Referenced by llvm::ConstantUniqueMap< llvm::ConstantExpr >::replaceOperandsInPlace().
|
inline |
Definition at line 186 of file DenseSet.h.
|
inline |
Grow the DenseSet so that it can contain at least NumEntries items before resizing again.
Definition at line 74 of file DenseSet.h.
|
inline |
Grow the DenseSet so that it has at least Size buckets.
Will not shrink the Size of the set.
Definition at line 70 of file DenseSet.h.
|
inline |
Definition at line 65 of file DenseSet.h.
|
inline |
Definition at line 89 of file DenseSet.h.
1.8.6