multiset
multiset , ( ) . .
template <class Key, class Comp = less<Key>, class Allocator = allocator<Key>> class multiset
Key - , Comp - , . multiset .
explicit multiset(const Comp &cmpfn - Comp(), const Allocator &a = Allocator()); multiset(const multiset<Key, Comp, Allocator> &ob); template <class InIter> multiset(InIter start, InIter end, const Comp &cmpfn = Comp() , const Allocator &a = Allocator());
, , , ob. , , start end. , cmpfn( ), .
multiset : ==, <, <=, !=, > >=.
multiset -. key_type value_type typedef Key.
- |
|
iterator begin(); const_iterator begin() const; |
|
void clear(); |
|
size_type count(const key_type &k) const; |
k |
bool empty() const; |
true, , false |
iterator end(); const_iterator end() const; |
|
pair<iterator, iterator> equal_range(const key_type &k) const; |
, , |
void erase(iterator i); |
, i |
void erase(iterator start, iterator end); |
, start end |
size_type erase(const key_type &k); |
, k |
iterator find(const key_type &k); |
. , |
allocator_type get_allocator() const; |
|
iterator insert(iterator i, const value_type &val); |
val , i. |
template <class InIter> void insert(InIter start, InIter end); |
|
iterator insert(const value_type &val); |
val . |
key_compare key_comp() const; |
-, |
iterator lower_bound(const key_type &k) const; |
, k |
size_type max_size() const; |
, |
reverse_iterator rbegin(); const_reverse_iterator rbegin() const; |
|
reverse_iterator rend(); const_reverse_iterator rend() const; |
|
size_type size() const; |
|
void swap(multiset<Key, T, Comp, Allocator> &ob); |
ob |
iterator upper_bound(const key_type &k) const; |
, k |
value_compare value_comp() const; |
-, |
|