Home

mpv::bmap

template<
    class _Kty, 
    class _Ty,
    class _KeyPr = std::less<_Kty>,
    class _ValuePr = std::less<_Ty>,
    class _Alloc = std::allocator<std::pair<std::shared_ptr<_Kty>, std::shared_ptr<_Ty>> >
    >
  class bmap 

mpv::bmap is a sorted associative container that contains key-value pairs with unique keys and values. Keys are sorted by using the comparison function _KeyPr, values are sorted by using _ValuePr. Search, removal, and insertion operations are thread-safety. This member functions that explicitly support these operations are efficient, performing them in a time that is on average proportional to the logarithm of the number of elements in the container.

Iterators

begin -- returns an iterator to the beginning

end -- returns an iterator to the end

Capacity

empty -- checks whether the container is empty

size -- returns the number of elements

Modifiers

clear -- clears the contents

insert -- inserts elements

erase -- erases elements

Lookup

find -- finds element with specific key/value