libstdc++
std::__profile::map< _Key, _Tp, _Compare, _Allocator > Class Template Reference

#include <map.h>

Inherits map< _Key, _Tp, std::less< _Key >, std::allocator< std::pair< const _Key, _Tp > > >, and std::__profile::_Ordered_profile< _Cont >.

Public Types

typedef __iterator_tracker< _Base_const_iterator, mapconst_iterator
 
typedef _Base::const_reference const_reference
 
typedef std::reverse_iterator< const_iterator > const_reverse_iterator
 
typedef _Base::difference_type difference_type
 
typedef __iterator_tracker< _Base_iterator, mapiterator
 
typedef _Compare key_compare
 
typedef _Key key_type
 
typedef _Tp mapped_type
 
typedef _Base::reference reference
 
typedef std::reverse_iterator< iterator > reverse_iterator
 
typedef _Base::size_type size_type
 
typedef _Base::value_type value_type
 

Public Member Functions

template<typename _InputIterator >
 map (_InputIterator __first, _InputIterator __last, const _Allocator &__a)
 
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>>
 map (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())
 
 map (const _Allocator &__a)
 
 map (const _Base &__x)
 
 map (const _Compare &__comp, const _Allocator &__a=_Allocator())
 
 map (const map &)=default
 
 map (const map &__x, const _Allocator &__a)
 
 map (initializer_list< value_type > __l, const _Allocator &__a)
 
 map (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const _Allocator &__a=_Allocator())
 
 map (map &&)=default
 
 map (map &&__x, const _Allocator &__a) noexcept(noexcept(_Base(std::move(__x), __a)))
 
const _Base_M_base () const noexcept
 
_Base_M_base () noexcept
 
void _M_profile_iterate (int __rewind=0) const
 
mapped_type & at (const key_type &__k)
 
const mapped_type & at (const key_type &__k) const
 
const_iterator begin () const noexcept
 
iterator begin () noexcept
 
const_iterator cbegin () const noexcept
 
const_iterator cend () const noexcept
 
void clear () noexcept
 
template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
size_type count (const _Kt &__x) const
 
size_type count (const key_type &__x) const
 
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 __pos)
 
iterator erase (iterator __pos)
 
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)
 
template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
iterator insert (const_iterator __pos, _Pair &&__x)
 
iterator insert (const_iterator __pos, const value_type &__x)
 
void insert (std::initializer_list< value_type > __list)
 
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
 
mapoperator= (const map &)=default
 
mapoperator= (initializer_list< value_type > __l)
 
mapoperator= (map &&)=default
 
mapped_type & operator[] (const key_type &__k)
 
mapped_type & operator[] (key_type &&__k)
 
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 _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

void _M_profile_construct () noexcept
 
void _M_profile_destruct () noexcept
 
void _M_swap (_Ordered_profile &__other)
 

Protected Attributes

__gnu_profile::__map2umap_info_M_map2umap_info
 

Friends

template<typename _K1 , typename _T1 , typename _C1 , typename _A1 >
bool operator< (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &)
 
template<typename _K1 , typename _T1 , typename _C1 , typename _A1 >
bool operator== (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &)
 

Detailed Description

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

Class std::map wrapper with performance instrumentation.

Definition at line 41 of file profile/map.h.

Member Typedef Documentation

◆ const_iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef __iterator_tracker<_Base_const_iterator, map> std::__profile::map< _Key, _Tp, _Compare, _Allocator >::const_iterator

Definition at line 61 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::const_reference

Definition at line 57 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator

Definition at line 63 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::difference_type

Definition at line 66 of file profile/map.h.

◆ iterator

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef __iterator_tracker<_Base_iterator, map> std::__profile::map< _Key, _Tp, _Compare, _Allocator >::iterator

Definition at line 59 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::key_compare

Definition at line 55 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::key_type

Definition at line 52 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::mapped_type

Definition at line 53 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::reference

Definition at line 56 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::reverse_iterator

Definition at line 62 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::size_type

Definition at line 65 of file profile/map.h.

◆ value_type

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Base::value_type std::__profile::map< _Key, _Tp, _Compare, _Allocator >::value_type

