This class implements a map that also provides access to all stored values in a deterministic order. More...

#include "llvm/ADT/MapVector.h"

Inherited by llvm::SmallMapVector< llvm::Use *, llvm::Value *, 32 >, llvm::SmallMapVector< llvm::Value *, llvm::PointerIntPair< llvm::Value *, 1, bool >, 32 >, llvm::SmallMapVector< llvm::Value *, llvm::WeakTrackingVH, 16 >, llvm::SmallMapVector< llvm::Value *, llvm::Value *, 4 >, llvm::SmallMapVector< const llvm::RecurrenceDescriptor *, llvm::PHINode *, 4 >, llvm::SmallMapVector< unsigned, unsigned, 4 >, and llvm::SmallMapVector< const llvm::Value *, std::pair< llvm::Value *, llvm::Value * >, 4 >.

Public Types
using	key_type = KeyT

using	value_type = typename VectorType::value_type

using	size_type = typename VectorType::size_type

using	iterator = typename VectorType::iterator

using	const_iterator = typename VectorType::const_iterator

using	reverse_iterator = typename VectorType::reverse_iterator

using	const_reverse_iterator = typename VectorType::const_reverse_iterator

Public Member Functions
VectorType	takeVector ()
	Clear the MapVector and return 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 ()

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

template<typename... Ts>
std::pair< iterator, bool >	try_emplace (const KeyT &Key, Ts &&...Args)

template<typename... Ts>
std::pair< iterator, bool >	try_emplace (KeyT &&Key, Ts &&...Args)

std::pair< iterator, bool >	insert (const std::pair< KeyT, ValueT > &KV)

std::pair< iterator, bool >	insert (std::pair< KeyT, ValueT > &&KV)

template<typename V >
std::pair< iterator, bool >	insert_or_assign (const KeyT &Key, V &&Val)

template<typename V >
std::pair< iterator, bool >	insert_or_assign (KeyT &&Key, V &&Val)

bool	contains (const KeyT &Key) const

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.

VectorType::iterator	erase (typename VectorType::iterator Iterator)
	Remove the element given by Iterator.

size_type	erase (const KeyT &Key)
	Remove all elements with the key value Key.

template<class Predicate >
void	remove_if (Predicate Pred)
	Remove the elements that match the predicate.

template<class Function >
void	remove_if (Function Pred)

Detailed Description

template<typename KeyT, typename ValueT, typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
class llvm::MapVector< KeyT, ValueT, MapType, VectorType >

This class implements a map that also provides access to all stored values in a deterministic order.

The values are kept in a SmallVector<*, 0> and the mapping is done with DenseMap from Keys to indexes in that vector.

Definition at line 36 of file MapVector.h.