hash_set与hash_map

// hash_set

#include<iostream>
#include<hash_set>

using namespace std;

void main()
{
    hash_set<int> myset;// 不会排序  存入哈希表
    myset.insert(123);
    myset.insert(1123);
    myset.insert(23);

    for (auto i : myset )
    {
        cout << i << endl;
    }

    for(auto ib = myset.begin(),ie = myset.end();ib!=ie;ib++)
    {
        cout << *ib << endl;
    }

    auto i = myset.find(23);
    if (i != myset.end())
    {
        cout << "find = " << *i << endl;
    }

    cin.get();
}

//------------------------------------------------------------------------

struct strequ
{
    bool operator ()(const char *str1,const char *str2) const
    {
        return (strcmp(str1,str2) == 0);    
    }
};

void main()
{
    hash_set<char*,hash_compare<char*>,strequ> myhash;

    myhash.insert("abc");
    myhash.insert("zbc");
    myhash.insert("cbc");
    myhash.insert("bbc");

    auto i = myhash.find("cbc");
    if (i != myhash.end())
    {
        cout << "find = " << *i << endl;
    }



    cin.get();
}

//------------------------------------------------------------------------

// hash_map


#include<iostream>
#include<hash_map>

using namespace std;


void main()
{
    hash_map<char*,int> mymap;
    mymap["师长"] = 8;
    mymap["旅长"] = 7;
    mymap["团长"] = 6;
    mymap["司令"] = 10;
    mymap["军长"] = 9;
    mymap["军长"] = 9;
    mymap["军长"] = 19;// 以军长为准 只有一个
    
    for (auto i : mymap)
    {
        cout << i.first << "  " << i.second << endl;
    }
    

    for (auto ib=mymap.begin().ie=mymap.end();ib!=ie;ib++ )
    {
        cout << (*ib).first << " " << (*ib).second << endl;
    }
    

    auto it = mymap.find("师长");
    if (it != mymap.end())
    {
        cout << (*it).first << " " << (*it).second << endl;
    }


    cin.get();
}