Definition at line 54 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( const _Compare &  __comp,
const _Allocator &  __a = _Allocator() 
)
inlineexplicit

Definition at line 85 of file profile/map.h.

◆ map() [2/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>>
std::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( _InputIterator  __first,
_InputIterator  __last,
const _Compare &  __comp = _Compare(),
const _Allocator &  __a = _Allocator() 
)
inline

Definition at line 95 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( const _Base __x)
inline

Definition at line 100 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( initializer_list< value_type >  __l,
const _Compare &  __c = _Compare(),
const _Allocator &  __a = _Allocator() 
)
inline

Definition at line 104 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( const _Allocator &  __a)
inlineexplicit

Definition at line 110 of file profile/map.h.

◆ map() [6/9]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
std::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( const map< _Key, _Tp, _Compare, _Allocator > &  __x,
const _Allocator &  __a 
)
inline

Definition at line 113 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( map< _Key, _Tp, _Compare, _Allocator > &&  __x,
const _Allocator &  __a 
)
inlinenoexcept

Definition at line 116 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( initializer_list< value_type >  __l,
const _Allocator &  __a 
)
inline

Definition at line 120 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::map ( _InputIterator  __first,
_InputIterator  __last,
const _Allocator &  __a 
)
inline

Definition at line 124 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::_M_base ( ) const
inlinenoexcept

Definition at line 614 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::_M_base ( )
inlinenoexcept

Definition at line 611 of file profile/map.h.

◆ _M_profile_construct()

template<typename _Cont >
void std::__profile::_Ordered_profile< _Cont >::_M_profile_construct ( )
inlineprotectednoexceptinherited

Definition at line 75 of file ordered_base.h.

◆ _M_profile_destruct()

template<typename _Cont >
void std::__profile::_Ordered_profile< _Cont >::_M_profile_destruct ( )
inlineprotectednoexceptinherited

Definition at line 79 of file ordered_base.h.

◆ _M_profile_iterate()

template<typename _Cont >
void std::__profile::_Ordered_profile< _Cont >::_M_profile_iterate ( int  __rewind = 0) const
inlineinherited

Definition at line 40 of file ordered_base.h.

◆ _M_swap()

template<typename _Cont >
void std::__profile::_Ordered_profile< _Cont >::_M_swap ( _Ordered_profile< _Cont > &  __other)
inlineprotectedinherited

Definition at line 86 of file ordered_base.h.

◆ at() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
mapped_type & std::__profile::map< _Key, _Tp, _Compare, _Allocator >::at ( const key_type &  __k)
inline

Definition at line 244 of file profile/map.h.

◆ at() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const mapped_type & std::__profile::map< _Key, _Tp, _Compare, _Allocator >::at ( const key_type &  __k) const
inline

Definition at line 251 of file profile/map.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::__profile::map< _Key, _Tp, _Compare, _Allocator >::begin ( ) const
inlinenoexcept

Definition at line 161 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::begin ( )
inlinenoexcept

Definition at line 157 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::cbegin ( ) const
inlinenoexcept

Definition at line 174 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::cend ( ) const
inlinenoexcept

Definition at line 178 of file profile/map.h.

◆ clear()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void std::__profile::map< _Key, _Tp, _Compare, _Allocator >::clear ( )
inlinenoexcept

Definition at line 415 of file profile/map.h.

◆ count() [1/2]

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>
size_type std::__profile::map< _Key, _Tp, _Compare, _Allocator >::count ( const _Kt &  __x) const
inline

Definition at line 473 of file profile/map.h.

◆ count() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
size_type std::__profile::map< _Key, _Tp, _Compare, _Allocator >::count ( const key_type &  __x) const
inline

Definition at line 462 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::crbegin ( ) const
inlinenoexcept

Definition at line 212 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::crend ( ) const
inlinenoexcept

Definition at line 219 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::emplace ( _Args &&...  __args)
inline

Definition at line 261 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::emplace_hint ( const_iterator  __pos,
_Args &&...  __args 
)
inline

Definition at line 273 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::end ( ) const
inlinenoexcept

Definition at line 169 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::end ( )
inlinenoexcept

Definition at line 165 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const _Kt &  __x)
inline

