include/bits/stl_multiset.h

72     class multiset;
76     operator==(const multiset<_Key, _Compare, _Alloc>& __x,
77 	       const multiset<_Key, _Compare, _Alloc>& __y);
81     operator<(const multiset<_Key, _Compare, _Alloc>& __x,
82 	      const multiset<_Key, _Compare, _Alloc>& __y);
94    *  keys).  For a @c multiset<Key> the key_type and value_type are Key.
100    *  multiset; the distinction is made entirely in how the tree functions are
105     class multiset
151       multiset()
155       multiset(const _Compare& __comp,
160        *  @brief  Builds a %multiset from a range.
164        *  Create a %multiset consisting of copies of the elements from
169         multiset(_InputIterator __first, _InputIterator __last)
174        *  @brief  Builds a %multiset from a range.
180        *  Create a %multiset consisting of copies of the elements from
185         multiset(_InputIterator __first, _InputIterator __last,
193        *  @param  x  A %multiset of identical element and allocator types.
195        *  The newly-created %multiset uses a copy of the allocation object used
198       multiset(const multiset<_Key,_Compare,_Alloc>& __x)
203        *  @param  x  A %multiset of identical element and allocator types.
208       multiset<_Key,_Compare,_Alloc>&
209       operator=(const multiset<_Key,_Compare,_Alloc>& __x)
232        *  %multiset.  Iteration is done in ascending order according to the
241        *  the %multiset.  Iteration is done in ascending order according to the
250        *  in the %multiset.  Iteration is done in descending order according to
259        *  in the %multiset.  Iteration is done in descending order according to
282        *  @brief  Swaps data with another %multiset.
283        *  @param  x  A %multiset of the same element and allocator types.
293       swap(multiset<_Key, _Compare, _Alloc>& __x)
298        *  @brief Inserts an element into the %multiset.
302        *  This function inserts an element into the %multiset.  Contrary
303        *  to a std::set the %multiset does not rely on unique keys and thus
313        *  @brief Inserts an element into the %multiset.
319        *  This function inserts an element into the %multiset.  Contrary
320        *  to a std::set the %multiset does not rely on unique keys and thus
350        *  @brief Erases an element from a %multiset.
354        *  from a %multiset.  Note that this function only erases the element,
369        *  %multiset.
379        *  @brief Erases a [first,last) range of elements from a %multiset.
384        *  This function erases a sequence of elements from a %multiset.
394        *  Erases all elements in a %multiset.  Note that this function only
403       // multiset operations:
500         operator== (const multiset<_K1, _C1, _A1>&,
501 		    const multiset<_K1, _C1, _A1>&);
505         operator< (const multiset<_K1, _C1, _A1>&,
506 		   const multiset<_K1, _C1, _A1>&);
511    *  @param  x  A %multiset.
512    *  @param  y  A %multiset of the same type as @a x.
522     operator==(const multiset<_Key, _Compare, _Alloc>& __x,
523 	       const multiset<_Key, _Compare, _Alloc>& __y)
528    *  @param  x  A %multiset.
529    *  @param  y  A %multiset of the same type as @a x.
539     operator<(const multiset<_Key, _Compare, _Alloc>& __x,
540 	      const multiset<_Key, _Compare, _Alloc>& __y)
546     operator!=(const multiset<_Key, _Compare, _Alloc>& __x,
547 	       const multiset<_Key, _Compare, _Alloc>& __y)
553     operator>(const multiset<_Key,_Compare,_Alloc>& __x,
554 	      const multiset<_Key,_Compare,_Alloc>& __y)
560     operator<=(const multiset<_Key, _Compare, _Alloc>& __x,
561 	       const multiset<_Key, _Compare, _Alloc>& __y)
567     operator>=(const multiset<_Key, _Compare, _Alloc>& __x,
568 	       const multiset<_Key, _Compare, _Alloc>& __y)
571   /// See std::multiset::swap().
574     swap(multiset<_Key, _Compare, _Alloc>& __x,
575 	 multiset<_Key, _Compare, _Alloc>& __y)