libstdc++: [_Hashtable] Remove useless check for _M_before_begin node
When removing the first node of a bucket it is useless to check if this bucket is the one containing the _M_before_begin node. The bucket before-begin node is already transfered to the next pointed-to bucket regardeless if it is the container before-begin node. libstdc++-v3/ChangeLog: * include/bits/hashtable.h (_Hahstable<>::_M_remove_bucket_begin): Remove _M_before_begin check and cleanup implementation. Co-authored-by: Théo Papadopoulo <papadopoulo@gmail.com>
This commit is contained in:
parent
7f7d9c525c
commit
ec0a68b9ee
1 changed files with 4 additions and 9 deletions
|
@ -869,16 +869,11 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
|
|||
_M_remove_bucket_begin(size_type __bkt, __node_ptr __next_n,
|
||||
size_type __next_bkt)
|
||||
{
|
||||
if (!__next_n || __next_bkt != __bkt)
|
||||
if (!__next_n)
|
||||
_M_buckets[__bkt] = nullptr;
|
||||
else if (__next_bkt != __bkt)
|
||||
{
|
||||
// Bucket is now empty
|
||||
// First update next bucket if any
|
||||
if (__next_n)
|
||||
_M_buckets[__next_bkt] = _M_buckets[__bkt];
|
||||
|
||||
// Second update before begin node if necessary
|
||||
if (&_M_before_begin == _M_buckets[__bkt])
|
||||
_M_before_begin._M_nxt = __next_n;
|
||||
_M_buckets[__next_bkt] = _M_buckets[__bkt];
|
||||
_M_buckets[__bkt] = nullptr;
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Add table
Reference in a new issue