boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2026-05-04 11:44:19 +02:00
Code Issues Packages Projects Releases Wiki Activity

It is currently proposed that insert, erase and rehash should be stable. Change insert(hint, value) so that it inserts at the end of a group of

Browse Source 
equivalent keys (all the other functions were already stable).


[SVN r4146]
This commit is contained in:
Daniel James
2007-05-20 17:37:27 +00:00
parent bd1477fa25
commit ef2f5116dd
4 changed files with 84 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/boost/unordered/detail/hash_table_impl.hpp
+8 -1
View File
@@ -1561,6 +1561,13 @@ namespace boost {
return insert(v);
}
else {
// Find the first node in the group - so that the node
// will be inserted at the end of the group.
local_iterator_base start(it.local_);
while(prev_in_group(start.node_)->next_ == start.node_)
start.node_ = prev_in_group(start.node_);
// Create the node before rehashing in case it throws an
// exception (need strong safety in such a case).
node_constructor a(this->allocators_);
@@ -1574,7 +1581,7 @@ namespace boost {
// Nothing after this point can throw
link_ptr n = a.release();
this->link_node(n, it.local_);
this->link_node(n, start);
return iterator_base(base, n);
}