#include <map.h>

Inheritance diagram for std::__debug::map< _Key, _Tp, _Compare, _Allocator >:

Public Types
typedef _Allocator	allocator_type

typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, map >	const_iterator

typedef _Base::const_pointer	const_pointer

typedef _Base::const_reference	const_reference

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

typedef _Base::difference_type	difference_type

using	insert_return_type = _Node_insert_return< iterator, node_type >

typedef __gnu_debug::_Safe_iterator< _Base_iterator, map >	iterator

typedef _Compare	key_compare

typedef _Key	key_type

typedef _Tp	mapped_type

using	node_type = typename _Base::node_type

typedef _Base::pointer	pointer

typedef _Base::reference	reference

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef _Base::size_type	size_type

typedef std::pair< const _Key, _Tp >	value_type

Public Member Functions
	map (_Base_ref __x)

template<typename _InputIterator >
	map (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())

template<typename _InputIterator >
	map (_InputIterator __first, _InputIterator __last, const allocator_type &__a)

	map (const _Compare &__comp, const _Allocator &__a=_Allocator())

	map (const allocator_type &__a)

	map (const map &)=default

	map (const map &__m, const allocator_type &__a)

	map (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const allocator_type &__a=allocator_type())

	map (initializer_list< value_type > __l, const allocator_type &__a)

	map (map &&)=default

	map (map &&__m, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__m._M_base()), __a)))

const _Base &	_M_base () const noexcept

_Base &	_M_base () noexcept

void	_M_swap (_Safe_container &__x) noexcept

const_iterator	begin () const noexcept

iterator	begin () 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)

const_iterator	end () const noexcept

