LLVM  6.0.0svn
List of all members
llvm::SmallMapVector< KeyT, ValueT, N > Struct Template Reference

A MapVector that performs no allocations if smaller than a certain size. More...

#include "llvm/ADT/MapVector.h"

Inheritance diagram for llvm::SmallMapVector< KeyT, ValueT, N >:
Inheritance graph
[legend]
Collaboration diagram for llvm::SmallMapVector< KeyT, ValueT, N >:
Collaboration graph
[legend]

Additional Inherited Members

- Public Types inherited from llvm::MapVector< KeyT, ValueT, SmallDenseMap< KeyT, unsigned, N >, SmallVector< std::pair< KeyT, ValueT >, N > >
using iterator = typename SmallVector< std::pair< KeyT, ValueT >, N > ::iterator
 
using const_iterator = typename SmallVector< std::pair< KeyT, ValueT >, N > ::const_iterator
 
using reverse_iterator = typename SmallVector< std::pair< KeyT, ValueT >, N > ::reverse_iterator
 
using const_reverse_iterator = typename SmallVector< std::pair< KeyT, ValueT >, N > ::const_reverse_iterator
 
- Public Member Functions inherited from llvm::MapVector< KeyT, ValueT, SmallDenseMap< KeyT, unsigned, N >, SmallVector< std::pair< KeyT, ValueT >, N > >
SmallVector< std::pair< KeyT, ValueT >, NtakeVector ()
 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)
 
ValueToperator[] (const KeyT &Key)
 
ValueT lookup (const KeyT &Key) const
 
std::pair< iterator, boolinsert (const std::pair< KeyT, ValueT > &KV)
 
std::pair< iterator, boolinsert (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...
 
SmallVector< std::pair< KeyT, ValueT >, N > ::iterator erase (typename SmallVector< std::pair< KeyT, ValueT >, N > ::iterator Iterator)
 Remove the element given by Iterator. More...
 
size_type erase (const KeyT &Key)
 Remove all elements with the key value Key. More...
 
void remove_if (Predicate Pred)
 Remove the elements that match the predicate. More...
 
void remove_if (Function Pred)
 

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 222 of file MapVector.h.


The documentation for this struct was generated from the following file: