Name |
Last commit
|
Last update |
---|---|---|
.. | ||
array | ||
bitset | ||
deque | ||
forward_list | ||
headers | ||
list | ||
map | ||
multimap | ||
multiset | ||
priority_queue | ||
queue | ||
set | ||
stack | ||
unordered_map | ||
unordered_multimap | ||
unordered_multiset | ||
unordered_set | ||
vector |
2018-09-18 François Dumont <fdumont@gcc.gnu.org> PR libstdc++/87135 * src/c++11/hashtable_c++0x.cc: (_Prime_rehash_policy::_M_next_bkt): Return a prime no smaller than requested size, but not necessarily greater. (_Prime_rehash_policy::_M_need_rehash): Rehash only if target size is strictly greater than next resize threshold. * testsuite/23_containers/unordered_map/modifiers/reserve.cc: Adapt test to validate that there is no rehash as long as number of insertion is lower or equal to the reserved number of elements. From-SVN: r264413
Name |
Last commit
|
Last update |
---|---|---|
.. | ||
array | Loading commit data... | |
bitset | Loading commit data... | |
deque | Loading commit data... | |
forward_list | Loading commit data... | |
headers | Loading commit data... | |
list | Loading commit data... | |
map | Loading commit data... | |
multimap | Loading commit data... | |
multiset | Loading commit data... | |
priority_queue | Loading commit data... | |
queue | Loading commit data... | |
set | Loading commit data... | |
stack | Loading commit data... | |
unordered_map | Loading commit data... | |
unordered_multimap | Loading commit data... | |
unordered_multiset | Loading commit data... | |
unordered_set | Loading commit data... | |
vector | Loading commit data... |