STL map学习

map<Key, Data, Compare, Alloc>

 

map是一种关联容器，存储相结合形成的一个关键值和映射值的元素。Map 是一种Pair Associative Container，意味着它的值类型为 pair<const Key, Data>. 而且也是Unique Associative Container, 也就是任何两个元素没有相同的key值。

map具有重要的属性，就是在map对象中插入一个新元素不指向现有元素的迭代器失效。从map上删除一个元素，也没有任何迭代器失效，除非，当然，实际上指向正在被删除的元素的迭代器。

 

1、例子

[cpp] view plain copy

1. struct ltstr  
2. {  
3.   bool operator()(const char* s1, const char* s2) const  
4.   {  
5.     return strcmp(s1, s2) < 0;  
6.   }  
7. };  
8.   
9. int main()  
10. {  
11.   map<const char*, int, ltstr> months;  
12.     
13.   months["january"] = 31;  
14.   months["february"] = 28;  
15.   months["march"] = 31;  
16.   months["april"] = 30;  
17.   months["may"] = 31;  
18.   months["june"] = 30;  
19.   months["july"] = 31;  
20.   months["august"] = 31;  
21.   months["september"] = 30;  
22.   months["october"] = 31;  
23.   months["november"] = 30;  
24.   months["december"] = 31;  
25.     
26.   cout << "june -> " << months["june"] << endl;  
27.   map<const char*, int, ltstr>::iterator cur  = months.find("june");  
28.   map<const char*, int, ltstr>::iterator prev = cur;  
29.   map<const char*, int, ltstr>::iterator next = cur;      
30.   ++next;  
31.   --prev;  
32.   cout << "Previous (in alphabetical order) is " << (*prev).first << endl;  
33.   cout << "Next (in alphabetical order) is " << (*next).first << endl;  
34. }  

 

2、定义形式

[cpp] view plain copy

1. template < class Key, class T, class Compare = less<Key>,  
2.            class Allocator = allocator<pair<const Key,T> > > class map;  

 

3、模板参数具有以下涵义：

key：关键值的类型。在map对象中的每个元素是通过该关键值唯一确定元素的。
T：映射值的类型。在map中的每个元素是用来储存一些数据作为其映射值。
compare：Comparison类：A类键的类型，它有两个参数，并返回一个bool。表达comp（A，B），comp是这比较类A和B是关键值的对象，应返回true，如果是在早先的立场比B放置在一个严格弱排序操作。这可以是一个类实现一个函数调用运算符或一个函数的指针（见一个例子构造）。默认的对于<KEY>，返回申请小于操作符相同的默认值（A <B）。
Map对象使用这个表达式来确定在容器中元素的位置。以下这个规则在任何时候都排列在map容器中的所有元素。
Allocator：用于定义存储分配模型分配器对象的类型。默认情况下，分配器类模板，它定义了最简单的内存分配模式，是值独立的

 

[cpp] view plain copy

1. map<Key,T>::iterator it;  
2. (*it).first;             // 指向key值(of type Key)  
3. (*it).second;            // 映射的值(of type T)  
4. (*it);                   // the "element value" (of type pair<const Key,T>)   

也可以如下表达：

[cpp] view plain copy

1. it->first;               // same as (*it).first   (the key value)  
2. it->second;              // same as (*it).second  (the mapped value)  

 

 

4、成员变量和成员函数

