#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 | |
| DenseSet (unsigned NumInitBuckets=0) | |
| bool | empty () const |
| size_type | size () const |
| size_t | getMemorySize () const |
| void | resize (size_t Size) |
| void | clear () |
| size_type | count (const ValueT &V) const |
| Return 1 if the specified key is in the set, 0 otherwise. | |
| bool | erase (const ValueT &V) |
| void | swap (DenseSet &RHS) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | find (const ValueT &V) |
| void | erase (Iterator I) |
| void | erase (ConstIterator CI) |
| std::pair< iterator, bool > | insert (const ValueT &V) |
| template<typename InputIt > | |
| void | insert (InputIt I, InputIt E) |
Detailed Description
template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>>
class llvm::DenseSet< ValueT, ValueInfoT >
DenseSet - This implements a dense probed hash-table based set.
FIXME: This is currently implemented directly in terms of DenseMap, this should be optimized later if there is a need.
Definition at line 26 of file DenseSet.h.
Member Typedef Documentation
| typedef ConstIterator llvm::DenseSet< ValueT, ValueInfoT >::const_iterator |
Definition at line 104 of file DenseSet.h.
| typedef Iterator llvm::DenseSet< ValueT, ValueInfoT >::iterator |
Definition at line 103 of file DenseSet.h.
| typedef ValueT llvm::DenseSet< ValueT, ValueInfoT >::key_type |
Definition at line 30 of file DenseSet.h.
| typedef unsigned llvm::DenseSet< ValueT, ValueInfoT >::size_type |
Definition at line 32 of file DenseSet.h.
| typedef ValueT llvm::DenseSet< ValueT, ValueInfoT >::value_type |
Definition at line 31 of file DenseSet.h.
Constructor & Destructor Documentation
| llvm::DenseSet< ValueT, ValueInfoT >::DenseSet | ( | unsigned | NumInitBuckets = 0 | ) | [inline, explicit] |
Definition at line 34 of file DenseSet.h.
Member Function Documentation
| iterator llvm::DenseSet< ValueT, ValueInfoT >::begin | ( | ) | [inline] |
Definition at line 106 of file DenseSet.h.
Referenced by llvm::MachineConstantPool::~MachineConstantPool().
| const_iterator llvm::DenseSet< ValueT, ValueInfoT >::begin | ( | ) | const [inline] |
Definition at line 109 of file DenseSet.h.
| void llvm::DenseSet< ValueT, ValueInfoT >::clear | ( | ) | [inline] |
Definition at line 44 of file DenseSet.h.
Referenced by llvm::TypeFinder::clear().
| size_type llvm::DenseSet< ValueT, ValueInfoT >::count | ( | const ValueT & | V | ) | const [inline] |
Return 1 if the specified key is in the set, 0 otherwise.
Definition at line 49 of file DenseSet.h.
Referenced by readCoverageMappingData(), and llvm::LoopInfo::verifyAnalysis().
| bool llvm::DenseSet< ValueT, ValueInfoT >::empty | ( | ) | const [inline] |
Definition at line 36 of file DenseSet.h.
Referenced by llvm::ScalarEvolution::releaseMemory().
| iterator llvm::DenseSet< ValueT, ValueInfoT >::end | ( | ) | [inline] |
Definition at line 107 of file DenseSet.h.
Referenced by llvm::MachineConstantPool::~MachineConstantPool().
| const_iterator llvm::DenseSet< ValueT, ValueInfoT >::end | ( | ) | const [inline] |
Definition at line 110 of file DenseSet.h.
| bool llvm::DenseSet< ValueT, ValueInfoT >::erase | ( | const ValueT & | V | ) | [inline] |
Definition at line 53 of file DenseSet.h.
| void llvm::DenseSet< ValueT, ValueInfoT >::erase | ( | Iterator | I | ) | [inline] |
Definition at line 113 of file DenseSet.h.
| void llvm::DenseSet< ValueT, ValueInfoT >::erase | ( | ConstIterator | CI | ) | [inline] |
Definition at line 114 of file DenseSet.h.
| iterator llvm::DenseSet< ValueT, ValueInfoT >::find | ( | const ValueT & | V | ) | [inline] |
Definition at line 112 of file DenseSet.h.
| size_t llvm::DenseSet< ValueT, ValueInfoT >::getMemorySize | ( | ) | const [inline] |
Definition at line 38 of file DenseSet.h.
| std::pair<iterator, bool> llvm::DenseSet< ValueT, ValueInfoT >::insert | ( | const ValueT & | V | ) | [inline] |
Definition at line 116 of file DenseSet.h.
Referenced by llvm::DWARFDebugAranges::generate(), llvm::MachineConstantPool::getConstantPoolIndex(), getRegsUsedByPHIs(), llvm::DenseSet< Type * >::insert(), readCoverageMappingData(), and llvm::LoopBase< BlockT, LoopT >::verifyLoopNest().
| void llvm::DenseSet< ValueT, ValueInfoT >::insert | ( | InputIt | I, |
| InputIt | E | ||
| ) | [inline] |
Definition at line 122 of file DenseSet.h.
| void llvm::DenseSet< ValueT, ValueInfoT >::resize | ( | size_t | Size | ) | [inline] |
Grow the DenseSet so that it has at least Size buckets. Will not shrink the Size of the set.
Definition at line 42 of file DenseSet.h.
| size_type llvm::DenseSet< ValueT, ValueInfoT >::size | ( | ) | const [inline] |
Definition at line 37 of file DenseSet.h.
| void llvm::DenseSet< ValueT, ValueInfoT >::swap | ( | DenseSet< ValueT, ValueInfoT > & | RHS | ) | [inline] |
Definition at line 57 of file DenseSet.h.
The documentation for this class was generated from the following file:
1.7.6.1