_GLIBCXX_STD::multiset

_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc > Class Template Reference

A standard container made up of elements, which can be retrieved in logarithmic time. More...

#include <stl_multiset.h>

List of all members.
std::pair< iterator, iterator > equal_range (const key_type &__x)
 Finds a subsequence matching given key.
std::pair< const_iterator,
const_iterator > 		equal_range (const key_type &__x) const
template<class _K1, class _C1, class _A1>
bool operator== (const multiset< _K1, _C1, _A1 > &, const multiset< _K1, _C1, _A1 > &)
template<class _K1, class _C1, class _A1>
bool operator< (const multiset< _K1, _C1, _A1 > &, const multiset< _K1, _C1, _A1 > &)

Public Types

typedef _Key_alloc_type::pointer pointer
typedef _Key_alloc_type::const_pointer const_pointer
typedef _Key_alloc_type::reference reference
typedef _Key_alloc_type::const_reference const_reference
typedef _Rep_type::const_iterator iterator
typedef _Rep_type::const_iterator const_iterator
typedef _Rep_type::const_reverse_iterator reverse_iterator
typedef _Rep_type::const_reverse_iterator const_reverse_iterator
typedef _Rep_type::size_type size_type
typedef _Rep_type::difference_type difference_type

Public Member Functions

 multiset ()
 Default constructor creates no elements.
 multiset (const _Compare &__comp, const allocator_type &__a=allocator_type())
template<class _InputIterator>
 multiset (_InputIterator __first, _InputIterator __last)
 Builds a multiset from a range.
