LLVM: llvm::SmallMapVector< KeyT, ValueT, N (original) (raw)
A MapVector that performs no allocations if smaller than a certain size. More...
#include "[llvm/ADT/MapVector.h](MapVector%5F8h%5Fsource.html)"
Inheritance diagram for llvm::SmallMapVector< KeyT, ValueT, N >:
| Additional Inherited Members | |
|---|---|
| Public Types inherited from llvm::MapVector< KeyT, ValueT, SmallDenseMap< KeyT, unsigned, N >, SmallVector< std::pair< KeyT, ValueT >, N > > | |
| using | key_type |
| using | value_type |
| using | size_type |
| using | iterator |
| using | const_iterator |
| using | reverse_iterator |
| using | const_reverse_iterator |
| Public Member Functions inherited from llvm::MapVector< KeyT, ValueT, SmallDenseMap< KeyT, unsigned, N >, SmallVector< std::pair< KeyT, ValueT >, N > > | |
| void | remove_if (Function Pred) |
| SmallVector< std::pair< KeyT, ValueT >, N > | takeVector () |
| Clear the MapVector and return the underlying vector. | |
| ArrayRef< value_type > | getArrayRef () const |
| Returns an array reference of the underlying vector. | |
| size_type | size () const |
| void | reserve (size_type NumEntries) |
| Grow the MapVector so that it can contain at least NumEntries items before resizing again. | |
| iterator | begin () |
| iterator | end () |
| reverse_iterator | rbegin () |
| reverse_iterator | rend () |
| bool | empty () const |
| std::pair< KeyT, ValueT > & | front () |
| std::pair< KeyT, ValueT > & | back () |
| void | clear () |
| void | swap (MapVector &RHS) |
| ValueT & | operator[] (const KeyT &Key) |
| auto | keys () |
| auto | values () |
| ValueT | lookup (const KeyT &Key) const |
| std::pair< iterator, bool > | try_emplace (const KeyT &Key, Ts &&...Args) |
| std::pair< iterator, bool > | insert (const std::pair< KeyT, ValueT > &KV) |
| std::pair< iterator, bool > | insert_or_assign (const KeyT &Key, V &&Val) |
| bool | contains (const KeyT &Key) const |
| size_type | count (const KeyT &Key) const |
| iterator | find (const KeyT &Key) |
| ValueT & | at (const KeyT &Key) |
| at - Return the entry for the specified key, or abort if no such entry exists. | |
| void | pop_back () |
| Remove the last element from the vector. | |
| SmallVector< std::pair< KeyT, ValueT >, N >::iterator | erase (typename SmallVector< std::pair< KeyT, ValueT >, N >::iterator Iterator) |
| Remove the element given by Iterator. |
Detailed Description
template<typename KeyT, typename ValueT, unsigned N>
struct llvm::SmallMapVector< KeyT, ValueT, N >
A MapVector that performs no allocations if smaller than a certain size.
Definition at line 274 of file MapVector.h.
The documentation for this struct was generated from the following file:
- include/llvm/ADT/MapVector.h