Definition at line 579 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const _Kt &  __x) const
inline

Definition at line 602 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const key_type &  __x)
inline

Definition at line 565 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::equal_range ( const key_type &  __x) const
inline

Definition at line 588 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::erase ( const key_type &  __x)
inline

Definition at line 376 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::erase ( const_iterator  __first,
const_iterator  __last 
)
inline

Definition at line 385 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::erase ( const_iterator  __pos)
inline

Definition at line 354 of file profile/map.h.

◆ erase() [4/4]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator std::__profile::map< _Key, _Tp, _Compare, _Allocator >::erase ( iterator  __pos)
inline

Definition at line 361 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::find ( const _Kt &  __x)
inline

Definition at line 435 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::find ( const _Kt &  __x) const
inline

Definition at line 454 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::find ( const key_type &  __x)
inline

Definition at line 424 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::find ( const key_type &  __x) const
inline

Definition at line 443 of file profile/map.h.

◆ insert() [1/6]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _InputIterator >
void std::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( _InputIterator  __first,
_InputIterator  __last 
)
inline

Definition at line 346 of file profile/map.h.

◆ insert() [2/6]

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::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( _Pair &&  __x)
inline

Definition at line 298 of file profile/map.h.

◆ insert() [3/6]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
std::pair< iterator, bool > std::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( const value_type &  __x)
inline

Definition at line 285 of file profile/map.h.

◆ insert() [4/6]

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::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( const_iterator  __pos,
_Pair &&  __x 
)
inline

Definition at line 333 of file profile/map.h.

◆ insert() [5/6]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator std::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( const_iterator  __pos,
const value_type &  __x 
)
inline

Definition at line 315 of file profile/map.h.

◆ insert() [6/6]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void std::__profile::map< _Key, _Tp, _Compare, _Allocator >::insert ( std::initializer_list< value_type >  __list)
inline

Definition at line 309 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const _Kt &  __x)
inline

Definition at line 493 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const _Kt &  __x) const
inline

Definition at line 514 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const key_type &  __x)
inline

Definition at line 481 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::lower_bound ( const key_type &  __x) const
inline

Definition at line 502 of file profile/map.h.

◆ operator=()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
map & std::__profile::map< _Key, _Tp, _Compare, _Allocator >::operator= ( initializer_list< value_type >  __l)
inline

Definition at line 146 of file profile/map.h.

◆ operator[]() [1/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
mapped_type & std::__profile::map< _Key, _Tp, _Compare, _Allocator >::operator[] ( const key_type &  __k)
inline

Definition at line 228 of file profile/map.h.

◆ operator[]() [2/2]

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
mapped_type & std::__profile::map< _Key, _Tp, _Compare, _Allocator >::operator[] ( key_type &&  __k)
inline

Definition at line 236 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::rbegin ( ) const
inlinenoexcept

Definition at line 190 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::rbegin ( )
inlinenoexcept

Definition at line 183 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::rend ( ) const
inlinenoexcept

Definition at line 204 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::rend ( )
inlinenoexcept

Definition at line 197 of file profile/map.h.

◆ swap()

template<typename _Key , typename _Tp , typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void std::__profile::map< _Key, _Tp, _Compare, _Allocator >::swap ( map< _Key, _Tp, _Compare, _Allocator > &  __x)
inlinenoexcept

Definition at line 407 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const _Kt &  __x)
inline

Definition at line 535 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const _Kt &  __x) const
inline

Definition at line 556 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const key_type &  __x)
inline

Definition at line 523 of file profile/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::__profile::map< _Key, _Tp, _Compare, _Allocator >::upper_bound ( const key_type &  __x) const
inline

Definition at line 544 of file profile/map.h.

Member Data Documentation

◆ _M_map2umap_info

template<typename _Cont >
__gnu_profile::__map2umap_info* std::__profile::_Ordered_profile< _Cont >::_M_map2umap_info
protectedinherited

Definition at line 89 of file ordered_base.h.


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