|
AndroMeta
2.0.0
|
Extends the standard multimap type, adding some useful convenience methods. More...
#include <MMultiMap.h>
Public Types | |
|
typedef std::multimap< 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 | |
| MMultiMap (const Compare &comp=Compare(), const Allocator &allocator=Allocator()) | |
| template<class InputIterator > | |
| MMultiMap (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &allocator=Allocator()) | |
| MMultiMap (const MMultiMap< Key, T, Compare, Allocator > &x) | |
| iterator | begin () |
| const_iterator | begin () const |
| void | clear () |
| size_t | count (const key_type &x) const |
| bool | empty () 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 |
| void | erase (iterator position) |
| size_t | erase (const key_type &x) |
| void | erase (iterator first, iterator last) |
| iterator | find (const key_type &x) |
| const_iterator | find (const key_type &x) const |
| allocator_type | get_allocator () const |
| allocator_type | getAllocator () const |
| iterator | insert (const value_type &x) |
| iterator | insert (iterator position, const value_type &x) |
| template<class InputIterator > | |
| void | insert (InputIterator first, InputIterator last) |
|
MMultiMap< Key, T, Compare, Allocator > & | add (const Key &k, const T &t) |
| void | merge (const MMultiMap< Key, T, Compare, Allocator > &m) |
| key_compare | key_comp () const |
| key_compare | keyCompare () const |
| iterator | lower_bound (const key_type &x) |
| iterator | lowerBound (const key_type &x) |
| const_iterator | lower_bound (const key_type &x) const |
| const_iterator | lowerBound (const key_type &x) const |
| size_t | max_size () const |
| size_t | maxSize () const |
|
MMultiMap< Key, T, Compare, Allocator > & | operator= (const MMultiMap< Key, T, Compare, Allocator > &x) |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| size_t | size () const |
| void | swap (MMultiMap< Key, T, Compare, Allocator > &m) |
| iterator | upper_bound (const key_type &x) |
| iterator | upperBound (const key_type &x) |
| const_iterator | upper_bound (const key_type &x) const |
| const_iterator | upperBound (const key_type &x) const |
| value_compare | value_comp () const |
| value_compare | valueCompare () const |
| const Map_ & | map () const |
| Map_ & | map () |
Extends the standard multimap type, adding some useful convenience methods.
Provides a multimap data type which is fully compatible with the standard multimap, adding some useful convenience functions. MMultiMap extends the standard multimap type with nearly no loss of performance.
1.7.6.1