Meta::MMap< Key, T, Compare, Allocator > Class Template Reference

Extends the standard map type, adding some useful convenience methods. More...

#include <MMap.h>

List of all members.

Public Types
typedef std::map< Key, T, Compare, Allocator >	Map_
typedef Map_::iterator	iterator
typedef Map_::const_iterator	const_iterator
typedef Map_::key_type	key_type
typedef Map_::allocator_type	allocator_type
typedef Map_::value_type	value_type
typedef Map_::key_compare	key_compare
typedef Map_::reverse_iterator	reverse_iterator
typedef Map_::const_reverse_iterator	const_reverse_iterator
typedef Map_::value_compare	value_compare
Public Member Functions
	MMap (const Compare &comp=Compare(), const Allocator &allocator=Allocator())
template<class InputIterator >
	MMap (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &allocator=Allocator())
	MMap (const MMap< Key, T, Compare, Allocator > &x)
const Map_	map () const
Map_	map ()
iterator	begin ()
const_iterator	begin () const
void	clear ()
size_t	count (const key_type &x) const
bool	empty () const
bool	isEmpty () const
iterator	end ()
const_iterator	end () const
std::pair< iterator, iterator >	equal_range (const key_type &x)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &x) const
std::pair< iterator, iterator >	equalRange (const key_type &x)
std::pair< const_iterator, const_iterator >	equalRange (const key_type &x) const
void	erase (iterator position)
size_t	erase (const key_type &x)
void	erase (iterator first, iterator last)
iterator	find (const key_type &x)
bool	hasKey (const key_type &x) const
const_iterator	find (const key_type &x) const
allocator_type	get_allocator () const
allocator_type	getAllocator () const
std::pair< iterator, bool >	insert (const value_type &x)
iterator	insert (iterator position, const value_type &x)
void	merge (const MMap< Key, T, Compare, Allocator > &m)
void	outerMerge (const MMap< Key, T, Compare, Allocator > &m)
template<class InputIterator >
void	insert (InputIterator first, InputIterator last)
MMap< Key, T, Compare, Allocator > &	add (const Key &k, const T &t)
key_compare	key_comp () const
key_compare	keyCompare () const
iterator	lower_bound (const key_type &x)
const_iterator	lower_bound (const key_type &x) const
iterator	lowerBound (const key_type &x)
const_iterator	lowerBound (const key_type &x) const
size_t	max_size () const
size_t	maxSize () const
MMap< Key, T, Compare, Allocator > &	operator= (const MMap< Key, T, Compare, Allocator > &x)
T &	operator[] (const key_type &x)
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
size_t	size () const
void	swap (MMap< Key, T, Compare, Allocator > &mp)
iterator	upper_bound (const key_type &x)
const_iterator	upper_bound (const key_type &x) const
iterator	upperBound (const key_type &x)
const_iterator	upperBound (const key_type &x) const
value_compare	value_comp () const
value_compare	valueCompare () const

---

Detailed Description

template<class Key, class T, class Compare = std::less<Key>, class Allocator = std::allocator<std::pair<const Key,T> >>
class Meta::MMap< Key, T, Compare, Allocator >

Extends the standard map type, adding some useful convenience methods.

Provides a map data type which is fully compatible with the standard map, adding some useful convenience functions. MMap extends the standard map with nearly no loss of performance.

---

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

• AndroMeta/include/AndroMeta/MMap.h