| line |
true |
false |
branch |
|
341
|
0 |
0 |
if (__builtin_expect(__n == 1, false)) |
|
|
0 |
0 |
if (__builtin_expect(__n == 1, false)) |
|
|
0 |
0 |
if (__builtin_expect(__n == 1, false)) |
|
|
0 |
10 |
if (__builtin_expect(__n == 1, false)) |
|
|
0 |
9 |
if (__builtin_expect(__n == 1, false)) |
|
347
|
9 |
0 |
return __hashtable_alloc::_M_allocate_buckets(__n); |
|
353
|
0 |
0 |
if (_M_uses_single_bucket(__bkts)) |
|
|
0 |
0 |
if (_M_uses_single_bucket(__bkts)) |
|
446
|
0 |
3 |
__key_extract(), __a) |
|
|
0 |
3 |
__key_extract(), __a) |
|
|
0 |
3 |
__key_extract(), __a) |
|
671
|
0 |
0 |
{ return _M_emplace(cend(), __uk, std::forward<_Args>(__args)...); } |
|
726
|
3 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
|
35 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
788
|
0 |
0 |
return __n ? static_cast<__node_type*>(__n->_M_nxt) : nullptr; |
|
829
|
9 |
0 |
__bucket_hint)); |
|
831
|
9 |
0 |
if (__bkt_count > _M_bucket_count) |
|
839
|
972 |
9 |
for (; __f != __l; ++__f) |
|
1137
|
0 |
0 |
if (__ht._M_uses_single_bucket()) |
|
1145
|
0 |
0 |
if (_M_begin()) |
|
1308
|
0 |
0 |
return __p ? iterator(__p) : end(); |
|
|
95 |
4 |
return __p ? iterator(__p) : end(); |
|
1340
|
0 |
0 |
if (!__p) |
|
1346
|
0 |
0 |
if (this->_M_equals(__k, __code, __p)) |
|
1348
|
0 |
0 |
else if (__result) |
|
1353
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1400
|
0 |
0 |
if (__p) |
|
1403
|
0 |
0 |
while (__p1 && _M_bucket_index(__p1) == __n |
|
|
0 |
0 |
while (__p1 && _M_bucket_index(__p1) == __n |
|
|
0 |
0 |
while (__p1 && _M_bucket_index(__p1) == __n |
|
|
0 |
0 |
while (__p1 && _M_bucket_index(__p1) == __n |
|
1427
|
363 |
609 |
if (!__prev_p) |
|
|
0 |
0 |
if (!__prev_p) |
|
|
0 |
0 |
if (!__prev_p) |
|
|
107 |
30 |
if (!__prev_p) |
|
1433
|
420 |
51 |
if (this->_M_equals(__k, __code, __p)) |
|
|
0 |
0 |
if (this->_M_equals(__k, __code, __p)) |
|
|
0 |
0 |
if (this->_M_equals(__k, __code, __p)) |
|
|
37 |
95 |
if (this->_M_equals(__k, __code, __p)) |
|
1436
|
414 |
6 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
306 |
108 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
108 |
312 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
32 |
5 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
7 |
25 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
25 |
12 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1452
|
312 |
609 |
if (_M_buckets[__bkt]) |
|
|
0 |
0 |
if (_M_buckets[__bkt]) |
|
|
0 |
0 |
if (_M_buckets[__bkt]) |
|
|
9 |
29 |
if (_M_buckets[__bkt]) |
|
1466
|
600 |
9 |
if (__node->_M_nxt) |
|
|
0 |
0 |
if (__node->_M_nxt) |
|
|
0 |
0 |
if (__node->_M_nxt) |
|
|
20 |
9 |
if (__node->_M_nxt) |
|
1540
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
3 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
35 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
1600
|
0 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
|
0 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
|
2 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1637
|
0 |
0 |
if (__do_rehash.first) |
|
1638
|
0 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1650
|
0 |
0 |
: _M_find_before_node(__bkt, __k, __code); |
|
|
0 |
0 |
: _M_find_before_node(__bkt, __k, __code); |
|
1651
|
0 |
0 |
if (__prev) |
|
1656
|
0 |
0 |
if (__builtin_expect(__prev == __hint, false)) |
|
1659
|
0 |
0 |
if (__node->_M_nxt |
|
|
0 |
0 |
if (__node->_M_nxt |
|
|
0 |
0 |
if (__node->_M_nxt |
|
1663
|
0 |
0 |
if (__next_bkt != __bkt) |
|
1700
|
51 |
921 |
if (__n) |
|
1935
|
8 |
0 |
if (__buckets != _M_bucket_count) |
|
1953
|
0 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
|
0 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
|
0 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
|
10 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
1978
|
0 |
0 |
while (__p) |
|
|
0 |
0 |
while (__p) |
|
|
1 |
10 |
while (__p) |
|
1982
|
0 |
0 |
if (!__new_buckets[__bkt]) |
|
|
0 |
0 |
if (!__new_buckets[__bkt]) |
|
|
1 |
0 |
if (!__new_buckets[__bkt]) |
|
1987
|
0 |
0 |
if (__p->_M_nxt) |
|
|
0 |
0 |
if (__p->_M_nxt) |
|
|
1 |
0 |
if (__p->_M_nxt) |
|
2024
|
0 |
0 |
while (__p) |
|
2029
|
0 |
0 |
if (__prev_p && __prev_bkt == __bkt) |
|
2046
|
0 |
0 |
if (__check_bucket) |
|
2050
|
0 |
0 |
if (__prev_p->_M_nxt) |
|
2055
|
0 |
0 |
if (__next_bkt != __prev_bkt) |
|
2061
|
0 |
0 |
if (!__new_buckets[__bkt]) |
|
2066
|
0 |
0 |
if (__p->_M_nxt) |
|
2081
|
0 |
0 |
if (__check_bucket && __prev_p->_M_nxt) |
|
|
0 |
0 |
if (__check_bucket && __prev_p->_M_nxt) |
|
2085
|
0 |
0 |
if (__next_bkt != __prev_bkt) |