| line |
true |
false |
branch |
|
341
|
0 |
0 |
if (__builtin_expect(__n == 1, false)) |
|
353
|
0 |
0 |
if (_M_uses_single_bucket(__bkts)) |
|
633
|
0 |
0 |
if (__before_n) |
|
726
|
0 |
0 |
{ return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); } |
|
860
|
0 |
0 |
if (&__ht == this) |
|
863
|
0 |
0 |
if (__node_alloc_traits::_S_propagate_on_copy_assign()) |
|
867
|
0 |
0 |
if (!__node_alloc_traits::_S_always_equal() |
|
882
|
0 |
0 |
_M_assign(__ht, |
|
903
|
0 |
0 |
if (_M_bucket_count != __ht._M_bucket_count) |
|
920
|
0 |
0 |
_M_assign(__ht, |
|
923
|
0 |
0 |
if (__former_buckets) |
|
924
|
0 |
0 |
_M_deallocate_buckets(__former_buckets, __former_bucket_count); |
|
927
|
0 |
0 |
{ |
|
930
|
0 |
0 |
// Restore previous buckets. |
|
954
|
0 |
0 |
if (!_M_buckets) |
|
|
0 |
0 |
if (!_M_buckets) |
|
|
0 |
0 |
if (!_M_buckets) |
|
959
|
0 |
0 |
if (!__ht._M_before_begin._M_nxt) |
|
|
0 |
0 |
if (!__ht._M_before_begin._M_nxt) |
|
|
0 |
0 |
if (!__ht._M_before_begin._M_nxt) |
|
965
|
0 |
0 |
__node_type* __this_n = __node_gen(__ht_n); |
|
|
0 |
0 |
__node_type* __this_n = __node_gen(__ht_n); |
|
|
0 |
0 |
__node_type* __this_n = __node_gen(__ht_n); |
|
972
|
0 |
0 |
for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next()) |
|
|
0 |
0 |
for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next()) |
|
|
0 |
0 |
for (__ht_n = __ht_n->_M_next(); __ht_n; __ht_n = __ht_n->_M_next()) |
|
974
|
0 |
0 |
__this_n = __node_gen(__ht_n); |
|
|
0 |
0 |
__this_n = __node_gen(__ht_n); |
|
|
0 |
0 |
__this_n = __node_gen(__ht_n); |
|
984
|
0 |
0 |
{ |
|
|
0 |
0 |
{ |
|
|
0 |
0 |
{ |
|
1112
|
0 |
0 |
_M_rehash_policy(__ht._M_rehash_policy) |
|
1114
|
0 |
0 |
_M_assign(__ht, |
|
1137
|
0 |
0 |
if (__ht._M_uses_single_bucket()) |
|
1145
|
0 |
0 |
if (_M_begin()) |
|
1427
|
0 |
0 |
if (!__prev_p) |
|
1433
|
0 |
0 |
if (this->_M_equals(__k, __code, __p)) |
|
1436
|
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) |
|
1452
|
0 |
0 |
if (_M_buckets[__bkt]) |
|
1466
|
0 |
0 |
if (__node->_M_nxt) |
|
1531
|
0 |
0 |
__code = this->_M_hash_code(__k); |
|
1534
|
0 |
0 |
{ |
|
1540
|
0 |
0 |
if (__node_type* __p = _M_find_node(__bkt, __k, __code)) |
|
1548
|
0 |
0 |
return std::make_pair(_M_insert_unique_node(__bkt, __code, __node), |
|
1594
|
0 |
0 |
= _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1); |
|
1598
|
0 |
0 |
if (__do_rehash.first) |
|
1600
|
0 |
0 |
_M_rehash(__do_rehash.second, __saved_state); |
|
1601
|
0 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
|
0 |
0 |
__bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code); |
|
1612
|
0 |
0 |
{ |
|
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) |