ShrinkableMap¶
- template <class Key, class T>
-
class
cppmicroservices::
ShrinkableMap
¶ A std::map style associative container allowing query and removal operations only.
Public Types
-
template<>
usingcontainer_type
= std::map<Key, T>¶
-
template<>
usingiterator
= typename container_type::iterator¶
-
template<>
usingconst_iterator
= typename container_type::const_iterator¶
-
template<>
usingsize_type
= typename container_type::size_type¶
-
template<>
usingkey_type
= typename container_type::key_type¶
-
template<>
usingmapped_type
= typename container_type::mapped_type¶
-
template<>
usingvalue_type
= typename container_type::value_type¶
-
template<>
usingreference
= typename container_type::reference¶
-
template<>
usingconst_reference
= typename container_type::const_reference¶
Public Functions
-
ShrinkableMap
()¶
-
iterator
begin
()¶
-
const_iterator
begin
() const¶
-
iterator
end
()¶
-
const_iterator
end
() const¶
-
void
erase
(iterator pos)¶
-
void
erase
(iterator first, iterator last)¶
-
size_type
erase
(const Key &key)¶
-
bool
empty
() const¶
-
void
clear
()¶
-
size_type
size
() const¶
-
size_type
max_size
() const¶
-
T &
operator[]
(const Key &key)¶ Deprecated since version 3.1.0: This function exists only to maintain backwards compatibility and will be removed in the next major release. Use
at(size_type pos)
instead.
-
T &
at
(const Key &key)¶
-
const T &
at
(const Key &key) const¶
-
size_type
count
(const Key &key) const¶
-
iterator
find
(const Key &key)¶
-
const_iterator
find
(const Key &key) const¶
-
std::pair<iterator, iterator>
equal_range
(const Key &key)¶
-
std::pair<const_iterator, const_iterator>
equal_range
(const Key &key) const¶
-
iterator
lower_bound
(const Key &key)¶
-
const_iterator
lower_bound
(const Key &key) const¶
-
iterator
upper_bound
(const Key &key)¶
-
const_iterator
upper_bound
(const Key &key) const¶
-
template<>