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

#include <map.h>

Inheritance diagram for momo::stdish::map< TKey, TMapped, TLessFunc, TAllocator, TTreeMap >:

Public Types
typedef TKey	key_type

typedef TMapped	mapped_type

typedef size_t	size_type

typedef std::pair< const key_type, mapped_type >	value_type

typedef const_iterator::Reference	const_reference

typedef iterator::ConstIterator	const_iterator

typedef momo::internal::TreeDerivedIterator< TreeMapIterator, momo::internal::MapReferenceStd >	iterator

Public Member Functions
map &	operator= (std::initializer_list< value_type > values)

TreeMap::ValueReferenceRKey	operator[] (key_type &&key)

TreeMap::ValueReferenceCKey	operator[] (const key_type &key)

const mapped_type &	at (const key_type &key) const

mapped_type &	at (const key_type &key)

template<typename... MappedArgs>
std::pair< iterator, bool >	try_emplace (key_type &&key, MappedArgs &&... mappedArgs)

template<typename... MappedArgs>
iterator	try_emplace (const_iterator hint, key_type &&key, MappedArgs &&... mappedArgs)

template<typename... MappedArgs>
std::pair< iterator, bool >	try_emplace (const key_type &key, MappedArgs &&... mappedArgs)

template<typename... MappedArgs>
iterator	try_emplace (const_iterator hint, const key_type &key, MappedArgs &&... mappedArgs)

template<typename MappedArg >
std::pair< iterator, bool >	insert_or_assign (key_type &&key, MappedArg &&mappedArg)

template<typename MappedArg >
iterator	insert_or_assign (const_iterator hint, key_type &&key, MappedArg &&mappedArg)

template<typename MappedArg >
std::pair< iterator, bool >	insert_or_assign (const key_type &key, MappedArg &&mappedArg)

template<typename MappedArg >
iterator	insert_or_assign (const_iterator hint, const key_type &key, MappedArg &&mappedArg)

Friends
void	swap (map &left, map &right) noexcept

template<typename ValueFilter >
size_type	erase_if (map &cont, const ValueFilter &valueFilter)

Detailed Description

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

Deviations from standard class:

Container items must be movable (preferably without exceptions) or copyable, similar to items of std::vector.
After each addition or removal of the item all iterators and references to items become invalid and should not be used.
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.
Functions begin, cbegin, rend and crend have logarithmic complexity.
If ObjectManager<key_type>::isNothrowAnywayAssignable is false or ObjectManager<mapped_type>::isNothrowAnywayAssignable is false, functions erase can throw exceptions.
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.