LLVM: llvm::BlotMapVector< KeyT, ValueT > Class Template Reference (original) (raw)
An associative container with fast insertion-order (deterministic) iteration over its elements. More...
#include "[Transforms/ObjCARC/BlotMapVector.h](BlotMapVector%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| using | iterator = typename VectorTy::iterator |
| using | const_iterator = typename VectorTy::const_iterator |
| Public Member Functions | |
|---|---|
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| ValueT & | operator[] (const KeyT &Arg) |
| std::pair< iterator, bool > | insert (const std::pair< KeyT, ValueT > &InsertPair) |
| iterator | find (const KeyT &Key) |
| const_iterator | find (const KeyT &Key) const |
| void | blot (const KeyT &Key) |
| This is similar to erase, but instead of removing the element from the vector, it just zeros out the key in the vector. | |
| void | clear () |
| bool | empty () const |
template<class KeyT, class ValueT>
class llvm::BlotMapVector< KeyT, ValueT >
An associative container with fast insertion-order (deterministic) iteration over its elements.
Plus the special blot operation.
Definition at line 22 of file BlotMapVector.h.
◆ const_iterator
template<class KeyT, class ValueT>
◆ iterator
template<class KeyT, class ValueT>
◆ begin() [1/2]
template<class KeyT, class ValueT>
◆ begin() [2/2]
template<class KeyT, class ValueT>
◆ blot()
template<class KeyT, class ValueT>
◆ clear()
template<class KeyT, class ValueT>
◆ empty()
template<class KeyT, class ValueT>
◆ end() [1/2]
template<class KeyT, class ValueT>
◆ end() [2/2]
template<class KeyT, class ValueT>
◆ find() [1/2]
template<class KeyT, class ValueT>
◆ find() [2/2]
template<class KeyT, class ValueT>
◆ insert()
template<class KeyT, class ValueT>
◆ operator[]()
template<class KeyT, class ValueT>
The documentation for this class was generated from the following file:
- lib/Transforms/ObjCARC/BlotMapVector.h