STLdoc
STLdocumentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Public Types | Public Member Functions | List of all members
multimap< _Kty, _Ty, _Pr, _Alloc > Class Template Reference
Inheritance diagram for multimap< _Kty, _Ty, _Pr, _Alloc >:
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Tree_comp< !is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare >::value, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Tree_buy< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > _Tree_alloc<!is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::value, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > > _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types > _Container_base0

Public Types

typedef multimap< _Kty, _Ty, _Pr, _Alloc_Myt
 
typedef _Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
 
typedef _Kty key_type
 
typedef _Ty mapped_type
 
typedef _Ty referent_type
 
typedef _Pr key_compare
 
typedef _Mybase::value_compare value_compare
 
typedef _Mybase::allocator_type allocator_type
 
typedef _Mybase::size_type size_type
 
typedef _Mybase::difference_type difference_type
 
typedef _Mybase::pointer pointer
 
typedef _Mybase::const_pointer const_pointer
 
typedef _Mybase::reference reference
 
typedef _Mybase::const_reference const_reference
 
typedef _Mybase::iterator iterator
 
typedef _Mybase::const_iterator const_iterator
 
typedef _Mybase::reverse_iterator reverse_iterator
 
typedef _Mybase::const_reverse_iterator const_reverse_iterator
 
typedef _Mybase::value_type value_type
 
- Public Types inherited from _Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
enum  
 
typedef _Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Myt
 
typedef _Tree_comp< !is_empty< typename _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare >::value, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
 
typedef _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_type key_type
 
typedef _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_compare value_compare
 
typedef _Mybase::_Node _Node
 
typedef _Mybase::_Nodeptr _Nodeptr
 
typedef _Mybase::_Alty _Alty
 
typedef _Mybase::key_compare key_compare
 
typedef _Mybase::allocator_type allocator_type
 
typedef _Mybase::value_type value_type
 
typedef _Mybase::size_type size_type
 
typedef _Mybase::difference_type difference_type
 
typedef _Mybase::pointer pointer
 
typedef _Mybase::const_pointer const_pointer
 
typedef _Mybase::reference reference
 
typedef _Mybase::const_reference const_reference
 
typedef _Mybase::const_iterator const_iterator
 
typedef _If< is_same< key_type, value_type >::value, typename _Mybase::const_iterator, typename _Mybase::iterator >::type iterator
 
typedef _STD reverse_iterator< iteratorreverse_iterator
 
typedef _STD reverse_iterator< const_iteratorconst_reverse_iterator
 
typedef pair< iterator, bool_Pairib
 
typedef pair< iterator, iterator_Pairii
 
typedef pair< const_iterator, const_iterator_Paircc
 
- Public Types inherited from _Tree_comp< !is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare >::value, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
typedef _Tree_comp< _Pr_has_storage, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Myt
 
typedef _Tree_buy< typename _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, typename _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type_Mybase
 
typedef _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type allocator_type
 
typedef _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare key_compare
 
- Public Types inherited from _Tree_buy< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >
typedef _Tree_alloc<!is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::value, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > > _Mybase
 
typedef _Mybase::_Alty _Alty
 
typedef _Mybase::_Nodeptr _Nodeptr
 
typedef _Mybase::value_type value_type
 
- Public Types inherited from _Tree_alloc<!is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::value, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > >
typedef _Tree_alloc< _Al_has_storage, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > > _Myt
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Alloc _Alloc
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Alnod_type _Alty
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Node _Node
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Nodeptr _Nodeptr
 
- Public Types inherited from _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types >
enum  _Redbl
 
typedef _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types > _Myt
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::_Nodeptr _Nodeptr
 
typedef _Nodeptr_Nodepref
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::value_type value_type
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::size_type size_type
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::difference_type difference_type
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::pointer pointer
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::const_pointer const_pointer
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::reference reference
 
typedef _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types::const_reference const_reference
 
typedef _Tree_const_iterator< _Mytconst_iterator
 
typedef _Tree_iterator< _Mytiterator
 

Public Member Functions

 multimap ()
 
 multimap (const allocator_type &_Al)
 
 multimap (const _Myt &_Right)
 
 multimap (const _Myt &_Right, const allocator_type &_Al)
 
 multimap (const key_compare &_Pred)
 
 multimap (const key_compare &_Pred, const allocator_type &_Al)
 
template<class _Iter >
 multimap (_Iter _First, _Iter _Last)
 
template<class _Iter >
 multimap (_Iter _First, _Iter _Last, const key_compare &_Pred)
 
