C++ unordered_map桶增长规律

 1 #include <iostream>
 2 #include <string>
 3 #include <unordered_map>
 4 using namespace std;
 5 
 6 int main()
 7 {  
 8     unordered_map<int , string> ump;
 9     for(int i=0; i<190; i++)
10     {
11         ump.insert(pair<int, string>(i, "amy"));
12         cout << "插入 " << i << " - ";
13         cout << "桶数量" << ump.bucket_count() << " - ";
14         cout << "最大桶数量" << ump.bucket_count() << endl;
15     }
16     return 0;
17 }