大挪耗

c++unordered_map容器

#include "iostream"
  #include "unordered_map"

using namespace std;

template<class K,class V>
using umap=std::unordered_map<K,V>;

int main()
{
     //1)map();//创建空的map容器
     umap<int,string> m1;
    //2)map(initialyzer_list<paie<K,V>>il);//使用统一初始化列表。
    umap<int,string>m2({{8,"冰冰"},{3,"西施"},{1,"幂幂"},{7,"金莲"},{5,"西瓜"}});
    umap<int,string> m;
//    cout << m.bucket_count() <<endl;//空容器用8个通。
//    size_t itmp=m.bucket_count();
//    for (int ii = 0; ii < 200000; ++ii) {//插入容器中插入若干记录。
//        char  name[50];
//        sprintf_s(name,"西施%d",ii);
//        m.emplace(ii,name);
//        if(itmp!=m.bucket_count()){//如果桶自动扩展,显示日志、
//            cout<<m.bucket_count()<<endl;
//            itmp=m.bucket_count();
//        }
//    }



    m.max_load_factor(2);
    cout<<"最大装填因子:"<<m.max_load_factor()<<endl;

    m.insert({{1,"西施一"},{2,"西施2"},{3,"西施3"},{3,"西施4"}});
    cout<<"当前桶数:"<<m.bucket_count()<<endl;
    cout<<"当前装填因子:"<<m.load_factor()<<endl;

    m.insert({{5,"西施5"},{6,"西施6"},{7,"西施7"},{8,"西施8"}});
    cout<<"当前桶数:"<<m.bucket_count()<<endl;
    cout<<"当前装填因子:"<<m.load_factor()<<endl;

    m.insert({{15,"西施5"},{16,"西施6"},{17,"西施7"},{18,"西施8"}});
    m.insert({{25,"西施5"},{26,"西施6"},{27,"西施7"},{28,"西施8"}});
    m.emplace(9,"西瓜");
    cout<<"当前桶数:"<<m.bucket_count()<<endl;
    cout<<"当前装填因子:"<<m.load_factor()<<endl;



    for (auto it= m.begin(); it !=m.end() ; it++) {//遍历整个容器.
    cout<<it->first<<","<<it->second<<" ";
    }
    cout<<endl;

    for (int  ii= 0; ii <m.bucket_count() ;ii ++) {//遍历全部的桶.
        cout<<"桶"<<ii<<": ";
        for (auto it = m.begin(ii); it !=m.end(ii) ; ++it) {
        cout<<it->first<<","<<it->second<<" ";
        cout<<endl;
        }
    }

    m.insert({{15,"西施5"},{16,"西施6"},{17,"西施7"},{18,"西施8"}});
    m.insert({{25,"西施5"},{26,"西施6"},{27,"西施7"},{28,"西施8"}});

    for (int  ii= 0; ii <m.bucket_count() ;ii ++) {//遍历全部的桶.
        cout<<"桶"<<ii<<": ";
        for (auto it = m.begin(ii); it !=m.end(ii) ; ++it) {
            cout<<it->first<<","<<it->second<<" ";
            cout<<endl;
        }
    }

    cout<<"开始创建umap: "<<time(0)<<endl;
    umap<int,string> mm(10000000);
    for (int ii = 0; ii < 10000000; ii++) {
        //mm.insert({ii,"西施。"});
        mm.emplace(ii,"西施。");
    }
    cout<<"创建umap完成: "<<time(0)<<endl;
    return 0;
    mm.insert({{1,"西施一"},{2,"西施2"},{3,"西施3"},{3,"西施4"}});


}

最大装填因子:2
当前桶数:7
当前装填因子:0.428571
当前桶数:7
当前装填因子:1
当前桶数:17
当前装填因子:0.941176
28,西施8 15,西施5 2,西施2 16,西施6 3,西施3 17,西施7 5,西施5 9,西瓜 26,西施6 6,西施6 27,西施7 7,西施7 1,西施一 18,西施8 8
,西施8 25,西施5
桶0: 17,西施7
桶1: 1,西施一
18,西施8
桶2: 2,西施2
桶3: 3,西施3
桶4: 桶5: 5,西施5
桶6: 6,西施6
桶7: 7,西施7
桶8: 8,西施8
25,西施5
桶9: 9,西瓜
26,西施6
桶10: 27,西施7
桶11: 28,西施8
桶12: 桶13: 桶14: 桶15: 15,西施5
桶16: 16,西施6
桶0: 17,西施7
桶1: 1,西施一
18,西施8
桶2: 2,西施2
桶3: 3,西施3
桶4: 桶5: 5,西施5
桶6: 6,西施6
桶7: 7,西施7
桶8: 8,西施8
25,西施5
桶9: 9,西瓜
26,西施6
桶10: 27,西施7
桶11: 28,西施8
桶12: 桶13: 桶14: 桶15: 15,西施5
桶16: 16,西施6
开始创建umap: 1711781934
创建umap完成: 1711781935


已发布

分类

可以收藏大挪耗一下。下载麻烦点城通网盘,站长保证下载速度,不会限速的,放心点就是了;分卷,安卓下载为txt:程序下载为url,不会下载参考不会下载。如果你想让本站活的久一点,请直接捐助

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注