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

#include <wpi/MapVector.h>

Inheritance diagram for wpi::SmallMapVector< KeyT, ValueT, N >:

Additional Inherited Members
Public Types inherited from wpi::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 wpi::MapVector< KeyT, ValueT, SmallDenseMap< KeyT, unsigned, N >, SmallVector< std::pair< KeyT, ValueT >, N > >
SmallVector< std::pair< KeyT, ValueT >, N >	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

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

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)

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

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.

SmallVector< std::pair< KeyT, ValueT >, N >::iterator	erase (typename SmallVector< std::pair< KeyT, ValueT >, N >::iterator Iterator)
	Remove the element given by Iterator.

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

void	remove_if (Predicate Pred)
	Remove the elements that match the predicate.

void	remove_if (Function Pred)

Detailed Description

template<typename KeyT, typename ValueT, unsigned N>
struct wpi::SmallMapVector< KeyT, ValueT, N >

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

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

wpi/MapVector.h

Additional Inherited Members

Detailed Description