momo  3.11
Public Types | Public Member Functions | Friends | List of all members
momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap > Class Template Reference

momo::stdish::multimap is similar to std::multimap, but much more efficient in memory usage. The implementation is based on a B-tree. More...

#include <map.h>

Inheritance diagram for momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >:

Public Types

typedef iterator insert_return_type
 
typedef TKey key_type
 
typedef TMapped mapped_type
 
typedef size_t size_type
 
typedef std::pair< const key_type, mapped_type > value_type
 
typedef momo::internal::TreeDerivedIterator< TreeMapIterator, momo::internal::MapReferenceStd > iterator
 
typedef const_iterator::Reference const_reference
 
typedef iterator::ConstIterator const_iterator
 
typedef internal::map_node_handle< typename TreeMap::ExtractedPair > node_type
 

Public Member Functions

multimap & operator= (std::initializer_list< value_type > values)
 
template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf< std::is_constructible< value_type, ValueArg && >::value, iterator > insert (ValueArg &&valueArg)
 
template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf< std::is_constructible< value_type, ValueArg && >::value, iterator > insert (const_iterator hint, ValueArg &&valueArg)
 
iterator insert (node_type &&node)
 
iterator insert (const_iterator hint, node_type &&node)
 
template<typename Iterator >
void insert (Iterator first, Iterator last)
 
void insert (std::initializer_list< value_type > values)
 
template<typename... ValueArgs>
iterator emplace (ValueArgs &&... valueArgs)
 

Friends

void swap (multimap &left, multimap &right) noexcept
 
template<typename ValueFilter >
size_type erase_if (multimap &cont, const ValueFilter &valueFilter)
 

Detailed Description

template<typename TKey, typename TMapped, typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
class momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >

momo::stdish::multimap is similar to std::multimap, but much more efficient in memory usage. The implementation is based on a B-tree.

Deviations from standard class:

  1. Container items must be movable (preferably without exceptions) or copyable, similar to items of std::vector.
  2. After each addition or removal of the item all iterators and references to items become invalid and should not be used.
  3. Type reference is not the same as value_type&, so for (auto& p : map) is illegal, but for (auto p : map) or for (const auto& p : map) or for (auto&& p : map) is allowed.
  4. Functions begin, cbegin, rend and crend have logarithmic complexity.
  5. If ObjectManager<key_type>::isNothrowAnywayAssignable is false or ObjectManager<mapped_type>::isNothrowAnywayAssignable is false, functions erase can throw exceptions.
  6. Functions merge, extract and insert(node_type&&) move items.

It is allowed to pass to functions insert and emplace references to items within the container.

Function merge can work fast, if container types are same and each key from one container is less than each key from other container.

Member Typedef Documentation

◆ const_iterator

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef iterator::ConstIterator momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::const_iterator

◆ const_reference

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef const_iterator::Reference momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::const_reference

◆ insert_return_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef iterator momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert_return_type

◆ iterator

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef momo::internal::TreeDerivedIterator<TreeMapIterator, momo::internal::MapReferenceStd> momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::iterator

◆ key_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef TKey momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::key_type

◆ mapped_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef TMapped momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::mapped_type

◆ node_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef internal::map_node_handle<typename TreeMap::ExtractedPair> momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::node_type

◆ size_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef size_t momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::size_type

◆ value_type

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
typedef std::pair<const key_type, mapped_type> momo::stdish::internal::map_base< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::value_type

Member Function Documentation

◆ emplace()

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
template<typename... ValueArgs>
iterator momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::emplace ( ValueArgs &&...  valueArgs)
inline

◆ insert() [1/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
iterator momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( const_iterator  hint,
node_type &&  node 
)
inline

◆ insert() [2/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf<std::is_constructible<value_type, ValueArg&&>::value, iterator> momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( const_iterator  hint,
ValueArg &&  valueArg 
)
inline

◆ insert() [3/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
template<typename Iterator >
void momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( Iterator  first,
Iterator  last 
)
inline

◆ insert() [4/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
iterator momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( node_type &&  node)
inline

◆ insert() [5/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
void momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( std::initializer_list< value_type >  values)
inline

◆ insert() [6/6]

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
template<typename ValueArg = std::pair<key_type, mapped_type>>
momo::internal::EnableIf<std::is_constructible<value_type, ValueArg&&>::value, iterator> momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::insert ( ValueArg &&  valueArg)
inline

◆ operator=()

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
multimap& momo::stdish::multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap >::operator= ( std::initializer_list< value_type >  values)
inline

Friends And Related Function Documentation

◆ erase_if

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
template<typename ValueFilter >
size_type erase_if ( multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap > &  cont,
const ValueFilter &  valueFilter 
)
friend

◆ swap

template<typename TKey , typename TMapped , typename TLessComparer = std::less<TKey>, typename TAllocator = std::allocator<std::pair<const TKey, TMapped>>, typename TTreeMap = TreeMap<TKey, TMapped, TreeTraitsStd<TKey, TLessComparer, true>, MemManagerStd<TAllocator>>>
void swap ( multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap > &  left,
multimap< TKey, TMapped, TLessComparer, TAllocator, TTreeMap > &  right 
)
friend
The documentation for this class was generated from the following file: