#include <string>

 #include <iostream>

 //查询性能最高(不允许重复数据)

 #include <unordered_set>

 using namespace std;

 void main()

 {

     unordered_set<string> myset{"move","jump","hello"};

     //删除hash表第一个

     //myset.erase(myset.begin());

     //删除某一个

     myset.erase("move");

     myset.insert("hel1");

     for (auto i : myset)

     {

         cout << i << endl;

     }

     for (auto ib = myset.begin(), ie = myset.end(); ib != ie; ib++)

     {

         cout << *ib << endl;

     }

     //哈希表长度

     cout << myset.bucket_count() << endl;

     //输出hash表内存结构

     for (int i = ; i < myset.bucket_count(); i++)

     {

         cout << "bucket" << i << ": ";

         for (auto it = myset.begin(i); it != myset.end(i); it++)

         {

             cout << " " << *it;

         }

         cout << endl;

     }

     //最大大小

     cout << myset.max_size() << endl;

     //当前大小

     cout << myset.size() << endl;

     cin.get();

 }