template<class _InputIterator>
 multiset (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 Builds a multiset from a range.
 multiset (const multiset< _Key, _Compare, _Alloc > &__x)
 Multiset copy constructor.
multiset< _Key, _Compare,
_Alloc > & 		operator= (const multiset< _Key, _Compare, _Alloc > &__x)
 Multiset assignment operator.
key_compare key_comp () const
 Returns the comparison object.
value_compare value_comp () const
 Returns the comparison object.
allocator_type get_allocator () const
 Returns the memory allocation object.
iterator begin () const
iterator end () const
reverse_iterator rbegin () const
reverse_iterator rend () const
bool empty () const
 Returns true if the set is empty.
size_type size () const
 Returns the size of the set.
size_type max_size () const
 Returns the maximum size of the set.
void swap (multiset< _Key, _Compare, _Alloc > &__x)
 Swaps data with another multiset.
iterator insert (const value_type &__x)
 Inserts an element into the multiset.
iterator insert (iterator __position, const value_type &__x)
 Inserts an element into the multiset.
template<class _InputIterator>
void insert (_InputIterator __first, _InputIterator __last)
 A template function that attemps to insert a range of elements.
void erase (iterator __position)
 Erases an element from a multiset.
size_type erase (const key_type &__x)
 Erases elements according to the provided key.
void erase (iterator __first, iterator __last)
 Erases a [first,last) range of elements from a multiset.
void clear ()
size_type count (const key_type &__x) const
 Finds the number of elements with given key.
iterator find (const key_type &__x)
 Tries to locate an element in a set.
const_iterator find (const key_type &__x) const
iterator lower_bound (const key_type &__x)
 Finds the beginning of a subsequence matching given key.
const_iterator lower_bound (const key_type &__x) const
iterator upper_bound (const key_type &__x)
 Finds the end of a subsequence matching given key.
const_iterator upper_bound (const key_type &__x) const

Private Types

typedef _Alloc::value_type _Alloc_value_type
typedef _Compare key_compare
typedef _Compare value_compare
typedef _Alloc allocator_type
typedef _Alloc::template rebind<
_Key >::other 		_Key_alloc_type
typedef _Rb_tree< key_type,
value_type, _Identity< value_type >,
key_compare, _Key_alloc_type > 		_Rep_type

Private Member Functions

 __glibcxx_class_requires (_Key, _SGIAssignableConcept) __glibcxx_class_requires4(_Compare

Private Attributes

 bool
 _Key
_BinaryFunctionConcept __glibcxx_class_requires2(_Key, _Alloc_value_type,
_SameTypeConcept) public
typedef _Key 		value_type
_Rep_type _M_t

Detailed Description

template<class _Key, class _Compare, class _Alloc>
class _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >

A standard container made up of elements, which can be retrieved in logarithmic time.

Meets the requirements of a container, a reversible container, and an associative container (using equivalent keys). For a multiset<Key> the key_type and value_type are Key.

Multisets support bidirectional iterators.

Definition at line 105 of file stl_multiset.h.

Member Typedef Documentation

template<class _Key, class _Compare, class _Alloc>
typedef _Alloc::value_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_Alloc_value_type [private]

Definition at line 108 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Alloc::template rebind<_Key>::other _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_Key_alloc_type [private]

Definition at line 124 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rb_tree<key_type, value_type, _Identity<value_type>, key_compare, _Key_alloc_type> _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_Rep_type [private]

Definition at line 127 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Alloc _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::allocator_type [private]

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 120 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::const_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::const_iterator

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 140 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Key_alloc_type::const_pointer _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::const_pointer

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 133 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Key_alloc_type::const_reference _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::const_reference

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 135 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::const_reverse_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::const_reverse_iterator

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 142 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::difference_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::difference_type

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 144 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::const_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::iterator

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 139 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Compare _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::key_compare [private]

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 118 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Key_alloc_type::pointer _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::pointer

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 132 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Key_alloc_type::reference _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::reference

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 134 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::const_reverse_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::reverse_iterator

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 141 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Rep_type::size_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::size_type

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 143 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
typedef _Compare _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::value_compare [private]

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 119 of file stl_multiset.h.

Constructor & Destructor Documentation

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::multiset (  )  [inline]

Default constructor creates no elements.

Definition at line 151 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::multiset ( const _Compare &  __comp,
const allocator_type &  __a = allocator_type() 
) [inline, explicit]

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 155 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
template<class _InputIterator>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::multiset ( _InputIterator  __first,
_InputIterator  __last 
) [inline]

Builds a multiset from a range.

Parameters:
first An input iterator.
last An input iterator.
Create a multiset consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).

Definition at line 169 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
template<class _InputIterator>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::multiset ( _InputIterator  __first,
_InputIterator  __last,
const _Compare &  __comp,
const allocator_type &  __a = allocator_type() 
) [inline]

Builds a multiset from a range.

Parameters:
first An input iterator.
last An input iterator.
comp A comparison functor.
a An allocator object.
Create a multiset consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 185 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::multiset ( const multiset< _Key, _Compare, _Alloc > &  __x  )  [inline]

Multiset copy constructor.

Parameters:
x A multiset of identical element and allocator types.
The newly-created multiset uses a copy of the allocation object used by x.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 198 of file stl_multiset.h.

Member Function Documentation

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::__glibcxx_class_requires ( _Key  ,
_SGIAssignableConcept   
) [private]

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::begin (  )  const [inline]

Returns a read/write iterator that points to the first element in the multiset. Iteration is done in ascending order according to the keys.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 236 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::clear (  )  [inline]

Erases all elements in a multiset. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 400 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
size_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::count ( const key_type &  __x  )  const [inline]

Finds the number of elements with given key.

Parameters:
x Key of elements to be located.
Returns:
Number of elements with specified key.

Definition at line 411 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
bool _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::empty (  )  const [inline]

Returns true if the set is empty.

Definition at line 268 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::end (  )  const [inline]

Returns a read/write iterator that points one past the last element in the multiset. Iteration is done in ascending order according to the keys.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 245 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
std::pair<const_iterator, const_iterator> _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::equal_range ( const key_type &  __x  )  const [inline]

Definition at line 495 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
std::pair<iterator, iterator> _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::equal_range ( const key_type &  __x  )  [inline]

Finds a subsequence matching given key.

Parameters:
x Key to be located.
Returns:
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to 
    std::make_pair(c.lower_bound(val),
                   c.upper_bound(val))
(but is faster than making the calls separately).

This function probably only makes sense for multisets.

Definition at line 491 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::erase ( iterator  __first,
iterator  __last 
) [inline]

Erases a [first,last) range of elements from a multiset.

Parameters:
first Iterator pointing to the start of the range to be erased.
last Iterator pointing to the end of the range to be erased.
This function erases a sequence of elements from a multiset. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Definition at line 390 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
size_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::erase ( const key_type &  __x  )  [inline]

Erases elements according to the provided key.

Parameters:
x Key of element to be erased.
Returns:
The number of elements erased.
This function erases all elements located by the given key from a multiset. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Definition at line 375 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::erase ( iterator  __position  )  [inline]

Erases an element from a multiset.

Parameters:
position An iterator pointing to the element to be erased.
This function erases an element, pointed to by the given iterator, from a multiset. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Definition at line 360 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
const_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::find ( const key_type &  __x  )  const [inline]

Definition at line 433 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::find ( const key_type &  __x  )  [inline]

Tries to locate an element in a set.

Parameters:
x Element to be located.
Returns:
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.

Definition at line 429 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
allocator_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::get_allocator (  )  const [inline]

Returns the memory allocation object.

Definition at line 227 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
template<class _InputIterator>
void _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::insert ( _InputIterator  __first,
_InputIterator  __last 
) [inline]

A template function that attemps to insert a range of elements.

Parameters:
first Iterator pointing to the start of the range to be inserted.
last Iterator pointing to the end of the range.
Complexity similar to that of the range constructor.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 346 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::insert ( iterator  __position,
const value_type &  __x 
) [inline]

Inserts an element into the multiset.

Parameters:
position An iterator that serves as a hint as to where the element should be inserted.
x Element to be inserted.
Returns:
An iterator that points to the inserted element.
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can be inserted.

Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting".

Insertion requires logarithmic time (if the hint is not taken).

Definition at line 333 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::insert ( const value_type &  __x  )  [inline]

Inserts an element into the multiset.

Parameters:
x Element to be inserted.
Returns:
An iterator that points to the inserted element.
This function inserts an element into the multiset. Contrary to a std::set the multiset does not rely on unique keys and thus multiple copies of the same element can be inserted.

Insertion requires logarithmic time.

Definition at line 309 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
key_compare _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::key_comp (  )  const [inline]

Returns the comparison object.

Definition at line 219 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
const_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::lower_bound ( const key_type &  __x  )  const [inline]

Definition at line 454 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::lower_bound ( const key_type &  __x  )  [inline]

Finds the beginning of a subsequence matching given key.

Parameters:
x Key to be located.
Returns:
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.

Definition at line 450 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
size_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::max_size (  )  const [inline]

Returns the maximum size of the set.

Definition at line 278 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
multiset<_Key,_Compare,_Alloc>& _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::operator= ( const multiset< _Key, _Compare, _Alloc > &  __x  )  [inline]

Multiset assignment operator.

Parameters:
x A multiset of identical element and allocator types.
All the elements of x are copied, but unlike the copy constructor, the allocator object is not copied.

Definition at line 209 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
reverse_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::rbegin (  )  const [inline]

Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 254 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
reverse_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::rend (  )  const [inline]

Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 263 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
size_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::size (  )  const [inline]

Returns the size of the set.

Definition at line 273 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
void _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::swap ( multiset< _Key, _Compare, _Alloc > &  __x  )  [inline]

Swaps data with another multiset.

Parameters:
x A multiset of the same element and allocator types.
This exchanges the elements between two multisets in constant time. (It is only swapping a pointer, an integer, and an instance of the Compare type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function.

Definition at line 293 of file stl_multiset.h.

Referenced by _GLIBCXX_STD::swap().

template<class _Key, class _Compare, class _Alloc>
const_iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::upper_bound ( const key_type &  __x  )  const [inline]

Definition at line 470 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
iterator _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::upper_bound ( const key_type &  __x  )  [inline]

Finds the end of a subsequence matching given key.

Parameters:
x Key to be located.
Returns:
Iterator pointing to the first element greater than key, or end().

Definition at line 466 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
value_compare _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::value_comp (  )  const [inline]

Returns the comparison object.

Definition at line 223 of file stl_multiset.h.

Friends And Related Function Documentation

template<class _Key, class _Compare, class _Alloc>
template<class _K1, class _C1, class _A1>
bool operator< ( const multiset< _K1, _C1, _A1 > &  ,
const multiset< _K1, _C1, _A1 > &   
) [friend]

template<class _Key, class _Compare, class _Alloc>
template<class _K1, class _C1, class _A1>
bool operator== ( const multiset< _K1, _C1, _A1 > &  ,
const multiset< _K1, _C1, _A1 > &   
) [friend]

Member Data Documentation

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_Key [private]

Definition at line 110 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
_Rep_type _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::_M_t [private]

Definition at line 129 of file stl_multiset.h.

Referenced by _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::begin(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::clear(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::count(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::empty(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::end(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::equal_range(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::erase(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::find(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::get_allocator(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::insert(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::key_comp(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::lower_bound(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::max_size(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::multiset(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::operator=(), _GLIBCXX_STD::operator==(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::rbegin(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::rend(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::size(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::swap(), _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::upper_bound(), and _GLIBCXX_STD::multiset< _Key, _Compare, _Allocator >::value_comp().

template<class _Key, class _Compare, class _Alloc>
_GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::bool [private]

Definition at line 110 of file stl_multiset.h.

template<class _Key, class _Compare, class _Alloc>
_BinaryFunctionConcept __glibcxx_class_requires2 (_Key, _Alloc_value_type, _SameTypeConcept) public typedef _Key _GLIBCXX_STD::multiset< _Key, _Compare, _Alloc >::value_type [private]

Reimplemented in __gnu_debug_def::multiset< _Key, _Compare, _Allocator >.

Definition at line 112 of file stl_multiset.h.

The documentation for this class was generated from the following file:
Generated on Tue Feb 2 16:58:23 2010 for GNU C++ STL by  doxygen 1.4.7