|
LLVM
4.0.0
|
This class implements a map that also provides access to all stored values in a deterministic order. More...
#include <MapVector.h>
Public Types | |
| typedef VectorType::iterator | iterator |
| typedef VectorType::const_iterator | const_iterator |
| typedef VectorType::reverse_iterator | reverse_iterator |
| typedef VectorType::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
| VectorType | takeVector () |
| Clear the MapVector and return the underlying vector. More... | |
| size_type | size () const |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| bool | empty () const |
| std::pair< KeyT, ValueT > & | front () |
| const std::pair< KeyT, ValueT > & | front () const |
| std::pair< KeyT, ValueT > & | back () |
| const std::pair< KeyT, ValueT > & | back () const |
| void | clear () |
| void | swap (MapVector &RHS) |
| ValueT & | operator[] (const KeyT &Key) |
| ValueT | lookup (const KeyT &Key) const |
| std::pair< iterator, bool > | insert (const std::pair< KeyT, ValueT > &KV) |
| std::pair< iterator, bool > | insert (std::pair< KeyT, ValueT > &&KV) |
| size_type | count (const KeyT &Key) const |
| iterator | find (const KeyT &Key) |
| const_iterator | find (const KeyT &Key) const |
| void | pop_back () |
| Remove the last element from the vector. More... | |
| VectorType::iterator | erase (typename VectorType::iterator Iterator) |
| Remove the element given by Iterator. More... | |
| size_type | erase (const KeyT &Key) |
| Remove all elements with the key value Key. More... | |
| template<class Predicate > | |
| void | remove_if (Predicate Pred) |
| Remove the elements that match the predicate. More... | |
| template<class Function > | |
| void | remove_if (Function Pred) |
This class implements a map that also provides access to all stored values in a deterministic order.
The values are kept in a std::vector and the mapping is done with DenseMap from Keys to indexes in that vector.
Definition at line 32 of file MapVector.h.
| typedef VectorType::const_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::const_iterator |
Definition at line 41 of file MapVector.h.
| typedef VectorType::const_reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::const_reverse_iterator |
Definition at line 43 of file MapVector.h.
| typedef VectorType::iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::iterator |
Definition at line 40 of file MapVector.h.
| typedef VectorType::reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::reverse_iterator |
Definition at line 42 of file MapVector.h.
|
inline |
Definition at line 69 of file MapVector.h.
|
inline |
Definition at line 70 of file MapVector.h.
|
inline |
Definition at line 53 of file MapVector.h.
Referenced by llvm::DbgValueHistoryMap::begin(), llvm::MapVector< AssertingVH< Instruction >, AssertingVH< Value > >::insert(), llvm::ScheduleDAGInstrs::insertBarrierChain(), and isSubset().
|
inline |
Definition at line 54 of file MapVector.h.
|
inline |
Definition at line 72 of file MapVector.h.
Referenced by llvm::DbgValueHistoryMap::clear(), llvm::ScheduleDAGInstrs::Value2SUsMap::clear(), and llvm::StackMaps::reset().
|
inline |
Definition at line 126 of file MapVector.h.
|
inline |
Definition at line 63 of file MapVector.h.
Referenced by llvm::DbgValueHistoryMap::empty().
|
inline |
Definition at line 55 of file MapVector.h.
Referenced by llvm::ScheduleDAGInstrs::addChainDependencies(), llvm::DbgValueHistoryMap::end(), llvm::MapVector< AssertingVH< Instruction >, AssertingVH< Value > >::erase(), llvm::DbgValueHistoryMap::getRegisterForVar(), llvm::MapVector< AssertingVH< Instruction >, AssertingVH< Value > >::insert(), llvm::ScheduleDAGInstrs::insertBarrierChain(), llvm::FileInfo::print(), and llvm::lto::thinBackend().
|
inline |
Definition at line 56 of file MapVector.h.
|
inline |
Remove the element given by Iterator.
Returns an iterator to the element following the one which was removed, which may be end().
Definition at line 157 of file MapVector.h.
Referenced by llvm::MapVector< AssertingVH< Instruction >, AssertingVH< Value > >::erase().
|
inline |
Remove all elements with the key value Key.
Returns the number of elements removed.
Definition at line 176 of file MapVector.h.
|
inline |
|
inline |
Definition at line 137 of file MapVector.h.
|
inline |
Definition at line 67 of file MapVector.h.
|
inline |
Definition at line 68 of file MapVector.h.
|
inline |
Definition at line 101 of file MapVector.h.
Referenced by findBasePointer(), and llvm::FileInfo::print().
|
inline |
Definition at line 113 of file MapVector.h.
|
inline |
Definition at line 94 of file MapVector.h.
|
inline |
Definition at line 82 of file MapVector.h.
Referenced by llvm::ScheduleDAGInstrs::Value2SUsMap::insert().
|
inline |
Remove the last element from the vector.
Definition at line 144 of file MapVector.h.
|
inline |
Definition at line 58 of file MapVector.h.
|
inline |
Definition at line 59 of file MapVector.h.
| void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::remove_if | ( | Predicate | Pred | ) |
Remove the elements that match the predicate.
Erase all elements that match Pred in a single pass. Takes linear time.
Referenced by llvm::ScheduleDAGInstrs::insertBarrierChain().
| void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::remove_if | ( | Function | Pred | ) |
Definition at line 193 of file MapVector.h.
|
inline |
Definition at line 60 of file MapVector.h.
|
inline |
Definition at line 61 of file MapVector.h.
|
inline |
Definition at line 51 of file MapVector.h.
|
inline |
Definition at line 77 of file MapVector.h.
|
inline |
Clear the MapVector and return the underlying vector.
Definition at line 46 of file MapVector.h.
Referenced by computeFunctionSummary().
1.8.6