multimap
multimap , ( ) . .
template , lass Allocator = allocator>> class multimap
Key - , - () , a Comp - , . multimap .
explicit multimap(const Comp &cmpfn = Comp(), const Allocator &a = Allocator(}); multimap(const multimap &ob); template multimap(InIter start, InIter end, const Comp &cmpfn = Comp(), const Allocator &a = Allocator());
. , , b. , , start end. , cmpfn ( ), .
multimap : ==,<,<=, !=,> >=.
multimap -. key_type , value_type - pair.
- |
|
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 equal_range(const key_type &k); pair 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 &?); const_iterator find(const key_type &fc) const; |
. , |
allocator_type get_allocator() const; |
|
iterator insert(iterator i, const value_type &val); |
val , i. |
template void insert(InIter start, InIter end); |
|
iterator insert(const value_type &vai); |
val |
key_compare key_comp() const; |
-, |
iterator lower_bound(const key_type &k); 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(multimap &ob); |
ob |
iterator upper_bound(const key_type &k); const_iterator upper_bound(const key_type &k) const; |
, k |
value_compare value_comp() const; |
-, |
|