|
| map (const map &)=default |
|
| map (map &&)=default |
|
| map (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const allocator_type &__a=allocator_type()) |
|
| map (const allocator_type &__a) |
|
| map (const map &__m, const allocator_type &__a) |
|
| map (map &&__m, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__m._M_base()), __a))) |
|
| map (initializer_list< value_type > __l, const allocator_type &__a) |
|
template<typename _InputIterator > |
| map (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
|
| map (const _Base &__x) |
|
| map (const _Compare &__comp, const _Allocator &__a=_Allocator()) |
|
template<typename _InputIterator > |
| map (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator()) |
|
_Base & | _M_base () noexcept |
|
const _Base & | _M_base () const noexcept |
|
void | _M_invalidate_if (_Predicate __pred) |
|
void | _M_swap (_Safe_container &__x) noexcept |
|
void | _M_transfer_from_if (_Safe_sequence &__from, _Predicate __pred) |
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
|
const_iterator | cbegin () const noexcept |
|
const_iterator | cend () const noexcept |
|
void | clear () noexcept |
|
const_reverse_iterator | crbegin () const noexcept |
|
const_reverse_iterator | crend () const noexcept |
|
template<typename... _Args> |
std::pair< iterator, bool > | emplace (_Args &&... __args) |
|
template<typename... _Args> |
iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
|
iterator | end () noexcept |
|
const_iterator | end () const noexcept |
|
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
std::pair< iterator, iterator > | equal_range (const _Kt &__x) |
|
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
std::pair< const_iterator, const_iterator > | equal_range (const _Kt &__x) const |
|
iterator | erase (const_iterator __position) |
|
iterator | erase (iterator __position) |
|
size_type | erase (const key_type &__x) |
|
iterator | erase (const_iterator __first, const_iterator __last) |
|
iterator | find (const key_type &__x) |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
iterator | find (const _Kt &__x) |
|
const_iterator | find (const key_type &__x) const |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
const_iterator | find (const _Kt &__x) const |
|
std::pair< iterator, bool > | insert (const value_type &__x) |
|
std::pair< iterator, bool > | insert (value_type &&__x) |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
std::pair< iterator, bool > | insert (_Pair &&__x) |
|
void | insert (std::initializer_list< value_type > __list) |
|
iterator | insert (const_iterator __position, const value_type &__x) |
|
iterator | insert (const_iterator __position, value_type &&__x) |
|
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> |
iterator | insert (const_iterator __position, _Pair &&__x) |
|
template<typename _InputIterator > |
void | insert (_InputIterator __first, _InputIterator __last) |
|
iterator | lower_bound (const key_type &__x) |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
iterator | lower_bound (const _Kt &__x) |
|
const_iterator | lower_bound (const key_type &__x) const |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
const_iterator | lower_bound (const _Kt &__x) const |
|
map & | operator= (const map &)=default |
|
map & | operator= (map &&)=default |
|
map & | operator= (initializer_list< value_type > __l) |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rbegin () const noexcept |
|
reverse_iterator | rend () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
void | swap (map &__x) noexcept(/*conditional */) |
|
iterator | upper_bound (const key_type &__x) |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
iterator | upper_bound (const _Kt &__x) |
|
const_iterator | upper_bound (const key_type &__x) const |
|
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> |
const_iterator | upper_bound (const _Kt &__x) const |
|
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
class std::__debug::map< _Key, _Tp, _Compare, _Allocator >
Class std::map with safety/checking/debug instrumentation.
Definition at line 44 of file debug/map.h.