template<class _Iter >
 multimap (_Iter _First, _Iter _Last, const key_compare &_Pred, const allocator_type &_Al)
 
_Mytoperator= (const _Myt &_Right)
 
 multimap (_Myt &&_Right)
 
 multimap (_Myt &&_Right, const allocator_type &_Al)
 
_Mytoperator= (_Myt &&_Right)
 
template<class _Valty >
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert (_Valty &&_Val)
 
template<class _Valty >
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert (const_iterator _Where, _Valty &&_Val)
 
template<class... _Valty>
iterator emplace (_Valty &&..._Val)
 
void swap (_Myt &_Right)
 
 multimap (_XSTD initializer_list< value_type > _Ilist)
 
 multimap (_XSTD initializer_list< value_type > _Ilist, const key_compare &_Pred)
 
 multimap (_XSTD initializer_list< value_type > _Ilist, const key_compare &_Pred, const allocator_type &_Al)
 
_Mytoperator= (_XSTD initializer_list< value_type > _Ilist)
 
void insert (_XSTD initializer_list< value_type > _Ilist)
 
iterator insert (const value_type &_Val)
 
iterator insert (const_iterator _Where, const value_type &_Val)
 
template<class _Iter >
void insert (_Iter _First, _Iter _Last)
 
- Public Member Functions inherited from _Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
 _Tree (const key_compare &_Parg, const allocator_type &_Al)
 
 _Tree (const value_type *_First, const value_type *_Last, const key_compare &_Parg, const allocator_type &_Al)
 
 _Tree (const _Myt &_Right, const allocator_type &_Al)
 
 _Tree (_Myt &&_Right)
 
 _Tree (_Myt &&_Right, const allocator_type &_Al)
 
_Mytoperator= (_Myt &&_Right)
 
_Mytoperator= (const _Myt &_Right)
 
void _Assign_rv (_Myt &&_Right, true_type)
 
void _Assign_rv (_Myt &&_Right, false_type)
 
void _Assign_rv (_Myt &&_Right)
 
_Pairib insert (value_type &&_Val)
 
iterator insert (const_iterator _Where, value_type &&_Val)
 
enable_if< is_convertible< _Valty, value_type >::value, _Pairib >::type insert (_Valty &&_Val)
 
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert (const_iterator _Where, _Valty &&_Val)
 
_Pairib insert (const value_type &_Val)
 
iterator insert (const_iterator _Where, const value_type &_Val)
 
void insert (_Iter _First, _Iter _Last)
 
void insert (_XSTD initializer_list< value_type > _Ilist)
 
_Pairib emplace (_Valty &&..._Val)
 
iterator emplace_hint (const_iterator _Where, _Valty &&..._Val)
 
 ~_Tree () _NOEXCEPT
 
iterator begin () _NOEXCEPT
 
const_iterator begin () const _NOEXCEPT
 
iterator end () _NOEXCEPT
 
const_iterator end () const _NOEXCEPT
 
reverse_iterator rbegin () _NOEXCEPT
 
const_reverse_iterator rbegin () const _NOEXCEPT
 
reverse_iterator rend () _NOEXCEPT
 
const_reverse_iterator rend () const _NOEXCEPT
 
const_iterator cbegin () const _NOEXCEPT
 
const_iterator cend () const _NOEXCEPT
 
const_reverse_iterator crbegin () const _NOEXCEPT
 
const_reverse_iterator crend () const _NOEXCEPT
 
size_type size () const _NOEXCEPT
 
size_type max_size () const _NOEXCEPT
 
bool empty () const _NOEXCEPT
 
allocator_type get_allocator () const _NOEXCEPT
 
key_compare key_comp () const
 
value_compare value_comp () const
 
iterator erase (const_iterator _Where)
 
iterator erase (const_iterator _First, const_iterator _Last)
 
size_type erase (const key_type &_Keyval)
 
void clear () _NOEXCEPT
 
iterator find (const key_type &_Keyval)
 
const_iterator find (const key_type &_Keyval) const
 
size_type count (const key_type &_Keyval) const
 
iterator lower_bound (const key_type &_Keyval)
 
const_iterator lower_bound (const key_type &_Keyval) const
 
iterator upper_bound (const key_type &_Keyval)
 
const_iterator upper_bound (const key_type &_Keyval) const
 
_Pairii equal_range (const key_type &_Keyval)
 
_Paircc equal_range (const key_type &_Keyval) const
 
void swap (_Myt &_Right)
 
