| line |
true |
false |
branch |
|
341
|
0 |
34 |
if (__builtin_expect(__n == 1, false)) |
|
353
|
18 |
34 |
if (_M_uses_single_bucket(__bkts)) |
|
633
|
64 |
2578 |
if (__before_n) |
|
726
|
1289 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
1308
|
64 |
1289 |
return __p ? iterator(__p) : end(); |
|
1427
|
1308 |
1334 |
if (!__prev_p) |
|
1433
|
64 |
1879 |
if (this->_M_equals(__k, __code, __p)) |
|
1436
|
1851 |
28 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
1242 |
609 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
|
1270 |
609 |
if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n) |
|
1452
|
628 |
661 |
if (_M_buckets[__bkt]) |
|
1466
|
643 |
18 |
if (__node->_M_nxt) |
|
1531
|
1289 |
0 |
__code = this->_M_hash_code(__k); |
|
1534
|
0 |
0 |
{ |
|
1540
|
0 |
1289 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
1548
|
1289 |
0 |
return std::make_pair(_M_insert_unique_node(__bkt, __code, __node), |
|
1594
|
1289 |
0 |
= _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1); |
|
1598
|
34 |
1255 |
if (__do_rehash.first) |
|
1600
|
34 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1601
|
34 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
|
34 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
1612
|
0 |
0 |
{ |
|
1953
|
34 |
0 |
_M_rehash_aux(__n, __unique_keys()); |
|
1978
|
1624 |
34 |
while (__p) |
|
1982
|
1287 |
337 |
if (!__new_buckets[__bkt]) |
|
1987
|
1270 |
17 |
if (__p->_M_nxt) |