| line |
true |
false |
branch |
|
341
|
0 |
0 |
if (__builtin_expect(__n == 1, false)) |
|
|
0 |
12 |
if (__builtin_expect(__n == 1, false)) |
|
347
|
12 |
0 |
return __hashtable_alloc::_M_allocate_buckets(__n); |
|
446
|
0 |
4 |
__key_extract(), __a) |
|
|
0 |
4 |
__key_extract(), __a) |
|
|
0 |
4 |
__key_extract(), __a) |
|
633
|
68 |
1228 |
if (__before_n) |
|
788
|
2 |
0 |
return __n ? static_cast<__node_type*>(__n->_M_nxt) : nullptr; |
|
829
|
12 |
0 |
__bucket_hint)); |
|
831
|
12 |
0 |
if (__bkt_count > _M_bucket_count) |
|
839
|
1296 |
12 |
for (; __f != __l; ++__f) |
|
1340
|
2 |
0 |
if (!__p) |
|
1346
|
1 |
1 |
if (this->_M_equals(__k, __code, __p)) |
|
1348
|
1 |
0 |
else if (__result) |
|
1353
|
1 |
1 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
1 |
0 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
0 |
2 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1427
|
484 |
812 |
if (!__prev_p) |
|
1433
|
560 |
68 |
if (this->_M_equals(__k, __code, __p)) |
|
1436
|
552 |
8 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
408 |
144 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
144 |
416 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1452
|
416 |
812 |
if (_M_buckets[__bkt]) |
|
1466
|
800 |
12 |
if (__node->_M_nxt) |
|
1598
|
0 |
1228 |
if (__do_rehash.first) |
|
1600
|
0 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1700
|
68 |
1228 |
if (__n) |
|
1953
|
0 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
1978
|
0 |
0 |
while (__p) |
|
1982
|
0 |
0 |
if (!__new_buckets[__bkt]) |
|
1987
|
0 |
0 |
if (__p->_M_nxt) |