|
map
map , . .
template <class Key, class T, class Comp = less<Key>,
class Allocator = allocator<pair<const Key, T>>> class map
Key - , - () , a Comp - , . map .
explicit map(const Comp &cmpfn = Comp(), const Allocator &a = Allocator());
map(const map<Key, T, Comp, Allocator> &ob);
template <class InIter> map(InIter start, InIter end,
const Comp &cmpfn = Comp(), const Allocator &a = Allocator)));
. , , ob. , , start end. , cmpfn ( ), .
map : ==,<,<=, !=, > >=.
map -. key_type , value_type - pair<Key, >.
| - |
|
iterator begin();
const_iterator begin() const; |
|
| void clear(); |
|
| size_type count(const key_type &k) const; |
k (1 0) |
| bool empty() const; |
true, , false |
iterator end();
const_iterator end() const; |
, |
pair<iterator, iterator> equal_range(const key_type &k);
pair<const_iterator, const_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);
const_iterator find(const key_type &k) const; |
. , |
| allocator_type get_allocator() const; |
|
| iterator insert(iterator i, const value_type &val); |
val , i. |
| template <class InIter> void insert(InIter start, InIter end); |
|
| pair<iterator, bool> insert(const value_type &vaJ); |
val . . , . , pair<iterator, true>. pair<iterator, false> |
| 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; |
, |
| reference operator[](const key_type &i); |
, i. , |
reverse_iterator rbegin();
const_reverse_iterator rbegin() const; |
|
reverse_iterator rend();
const_reverse_iterator rend() const; |
|
| size_type size() const; |
|
| void swap(map<Key, T, Comp, Allocator> &ob); |
|
iterator upper_bound(const key_type &k);
const_iterator upper_bound(const key_type &k) const; |
, k |
| value_compare value_comp() const; |
, k |
|