- Public Member Functions inherited from _Tree_comp< !is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare >::value, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
 _Tree_comp (const key_compare &_Parg, const allocator_type &_Al)
 
key_compare_Getcomp ()
 
const key_compare_Getcomp () const
 
void _Setcomp (const key_compare &_Right)
 
void _Swapcomp (key_compare &_Right)
 
- Public Member Functions inherited from _Tree_buy< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >
 _Tree_buy (const _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type &_Al=_Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type())
 
_Nodeptr _Buynode0 ()
 
void _Freenode0 (_Nodeptr _Pnode)
 
_Nodeptr _Buynode (_Valty &&..._Val)
 
- Public Member Functions inherited from _Tree_alloc<!is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::value, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > >
 _Tree_alloc (const _Alloc &_Al=_Alloc())
 
 ~_Tree_alloc () _NOEXCEPT
 
void _Change_alloc (const _Alty &_Al)
 
void _Swap_alloc (_Myt &_Right)
 
_Nodeptr _Buyheadnode ()
 
void _Freeheadnode (_Nodeptr _Pnode)
 
_Alty_Getal ()
 
const _Alty_Getal () const
 
- Public Member Functions inherited from _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types >
 _Tree_val ()
 
- Public Member Functions inherited from _Container_base0
void _Orphan_all ()
 
void _Swap_all (_Container_base0 &)
 

Additional Inherited Members

- Static Public Member Functions inherited from _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types >
static char & _Color (_Nodeptr _Pnode)
 
static char & _Isnil (_Nodeptr _Pnode)
 
static _Nodepref _Left (_Nodeptr _Pnode)
 
static _Nodepref _Parent (_Nodeptr _Pnode)
 
static _Nodepref _Right (_Nodeptr _Pnode)
 
static reference _Myval (_Nodeptr _Pnode)
 
static _Nodeptr _Max (_Nodeptr _Pnode)
 
static _Nodeptr _Min (_Nodeptr _Pnode)
 
- Public Attributes inherited from _Tree_comp< !is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::key_compare >::value, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
key_compare comp
 
- Public Attributes inherited from _Tree_alloc<!is_empty< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::value, _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type > >
_Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Alnod_type _Alnod
 
- Public Attributes inherited from _Tree_val< _Tree_base_types< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::value_type, _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true >::allocator_type >::_Val_types >
_Nodeptr _Myhead
 
size_type _Mysize
 
- Protected Member Functions inherited from _Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > >
_Nodeptr _Buynode_if_nil (_Nodeptr _Node, _Valty &&)
 
_Nodeptr _Buynode_if_nil (_Nil, _Valty &&_Val)
 
void _Destroy_if_not_nil (_Nodeptr _Newnode)
 
void _Destroy_if_not_nil (_Nil)
 
iterator _Insert_hint (const_iterator _Where, _Valty &&_Val, _Nodety _Newnode)
 
_Pairib _Insert_nohint (bool _Leftish, _Valty &&_Val, _Nodety _Newnode)
 
iterator _Insert_at (bool _Addleft, _Nodeptr _Wherenode, _Valty &&_Val, _Nodety _Node)
 
void _Copy (const _Myt &_Right, _Moveit _Movefl)
 
_Nodeptr _Copy_or_move (_Nodeptr _Rootnode, _Want_to_move, _Can_move, _Is_set, _Dummy)
 
_Nodeptr _Copy_or_move (_Nodeptr _Rootnode, true_type, true_type, true_type, _Dummy)
 
_Nodeptr _Copy_or_move (_Nodeptr _Rootnode, true_type, true_type, false_type, _Dummy)
 
_Nodeptr _Copy_nodes (_Nodeptr _Rootnode, _Nodeptr _Wherenode, _Moveit _Movefl)
 
_Paircc _Eqrange (const key_type &_Keyval) const
 
_Pairii _Eqrange (const key_type &_Keyval)
 
void _Erase (_Nodeptr _Rootnode)
 
_Nodeptr _Lbound (const key_type &_Keyval) const
 
_Nodeptr _Lbound (const key_type &_Keyval)
 
_Nodeptr_Lmost () const
 
void _Lrotate (_Nodeptr _Wherenode)
 
_Nodeptr_Rmost () const
 
_Nodeptr_Root () const
 
void _Rrotate (_Nodeptr _Wherenode)
 
_Nodeptr _Ubound (const key_type &_Keyval) const
 
_Nodeptr _Ubound (const key_type &_Keyval)
 
