Public Types
using	storage_type = std::vector< std::pair< Key, Value > >

using	iterator = typename storage_type::iterator

using	const_iterator = typename storage_type::const_iterator

Public Member Functions
	indexed_lookup_map ()=default
	Default-constructs an empty ordered lookup map.

void	reserve (std::size_t count)

void	push_back (const Key &key, const Value &value)

void	push_back (const Key &key, Value &&value)

Value &	at (const Key &key)

const Value &	at (const Key &key) const

Value &	operator[] (const Key &key)

const Value &	operator[] (const Key &key) const

bool	contains (const Key &key) const

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

const_iterator	cbegin () const

const_iterator	cend () const

bool	empty () const

std::size_t	size () const

Constructor & Destructor Documentation

◆ indexed_lookup_map()

template<typename Key , typename Value >

nxpp::indexed_lookup_map< Key, Value >::indexed_lookup_map ( )

default

Default-constructs an empty ordered lookup map.

Example:

Definition graph.hpp:143

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