Common::MultiMap< Key, Val, CompFunc > Class Template Reference

#include <multimap.h>

Public Types
using	value_type = Pair< Key, Val >
using	iterator = typename TreeT::BasicIterator
using	const_iterator = typename TreeT::ConstIterator

Public Member Functions
void	clear ()
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
const_iterator	lower_bound (const Key &key) const
iterator	lower_bound (const Key &key)
iterator	upper_bound (const Key &key)
iterator	find (const Key &theKey)
const_iterator	find (const Key &theKey) const
iterator	erase (iterator it)
iterator	erase (iterator first, iterator last)
iterator	erase (const Key &theKey)
iterator	insert (const value_type &val)
size_t	size () const
bool	empty () const
size_t	count (const Key &theKey)

Detailed Description

template<class Key, class Val, class CompFunc = Common::Less<Key>>
class Common::MultiMap< Key, Val, CompFunc >

multimap implementation meant as a drop-in replacement for the C++ standard library's std::multimap

Member Function Documentation

clear()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

void Common::MultiMap< Key, Val, CompFunc >::clear ( )

inline

Clears the map

begin() [1/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>

iterator Common::MultiMap< Key, Val, CompFunc >::begin ( )

inline

Gets the iterator start

end() [1/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>

iterator Common::MultiMap< Key, Val, CompFunc >::end ( )

inline

Get the iterator end

begin() [2/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>

const_iterator Common::MultiMap< Key, Val, CompFunc >::begin ( ) const

inline

Get the const iterator start

end() [2/2]

template<class Key, class Val, class CompFunc = Common::Less<Key>>

const_iterator Common::MultiMap< Key, Val, CompFunc >::end ( ) const

inline

Get the const iterator end

lower_bound()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

const_iterator Common::MultiMap< Key, Val, CompFunc >::lower_bound ( const Key &  key ) const

inline

Returns an iterator for the first element of the map that is not less than the given key

find()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

iterator Common::MultiMap< Key, Val, CompFunc >::find ( const Key &  theKey )

inline

Find the entry with the given key

erase()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

iterator Common::MultiMap< Key, Val, CompFunc >::erase ( iterator  it )

inline

Erases an entry in the map

size()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

size_t Common::MultiMap< Key, Val, CompFunc >::size ( ) const

inline

Returns the size of the map

count()

template<class Key, class Val, class CompFunc = Common::Less<Key>>

size_t Common::MultiMap< Key, Val, CompFunc >::count ( const Key &  theKey )

inline

Returns the number of elements with a matching key

---

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

• common/multimap.h