void _Tidy ()
 
const key_type_Kfn (const value_type &_Val) const
 
const key_type_Key (_Nodeptr _Pnode) const
 

Member Typedef Documentation

template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Tree<_Tmap_traits<_Kty, _Ty, _Pr, _Alloc, true> > multimap< _Kty, _Ty, _Pr, _Alloc >::_Mybase
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef multimap<_Kty, _Ty, _Pr, _Alloc> multimap< _Kty, _Ty, _Pr, _Alloc >::_Myt
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::allocator_type multimap< _Kty, _Ty, _Pr, _Alloc >::allocator_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_iterator multimap< _Kty, _Ty, _Pr, _Alloc >::const_iterator
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_pointer multimap< _Kty, _Ty, _Pr, _Alloc >::const_pointer
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_reference multimap< _Kty, _Ty, _Pr, _Alloc >::const_reference
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::const_reverse_iterator multimap< _Kty, _Ty, _Pr, _Alloc >::const_reverse_iterator
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::difference_type multimap< _Kty, _Ty, _Pr, _Alloc >::difference_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::iterator multimap< _Kty, _Ty, _Pr, _Alloc >::iterator
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Pr multimap< _Kty, _Ty, _Pr, _Alloc >::key_compare
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Kty multimap< _Kty, _Ty, _Pr, _Alloc >::key_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Ty multimap< _Kty, _Ty, _Pr, _Alloc >::mapped_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::pointer multimap< _Kty, _Ty, _Pr, _Alloc >::pointer
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::reference multimap< _Kty, _Ty, _Pr, _Alloc >::reference
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Ty multimap< _Kty, _Ty, _Pr, _Alloc >::referent_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::reverse_iterator multimap< _Kty, _Ty, _Pr, _Alloc >::reverse_iterator
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::size_type multimap< _Kty, _Ty, _Pr, _Alloc >::size_type
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::value_compare multimap< _Kty, _Ty, _Pr, _Alloc >::value_compare
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
typedef _Mybase::value_type multimap< _Kty, _Ty, _Pr, _Alloc >::value_type

Constructor & Destructor Documentation

