| line |
true |
false |
branch |
|
341
|
0 |
39 |
if (__builtin_expect(__n == 1, false)) |
|
353
|
13 |
39 |
if (_M_uses_single_bucket(__bkts)) |
|
633
|
50 |
252 |
if (__before_n) |
|
1308
|
50 |
135 |
return __p ? iterator(__p) : end(); |
|
1427
|
160 |
142 |
if (!__prev_p) |
|
1433
|
50 |
114 |
if (this->_M_equals(__k, __code, __p)) |
|
1436
|
58 |
56 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
36 |
22 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
92 |
22 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1452
|
13 |
104 |
if (_M_buckets[__bkt]) |
|
1466
|
91 |
13 |
if (__node->_M_nxt) |
|
1594
|
117 |
0 |
= _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1); |
|
1598
|
39 |
78 |
if (__do_rehash.first) |
|
1600
|
39 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1601
|
39 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
|
39 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
1612
|
0 |
0 |
{ |
|
1953
|
39 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
1978
|
65 |
39 |
while (__p) |
|
1982
|
39 |
26 |
if (!__new_buckets[__bkt]) |
|
1987
|
13 |
26 |
if (__p->_M_nxt) |