STL源码剖析之map

#include <map>
#include <iostream>
#include <string>
using namespace std;

int main()
{
    map<string, int> simap; // string 为key， int为value
    simap[string("rabbit")] = 1;
    simap[string("rocket")] = 2;
    simap[string("tiger")] = 3;
    simap[string("duck")] = 4;

    pair<string, int> value(string("david"), 5);
    simap.insert(value);

    map<string, int>::iterator simap_iter = simap.begin();
    for (; simap_iter != simap.end(); ++simap_iter)
        cout << simap_iter->first << ' '
             << simap_iter->second << endl;

    int number = simap[string("hugo")];
    cout << number << endl;

    map<string, int>::iterator ite1;

    // 面对关联式容器，应该使用其所提供的find函数来搜寻元素， 会比
    // 使用STL算法find（）更有效率。因为STL算法find（）只是循序搜寻
    ite1 = simap.find(string("tiger"));
    if (ite1 == simap.end())
        cout << "tiger not found" << endl;
    else
        cout << "tiger found" << endl;

    ite1->second = 99; // 可以通过map迭代器修改“value”（not key）
    cout << simap[string("tiger")] << endl;
}