template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( )
inline
300  { // construct empty map from defaults
301  }
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
_Pr key_compare
Definition: map:282
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( const allocator_type _Al)
inlineexplicit
304  : _Mybase(key_compare(), _Al)
305  { // construct empty map from defaults, allocator
306  }
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
_Pr key_compare
Definition: map:282
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( const _Myt _Right)
inline
310  : _Mybase(_Right,
311  _Right._Getal().select_on_container_copy_construction())
312 
313 
314  { // construct map by copying _Right
315  }
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( const _Myt _Right,
const allocator_type _Al 
)
inline
318  : _Mybase(_Right, _Al)
319  { // construct map by copying _Right, allocator
320  }
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( const key_compare _Pred)
inlineexplicit
324  { // construct empty map from comparator
325  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( const key_compare _Pred,
const allocator_type _Al 
)
inline
328  : _Mybase(_Pred, _Al)
329  { // construct empty map from comparator and allocator
330  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _Iter  _First,
_Iter  _Last 
)
inline
335  { // construct map from [_First, _Last), defaults
336  _Mybase::insert(_First, _Last);
337  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
_Pr key_compare
Definition: map:282
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _Iter  _First,
_Iter  _Last,
const key_compare _Pred 
)
inline
343  { // construct map from [_First, _Last), comparator
344  _Mybase::insert(_First, _Last);
345  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _Iter  _First,
_Iter  _Last,
const key_compare _Pred,
const allocator_type _Al 
)
inline
350  : _Mybase(_Pred, _Al)
351  { // construct map from [_First, _Last), comparator, and allocator
352  _Mybase::insert(_First, _Last);
353  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _Myt &&  _Right)
inline
362  : _Mybase(_STD move(_Right))
363  { // construct map by moving _Right
364  }
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _Myt &&  _Right,
const allocator_type _Al 
)
inline
367  : _Mybase(_STD move(_Right), _Al)
368  { // construct map by moving _Right
369  }
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _XSTD initializer_list< value_type _Ilist)
inline
407  { // construct from initializer_list, defaults
408  this->insert(_Ilist.begin(), _Ilist.end());
409  }
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert(_Valty &&_Val)
Definition: map:380
_Pr key_compare
Definition: map:282
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _XSTD initializer_list< value_type _Ilist,
const key_compare _Pred 
)
inline
414  { // construct from initializer_list, comparator
415  this->insert(_Ilist.begin(), _Ilist.end());
416  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Mybase::allocator_type allocator_type
Definition: map:284
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert(_Valty &&_Val)
Definition: map:380
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
multimap< _Kty, _Ty, _Pr, _Alloc >::multimap ( _XSTD initializer_list< value_type _Ilist,
const key_compare _Pred,
const allocator_type _Al 
)
inline
420  : _Mybase(_Pred, _Al)
421  { // construct from initializer_list, comparator, and allocator
422  this->insert(_Ilist.begin(), _Ilist.end());
423  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Tree< _Tmap_traits< _Kty, _Ty, _Pr, _Alloc, true > > _Mybase
Definition: map:278
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert(_Valty &&_Val)
Definition: map:380

Member Function Documentation

template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class... _Valty>
iterator multimap< _Kty, _Ty, _Pr, _Alloc >::emplace ( _Valty &&...  _Val)
inline
395  { // try to insert value_type(_Val...), favoring right side
396  return (_Mybase::emplace(_STD forward<_Valty>(_Val)...).first);
397  }
_Pairib emplace(_Valty &&..._Val)
Definition: xtree:1174
_FwdIt const _Ty _Val
Definition: algorithm:1938
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Valty >
enable_if<is_convertible<_Valty, value_type>::value, iterator>::type multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( _Valty &&  _Val)
inline
381  { // insert a {key, mapped} value
382  return (_Mybase::insert(_STD forward<_Valty>(_Val)).first);
383  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_FwdIt const _Ty _Val
Definition: algorithm:1938
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Valty >
enable_if<is_convertible<_Valty, value_type>::value, iterator>::type multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( const_iterator  _Where,
_Valty &&  _Val 
)
inline
389  { // insert a {key, mapped} value, with hint
390  return (_Mybase::insert(_Where, _STD forward<_Valty>(_Val)));
391  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_FwdIt const _Ty _Val
Definition: algorithm:1938
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
void multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( _XSTD initializer_list< value_type _Ilist)
inline
433  { // insert initializer_list
434  this->insert(_Ilist.begin(), _Ilist.end());
435  }
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert(_Valty &&_Val)
Definition: map:380
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
iterator multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( const value_type _Val)
inline
438  { // insert a {key, mapped} value
439  return (_Mybase::insert(_Val).first);
440  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_FwdIt const _Ty _Val
Definition: algorithm:1938
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
iterator multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( const_iterator  _Where,
const value_type _Val 
)
inline
443  { // insert a {key, mapped} value, with hint
444  return (_Mybase::insert(_Where, _Val));
445  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_FwdIt const _Ty _Val
Definition: algorithm:1938
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
template<class _Iter >
void multimap< _Kty, _Ty, _Pr, _Alloc >::insert ( _Iter  _First,
_Iter  _Last 
)
inline
449  { // insert [_First, _Last), arbitrary iterators
450  _Mybase::insert(_First, _Last);
451  }
_Pairib insert(value_type &&_Val)
Definition: xtree:1141
_FwdIt _Last
Definition: algorithm:1936
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& multimap< _Kty, _Ty, _Pr, _Alloc >::operator= ( const _Myt _Right)
inline
356  { // assign by copying _Right
358  return (*this);
359  }
_Myt & operator=(_Myt &&_Right)
Definition: xtree:1104
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& multimap< _Kty, _Ty, _Pr, _Alloc >::operator= ( _Myt &&  _Right)
inline
372  { // assign by moving _Right
374  return (*this);
375  }
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
_Myt & operator=(_Myt &&_Right)
Definition: xtree:1104
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
_Myt& multimap< _Kty, _Ty, _Pr, _Alloc >::operator= ( _XSTD initializer_list< value_type _Ilist)
inline
426  { // assign initializer_list
427  this->clear();
428  this->insert(_Ilist.begin(), _Ilist.end());
429  return (*this);
430  }
void clear() _NOEXCEPT
Definition: xtree:1534
enable_if< is_convertible< _Valty, value_type >::value, iterator >::type insert(_Valty &&_Val)
Definition: map:380
template<class _Kty, class _Ty, class _Pr = less<_Kty>, class _Alloc = allocator<pair<const _Kty, _Ty> >>
void multimap< _Kty, _Ty, _Pr, _Alloc >::swap ( _Myt _Right)
inline
401  { // exchange contents with non-movable _Right
403  }
void swap(_Myt &_Right)
Definition: xtree:1603

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