#include <ustl.h>
Inheritance diagram for ustl::multiset< T >:
Public Types | |
typedef vector< T >::value_type | value_type |
typedef vector< T >::size_type | size_type |
typedef vector< T >::pointer | pointer |
typedef vector< T >::const_pointer | const_pointer |
typedef vector< T >::reference | reference |
typedef vector< T >::const_reference | const_reference |
typedef vector< T >::const_iterator | const_iterator |
typedef vector< T >::iterator | iterator |
typedef vector< T >::reverse_iterator | reverse_iterator |
typedef vector< T >::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
multiset (void) | |
Default constructor. | |
multiset (size_type n) | |
Creates the container with space enough to hold n elements. | |
multiset (const multiset< T > &v) | |
Creates a copy of v . | |
multiset (const_iterator i1, const_iterator i2) | |
Copies range [i1,i2). | |
const multiset< T > & | operator= (const multiset< T > &v) |
Copies contents of v . | |
void | assign (const_iterator i1, const_iterator i2) |
Copies contents of range [i1,i2). | |
size_type | count (const_reference v) const |
Returns the number of elements of value v . | |
void | push_back (const_reference v) |
Inserts v . | |
iterator | insert (const_reference v) |
Inserts v . | |
void | insert (const_iterator i1, const_iterator i2) |
Inserts all elements from range [i1,i2). | |
void | erase (const_reference v) |
Erases all elements with value v . | |
iterator | erase (iterator ep) |
Erases the element at ep . | |
iterator | erase (iterator ep1, iterator ep2) |
Erases range [ep1,ep2). | |
void | clear (void) |
Resizes the block to 0. | |
size_type | size (void) const |
Returns the size of the block. | |
iterator | begin (void) |
Returns a modifiable pointer to the block. | |
const_iterator | begin (void) const |
Returns a const pointer to the block. | |
iterator | end (void) |
Returns a modifiable pointer to the end of the block. | |
const_iterator | end (void) const |
Returns a const pointer to the end of the block. |