unordered_multimap::rehash

项目
06/09/2015

重新生成哈希表。

void rehash(size_type nbuckets);

参数

nbuckets
存储桶的请求数。

备注

成员函数修改存储桶的数量是至少 nbuckets 并重新生成哈希表根据需要。

示例

// std_tr1__unordered_map__unordered_multimap_rehash.cpp 
// compile with: /EHsc 
#include <unordered_map> 
#include <iostream> 
 
typedef std::unordered_multimap<char, int> Mymap; 
int main() 
    { 
    Mymap c1; 
 
    c1.insert(Mymap::value_type('a', 1)); 
    c1.insert(Mymap::value_type('b', 2)); 
    c1.insert(Mymap::value_type('c', 3)); 
 
// display contents " [c 3] [b 2] [a 1]" 
    for (Mymap::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << it->first << ", " << it->second << "]"; 
    std::cout << std::endl; 
 
// inspect current parameters 
    std::cout << "bucket_count() == " << c1.bucket_count() << std::endl; 
    std::cout << "load_factor() == " << c1.load_factor() << std::endl; 
    std::cout << "max_load_factor() == " << c1.max_load_factor() << std::endl; 
    std::cout << std::endl; 
 
// change max_load_factor and redisplay 
    c1.max_load_factor(0.10f); 
    std::cout << "bucket_count() == " << c1.bucket_count() << std::endl; 
    std::cout << "load_factor() == " << c1.load_factor() << std::endl; 
    std::cout << "max_load_factor() == " << c1.max_load_factor() << std::endl; 
    std::cout << std::endl; 
 
// rehash and redisplay 
    c1.rehash(100); 
    std::cout << "bucket_count() == " << c1.bucket_count() << std::endl; 
    std::cout << "load_factor() == " << c1.load_factor() << std::endl; 
    std::cout << "max_load_factor() == " << c1.max_load_factor() << std::endl; 
 
    return (0); 
    }