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.
[編集] も参照してください
| の少なくとも指定された数の要素分の領域を確保します。 この操作はハッシュテーブルを再構成します. (パブリックメンバ関数) | |
