boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 20:04:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

Add erase_node() function to table, creating an optimizer-friendly function

Browse Source
This commit is contained in:
Christian Mazakas
2022-07-25 11:35:23 -07:00
parent 3abe5de533
commit 91e78fd746
1 changed files with 17 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
include/boost/unordered/detail/implementation.hpp
View File

@@ -2928,6 +2928,23 @@ namespace boost {
return 1; return 1;
} }
iterator erase_node(c_iterator pos) {
c_iterator next = pos;
++next;
bucket_iterator itb = pos.itb;
node_pointer* pp = boost::addressof(itb->next);
while (*pp != pos.p) {
pp = boost::addressof((*pp)->next);
}
buckets_.extract_node_after(itb, pp);
this->delete_node(pos.p);
--size_;
return iterator(next.p, next.itb);
}
iterator erase_nodes_range(c_iterator first, c_iterator last) iterator erase_nodes_range(c_iterator first, c_iterator last)
{ {
if (first == last) { if (first == last) {