multiMap遍歷方法

/*
    multimap中的三種遍歷方法
    multimap中如果沒有查找到相應元素，則返回的迭代器是依據該元素的排列順序該鍵應該插入的位置
    如果找不到，則方法一和方法二返回的兩個迭代器應該相等
*/
#include <iostream>
#include <map>
#include <string>
#include <utility>

using namespace std;

int main()
{
    multimap<string, string> mulMap;
    mulMap.insert(make_pair("魯迅", "朝花夕拾"));
    mulMap.insert(make_pair("魯迅", "阿Q正傳"));
    mulMap.insert(make_pair("魯迅", "野草"));
    mulMap.insert(make_pair("羅貫中", "三國演義"));
    mulMap.insert(make_pair("羅貫中", "隋唐志傳"));
    mulMap.insert(make_pair("瓊瑤", "還珠格格"));
    mulMap.insert(make_pair("瓊瑤", "情深深雨蒙蒙"));
    typedef multimap<string, string>::iterator multiMapItor;
    //方法一：推薦
    
    string author("魯迅");
    cout << author << "的書籍有：" << endl;
    pair<multiMapItor, multiMapItor> pos = mulMap.equal_range(author);
    while(pos.first != pos.second)
    {
        cout << pos.first->second << endl;
        ++pos.first;
    }
    cout << endl;
    //方法二：
    author.assign("羅貫中");
    cout << author << "的書籍有：" << endl;
    multiMapItor beg = mulMap.lower_bound(author);
    multiMapItor end = mulMap.upper_bound(author);
    while(beg != end)
    {
        cout << beg->second << endl;
        ++beg;
    }
    cout << endl;
    //方法三：不推薦
    author.assign("瓊瑤");
    cout << author << "的書籍有：" << endl;
    typedef multimap<string, string>::size_type sz_type;
    sz_type entries = mulMap.count(author);
    multiMapItor itor = mulMap.find(author);
    for(sz_type cnt = 0; cnt != entries; ++cnt)
        cout << (itor++)->second << endl;

    system("pause");
    return 0;
}