iterator	end () noexcept

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< iterator, iterator >	equal_range (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< const_iterator, const_iterator >	equal_range (const _Kt &__x) const

std::pair< iterator, iterator >	equal_range (const key_type &__x)

std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const

size_type	erase (const key_type &__x)

iterator	erase (const_iterator __first, const_iterator __last)

iterator	erase (const_iterator __position)

_GLIBCXX_ABI_TAG_CXX11 iterator	erase (iterator __position)

node_type	extract (const key_type &__key)

node_type	extract (const_iterator __position)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	find (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	find (const _Kt &__x) const

iterator	find (const key_type &__x)

const_iterator	find (const key_type &__x) const

template<typename _InputIterator >
void	insert (_InputIterator __first, _InputIterator __last)

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
std::pair< iterator, bool >	insert (_Pair &&__x)

std::pair< iterator, bool >	insert (const value_type &__x)

iterator	insert (const_iterator __hint, node_type &&__nh)

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
iterator	insert (const_iterator __position, _Pair &&__x)

iterator	insert (const_iterator __position, const value_type &__x)

iterator	insert (const_iterator __position, value_type &&__x)

insert_return_type	insert (node_type &&__nh)

void	insert (std::initializer_list< value_type > __list)

std::pair< iterator, bool >	insert (value_type &&__x)

template<typename _Obj >
std::pair< iterator, bool >	insert_or_assign (const key_type &__k, _Obj &&__obj)

template<typename _Obj >
iterator	insert_or_assign (const_iterator __hint, const key_type &__k, _Obj &&__obj)

template<typename _Obj >
iterator	insert_or_assign (const_iterator __hint, key_type &&__k, _Obj &&__obj)

template<typename _Obj >
std::pair< iterator, bool >	insert_or_assign (key_type &&__k, _Obj &&__obj)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	lower_bound (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	lower_bound (const _Kt &__x) const

iterator	lower_bound (const key_type &__x)

const_iterator	lower_bound (const key_type &__x) const

map &	operator= (const map &)=default

map &	operator= (initializer_list< value_type > __l)

map &	operator= (map &&)=default

const_reverse_iterator	rbegin () const noexcept

reverse_iterator	rbegin () noexcept

const_reverse_iterator	rend () const noexcept

reverse_iterator	rend () noexcept

void	swap (map &__x) noexcept(/conditional /)

template<typename... _Args>
pair< iterator, bool >	try_emplace (const key_type &__k, _Args &&... __args)

template<typename... _Args>
iterator	try_emplace (const_iterator __hint, const key_type &__k, _Args &&... __args)

template<typename... _Args>
iterator	try_emplace (const_iterator __hint, key_type &&__k, _Args &&... __args)

template<typename... _Args>
pair< iterator, bool >	try_emplace (key_type &&__k, _Args &&... __args)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	upper_bound (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	upper_bound (const _Kt &__x) const

iterator	upper_bound (const key_type &__x)

const_iterator	upper_bound (const key_type &__x) const

Protected Member Functions
_Safe_container &	_M_safe () noexcept

Friends
template<typename _ItT , typename _SeqT , typename _CatT >
class	::__gnu_debug::_Safe_iterator

Detailed Description

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 map.h.

Member Typedef Documentation

◆ allocator_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Allocator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::allocator_type

Definition at line 78 of file map.h.

◆ const_iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef __gnu_debug::_Safe_iterator<_Base_const_iterator, map> std::__debug::map< _Key, _Tp, _Compare, _Allocator >::const_iterator

Definition at line 85 of file map.h.

◆ const_pointer

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::const_pointer std::__debug::map< _Key, _Tp, _Compare, _Allocator >::const_pointer

Definition at line 90 of file map.h.

◆ const_reference

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::const_reference std::__debug::map< _Key, _Tp, _Compare, _Allocator >::const_reference

Definition at line 80 of file map.h.

◆ const_reverse_iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef std::reverse_iterator<const_iterator> std::__debug::map< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator

Definition at line 92 of file map.h.

◆ difference_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::difference_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::difference_type

Definition at line 88 of file map.h.

◆ insert_return_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

using std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert_return_type = _Node_insert_return<iterator, node_type>

Definition at line 449 of file map.h.

◆ iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef __gnu_debug::_Safe_iterator<_Base_iterator, map> std::__debug::map< _Key, _Tp, _Compare, _Allocator >::iterator

Definition at line 83 of file map.h.

◆ key_compare

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Compare std::__debug::map< _Key, _Tp, _Compare, _Allocator >::key_compare

Definition at line 77 of file map.h.

◆ key_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Key std::__debug::map< _Key, _Tp, _Compare, _Allocator >::key_type

Definition at line 74 of file map.h.

◆ mapped_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Tp std::__debug::map< _Key, _Tp, _Compare, _Allocator >::mapped_type

Definition at line 75 of file map.h.

◆ node_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

using std::__debug::map< _Key, _Tp, _Compare, _Allocator >::node_type = typename _Base::node_type

Definition at line 448 of file map.h.

◆ pointer

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::pointer std::__debug::map< _Key, _Tp, _Compare, _Allocator >::pointer

Definition at line 89 of file map.h.

◆ reference

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::reference std::__debug::map< _Key, _Tp, _Compare, _Allocator >::reference

Definition at line 79 of file map.h.

◆ reverse_iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef std::reverse_iterator<iterator> std::__debug::map< _Key, _Tp, _Compare, _Allocator >::reverse_iterator

Definition at line 91 of file map.h.

◆ size_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef _Base::size_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::size_type

Definition at line 87 of file map.h.

◆ value_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

typedef std::pair<const _Key, _Tp> std::__debug::map< _Key, _Tp, _Compare, _Allocator >::value_type

Definition at line 76 of file map.h.

Constructor & Destructor Documentation

◆ map() [1/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	initializer_list< value_type >	__l,
		const _Compare &	__c = `_Compare()`,
		const allocator_type &	__a = `allocator_type()`
	)

inline

Definition at line 108 of file map.h.

◆ map() [2/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map ( const allocator_type & __a )

inlineexplicit

Definition at line 114 of file map.h.

◆ map() [3/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	const map< _Key, _Tp, _Compare, _Allocator > &	__m,
		const allocator_type &	__a
	)

inline

Definition at line 117 of file map.h.

◆ map() [4/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	map< _Key, _Tp, _Compare, _Allocator > &&	__m,
		const allocator_type &	__a
	)

inlinenoexcept

Definition at line 120 of file map.h.

◆ map() [5/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	initializer_list< value_type >	__l,
		const allocator_type &	__a
	)

inline

Definition at line 125 of file map.h.

◆ map() [6/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _InputIterator >

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	_InputIterator	__first,
		_InputIterator	__last,
		const allocator_type &	__a
	)

inline

Definition at line 129 of file map.h.

◆ map() [7/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map ( _Base_ref __x )

inline

Definition at line 139 of file map.h.

◆ map() [8/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	const _Compare &	__comp,
		const _Allocator &	__a = `_Allocator()`
	)

inlineexplicit

Definition at line 142 of file map.h.

◆ map() [9/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _InputIterator >

std::__debug::map< _Key, _Tp, _Compare, _Allocator >::map	(	_InputIterator	__first,
		_InputIterator	__last,
		const _Compare &	__comp = `_Compare()`,
		const _Allocator &	__a = `_Allocator()`
	)

inline

Definition at line 147 of file map.h.

Member Function Documentation

◆ _M_base() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const _Base & std::__debug::map< _Key, _Tp, _Compare, _Allocator >::_M_base ( ) const

inlinenoexcept

Definition at line 708 of file map.h.

◆ _M_base() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

_Base & std::__debug::map< _Key, _Tp, _Compare, _Allocator >::_M_base ( )

inlinenoexcept

Definition at line 705 of file map.h.

◆ _M_safe()

template<typename _SafeContainer , typename _Alloc , template< typename > class _SafeBase, bool _IsCxx11AllocatorAware = true>

_Safe_container & __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >::_M_safe ( )

inlineprotectednoexceptinherited

Definition at line 52 of file safe_container.h.

◆ _M_swap()

template<typename _SafeContainer , typename _Alloc , template< typename > class _SafeBase, bool _IsCxx11AllocatorAware = true>

void __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >::_M_swap ( _Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x )

inlinenoexceptinherited

Definition at line 111 of file safe_container.h.

◆ begin() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::begin ( ) const

inlinenoexcept

Definition at line 189 of file map.h.

◆ begin() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::begin ( )

inlinenoexcept

Definition at line 185 of file map.h.

◆ cbegin()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::cbegin ( ) const

inlinenoexcept

Definition at line 218 of file map.h.

◆ cend()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::cend ( ) const

inlinenoexcept

Definition at line 222 of file map.h.

◆ clear()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

void std::__debug::map< _Key, _Tp, _Compare, _Allocator >::clear ( )

inlinenoexcept

Definition at line 571 of file map.h.

◆ crbegin()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::crbegin ( ) const

inlinenoexcept

Definition at line 226 of file map.h.

◆ crend()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::crend ( ) const

inlinenoexcept

Definition at line 230 of file map.h.

◆ emplace()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::emplace ( _Args &&... __args )

inline

Definition at line 250 of file map.h.

◆ emplace_hint()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::emplace_hint	(	const_iterator	__pos,
		_Args &&...	__args
	)

inline

Definition at line 258 of file map.h.

◆ end() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::end ( ) const

inlinenoexcept

Definition at line 197 of file map.h.

◆ end() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::end ( )

inlinenoexcept

Definition at line 193 of file map.h.

◆ equal_range() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

std::pair< iterator, iterator > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const _Kt & __x )

inline

Definition at line 676 of file map.h.

◆ equal_range() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

std::pair< const_iterator, const_iterator > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const _Kt & __x ) const

inline

Definition at line 697 of file map.h.

◆ equal_range() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::pair< iterator, iterator > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const key_type & __x )

inline

Definition at line 663 of file map.h.

◆ equal_range() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::pair< const_iterator, const_iterator > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const key_type & __x ) const

inline

Definition at line 684 of file map.h.

◆ erase() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

size_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase ( const key_type & __x )

inline

Definition at line 510 of file map.h.

◆ erase() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase	(	const_iterator	__first,
		const_iterator	__last
	)

inline

Definition at line 525 of file map.h.

◆ erase() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase ( const_iterator __position )

inline

Definition at line 488 of file map.h.

◆ erase() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

_GLIBCXX_ABI_TAG_CXX11 iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase ( iterator __position )

inline

Definition at line 497 of file map.h.

◆ extract() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

node_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::extract ( const key_type & __key )

inline

Definition at line 460 of file map.h.

◆ extract() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

node_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::extract ( const_iterator __position )

inline

Definition at line 452 of file map.h.

◆ find() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::find ( const _Kt & __x )

inline

Definition at line 591 of file map.h.

◆ find() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::find ( const _Kt & __x ) const

inline

Definition at line 604 of file map.h.

◆ find() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::find ( const key_type & __x )

inline

Definition at line 583 of file map.h.

◆ find() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::find ( const key_type & __x ) const

inline

Definition at line 596 of file map.h.

◆ insert() [1/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _InputIterator >

void std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert	(	_InputIterator	__first,
		_InputIterator	__last
	)

inline

Definition at line 342 of file map.h.

◆ insert() [2/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert ( _Pair && __x )

inline

Definition at line 291 of file map.h.

◆ insert() [3/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert ( const value_type & __x )

inline

Definition at line 270 of file map.h.

◆ insert() [4/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert	(	const_iterator	__hint,
		node_type &&	__nh
	)

inline

Definition at line 477 of file map.h.

◆ insert() [5/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert	(	const_iterator	__position,
		_Pair &&	__x
	)

inline

Definition at line 329 of file map.h.

◆ insert() [6/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert	(	const_iterator	__position,
		const value_type &	__x
	)

inline

Definition at line 306 of file map.h.

◆ insert() [7/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert	(	const_iterator	__position,
		value_type &&	__x
	)

inline

Definition at line 319 of file map.h.

◆ insert() [8/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

insert_return_type std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert ( node_type && __nh )

inline

Definition at line 469 of file map.h.

◆ insert() [9/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

void std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert ( std::initializer_list< value_type > __list )

inline

Definition at line 300 of file map.h.

◆ insert() [10/10]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert ( value_type && __x )

inline

Definition at line 281 of file map.h.

◆ insert_or_assign() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Obj >

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert_or_assign	(	const key_type &	__k,
		_Obj &&	__obj
	)

inline

Definition at line 403 of file map.h.

◆ insert_or_assign() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Obj >

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert_or_assign	(	const_iterator	__hint,
		const key_type &	__k,
		_Obj &&	__obj
	)

inline

Definition at line 421 of file map.h.

◆ insert_or_assign() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Obj >

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert_or_assign	(	const_iterator	__hint,
		key_type &&	__k,
		_Obj &&	__obj
	)

inline

Definition at line 435 of file map.h.

◆ insert_or_assign() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Obj >

std::pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert_or_assign	(	key_type &&	__k,
		_Obj &&	__obj
	)

inline

Definition at line 412 of file map.h.

◆ lower_bound() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const _Kt & __x )

inline

Definition at line 619 of file map.h.

◆ lower_bound() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const _Kt & __x ) const

inline

Definition at line 632 of file map.h.

◆ lower_bound() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const key_type & __x )

inline

Definition at line 611 of file map.h.

◆ lower_bound() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const key_type & __x ) const

inline

Definition at line 624 of file map.h.

◆ operator=()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

map & std::__debug::map< _Key, _Tp, _Compare, _Allocator >::operator= ( initializer_list< value_type > __l )

inline

Definition at line 171 of file map.h.

◆ rbegin() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rbegin ( ) const

inlinenoexcept

Definition at line 205 of file map.h.

◆ rbegin() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rbegin ( )

inlinenoexcept

Definition at line 201 of file map.h.

◆ rend() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rend ( ) const

inlinenoexcept

Definition at line 213 of file map.h.

◆ rend() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

reverse_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rend ( )

inlinenoexcept

Definition at line 209 of file map.h.

◆ swap()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

void std::__debug::map< _Key, _Tp, _Compare, _Allocator >::swap ( map< _Key, _Tp, _Compare, _Allocator > & __x )

inlinenoexcept

Definition at line 563 of file map.h.

◆ try_emplace() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::try_emplace	(	const key_type &	__k,
		_Args &&...	__args
	)

inline

Definition at line 358 of file map.h.

◆ try_emplace() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::try_emplace	(	const_iterator	__hint,
		const key_type &	__k,
		_Args &&...	__args
	)

inline

Definition at line 376 of file map.h.

◆ try_emplace() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::try_emplace	(	const_iterator	__hint,
		key_type &&	__k,
		_Args &&...	__args
	)

inline

Definition at line 390 of file map.h.

◆ try_emplace() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename... _Args>

pair< iterator, bool > std::__debug::map< _Key, _Tp, _Compare, _Allocator >::try_emplace	(	key_type &&	__k,
		_Args &&...	__args
	)

inline

Definition at line 367 of file map.h.

◆ upper_bound() [1/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const _Kt & __x )

inline

Definition at line 645 of file map.h.

◆ upper_bound() [2/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const _Kt & __x ) const

inline

Definition at line 658 of file map.h.

◆ upper_bound() [3/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const key_type & __x )

inline

Definition at line 637 of file map.h.

◆ upper_bound() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

const_iterator std::__debug::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const key_type & __x ) const

inline

Definition at line 650 of file map.h.

Friends And Related Symbol Documentation

◆ ::__gnu_debug::_Safe_iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>

template<typename _ItT , typename _SeqT , typename _CatT >

friend class ::__gnu_debug::_Safe_iterator

friend

Definition at line 60 of file map.h.

The documentation for this class was generated from the following file:

map.h

Public Types

Public Member Functions

Protected Member Functions

Friends

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ insert_return_type

◆ iterator

◆ key_compare

◆ key_type

◆ mapped_type

◆ node_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ map() [1/9]

◆ map() [2/9]

◆ map() [3/9]

◆ map() [4/9]

◆ map() [5/9]

◆ map() [6/9]

◆ map() [7/9]

◆ map() [8/9]

◆ map() [9/9]

Member Function Documentation

◆ _M_base() [1/2]

◆ _M_base() [2/2]

◆ _M_safe()

◆ _M_swap()

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ crbegin()

◆ crend()

◆ emplace()

◆ emplace_hint()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/4]

◆ equal_range() [2/4]

◆ equal_range() [3/4]

◆ equal_range() [4/4]

◆ erase() [1/4]

◆ erase() [2/4]

◆ erase() [3/4]

◆ erase() [4/4]

◆ extract() [1/2]

◆ extract() [2/2]

◆ find() [1/4]

◆ find() [2/4]

◆ find() [3/4]

◆ find() [4/4]

◆ insert() [1/10]

◆ insert() [2/10]

◆ insert() [3/10]

◆ insert() [4/10]

◆ insert() [5/10]

◆ insert() [6/10]

◆ insert() [7/10]

◆ insert() [8/10]

◆ insert() [9/10]

◆ insert() [10/10]

◆ insert_or_assign() [1/4]

◆ insert_or_assign() [2/4]

◆ insert_or_assign() [3/4]

◆ insert_or_assign() [4/4]

◆ lower_bound() [1/4]

◆ lower_bound() [2/4]

◆ lower_bound() [3/4]