Member	Where defined	Description
key_type	Associative Container	map中的key类型
data_type	Pair Associative Container	key关联的值类型
value_type	Pair Associative Container	对象类型, pair<const key_type, data_type>,存储在map中
key_compare	Sorted Associative Container	Function object 通过顺序比较
value_compare	Sorted Associative Container	Function object that compares two values for ordering.
pointer	Container	Pointer to T.
reference	Container	Reference to T
const_reference	Container	Const reference to T
size_type	Container	An unsigned integral type.
difference_type	Container	A signed integral type.
iterator	Container	Iterator used to iterate through a map. [1]
const_iterator	Container	Const iterator used to iterate through a map.
reverse_iterator	Reversible Container	Iterator used to iterate backwards through a map. [1]
const_reverse_iterator	Reversible Container	Const iterator used to iterate backwards through a map.
iterator begin()	Container	Returns an iterator pointing to the beginning of the map.
iterator end()	Container	Returns an iterator pointing to the end of the map.
const_iterator begin() const	Container	Returns a const_iterator pointing to the beginning of themap.
const_iterator end() const	Container	Returns a const_iterator pointing to the end of the map.
reverse_iterator rbegin()	Reversible Container	Returns a reverse_iterator pointing to the beginning of the reversed map.
reverse_iterator rend()	Reversible Container	Returns a reverse_iterator pointing to the end of the reversed map.
const_reverse_iterator rbegin() const	Reversible Container	Returns a const_reverse_iterator pointing to the beginning of the reversed map.
const_reverse_iterator rend() const	Reversible Container	Returns a const_reverse_iterator pointing to the end of the reversed map.
size_type size() const	Container	Returns the size of the map.
size_type max_size() const	Container	Returns the largest possible size of the map.
bool empty() const	Container	true if the map's size is 0.
key_compare key_comp() const	Sorted Associative Container	Returns the key_compare object used by the map.
value_compare value_comp() const	Sorted Associative Container	Returns the value_compare object used by the map.
map()	Container	Creates an empty map.
map(const key_compare& comp)	Sorted Associative Container	Creates an empty map, using comp as the key_compare object.
template <class InputIterator> map(InputIterator f, InputIterator l)	Unique Sorted Associative Container	Creates a map with a copy of a range.
template <class InputIterator> map(InputIterator f, InputIterator l, const key_compare& comp)	Unique Sorted Associative Container	Creates a map with a copy of a range, using comp as thekey_compare object.
map(const map&)	Container	The copy constructor.
map& operator=(const map&)	Container	The assignment operator
void swap(map&)	Container	Swaps the contents of two maps.
pair<iterator, bool> insert(const value_type& x)	Unique Associative Container	Inserts x into the map.
iterator insert(iterator pos, const value_type& x)	Unique Sorted Associative Container	Inserts x into the map, using pos as a hint to where it will be inserted.
template <class InputIterator> void insert(InputIterator, InputIterator) [2]	Unique Sorted Associative Container	Inserts a range into the map.
void erase(iterator pos)	Associative Container	Erases the element pointed to by pos.
size_type erase(const key_type& k)	Associative Container	Erases the element whose key is k.
void erase(iterator first, iterator last)	Associative Container	Erases all elements in a range.
void clear()	Associative Container	Erases all of the elements.
iterator find(const key_type& k)	Associative Container	Finds an element whose key is k.
const_iterator find(const key_type& k) const	Associative Container	Finds an element whose key is k.
size_type count(const key_type& k)	Unique Associative Container	Counts the number of elements whose key is k.
iterator lower_bound(const key_type& k)	Sorted Associative Container	Finds the first element whose key is not less than k.
const_iterator lower_bound(const key_type& k) const	Sorted Associative Container	Finds the first element whose key is not less than k.
iterator upper_bound(const key_type& k)	Sorted Associative Container	Finds the first element whose key greater than k.
const_iterator upper_bound(const key_type& k) const	Sorted Associative Container	Finds the first element whose key greater than k.
pair<iterator, iterator> equal_range(const key_type& k)	Sorted Associative Container	Finds a range containing all elements whose key is k.
pair<const_iterator, const_iterator> equal_range(const key_type& k) const	Sorted Associative Container	Finds a range containing all elements whose key is k.
data_type& operator[](const key_type& k) [3]	map	See below.
bool operator==(const map&, const map&)	Forward Container	Tests two maps for equality. This is a global function, not a member function.
bool operator<(const map&, const map&)	Forward Container	Lexicographical comparison. This is a global function, not a member function.

[cpp] view plain copy

1.    

[cpp] view plain copy

1. 下面展示了常用的一些方法。<p>// stu_map.cpp : 定义控制台应用程序的入口点。  
2. //  
3.   
4. #include "stdafx.h"  
5. #include <iostream>  
6. #include <map>  
7. using namespace std;  
8.   
9. bool fncomp(char lhs,char rhs)  
10. {  
11.     return lhs<rhs;  
12. }  
13. struct classcomp   
14. {  
15.     bool operator()(const char& lhs,const char& rhs)  
16.     {  
17.         return lhs<rhs;  
18.     }  
19. };  
20. int _tmain(int argc, _TCHAR* argv[])  
21. {  
22.     map<char,int> mymap;  
23.     mymap['a']=10;  
24.     mymap['b']=60;  
25.     mymap['c']=30;  
26.     mymap['d']=90;  
27.     mymap['e']=50;  
28.   
29.     map<char,int> second(mymap);  
30.     map<char,int> third(mymap.begin(),mymap.end());  
31.     map<char,int,classcomp> fourth;  
32.     bool(*fn_pt)(char,char)=fncomp;  
33.     map<char,int,bool(*)(char,char)> fifth(fn_pt);  
34.     map<char,int>::key_compare key_comp;  
35.     map<char,int>::iterator it;  
36.     it=mymap.begin();  
37.     for (it;it!=mymap.end();it++)  
38.     {  
39.         cout<<it->first<<":"<<it->second<<endl;  
40.     }  
41.     cout<<"================================="<<endl;  
42.     second.clear();  
43.     second['a']=1002;  
44.     second['b']=10023;  
45.     while (!second.empty())  
46.     {  
47.         cout << second.begin()->first << " => ";  
48.         cout << second.begin()->second << endl;  
49.         second.erase(second.begin());  
50.     }  
51.     cout<<"================================="<<endl;  
52.     mymap.insert(pair<char,int>('f',100) );  
53.     mymap.insert(pair<char,int>('g',200) );  
54.     cout<<"f => " <<mymap.find('f')->second<<endl;  
55.     cout<<"g => " <<mymap.find('g')->second<<endl;  
56.   
57.     cout<<"================================="<<endl;  
58.     key_comp=mymap.key_comp();  
59.     cout << "mymap contains:\n";  
60.   
61.     char highest=mymap.rbegin()->first;     // key value of last element  
62.   
63.     it=mymap.begin();  
64.     do {  
65.         cout << (*it).first << " => " << (*it).second << endl;  
66.     } while ( key_comp((*it++).first, highest) );  
67.   
68.     cout << endl;  
69.     return 0;  
70. }  
71.   
72. </p>  

运行结果：