std::unordered_multiset::rehash
来自cppreference.com
< cpp | container | unordered multiset
 |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
| void rehash( size_type count ); |
（C++11 起） | |
Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor().
目录 |
[编辑] 参数
| count | - | new number of buckets |
[编辑] 返回值
（无）
Original:
(none)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 复杂性
平均情况下的线性尺寸的容器中，最坏的情况下二次.
Original:
average case linear in the size of the container, worst case quadratic.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[编辑] 另请参阅
| 保留空间至少指定数量的elements. This重新生成哈希表. Original: reserves space for at least the specified number of elements. This regenerates the hash table. The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. （公共成员函数） | |
