Branch Coverage

/usr/include/c++/5/bits/hashtable.h
Criterion Covered Total %
branch 38 52 73.0


line true false branch
341 0 44 if (__builtin_expect(__n == 1, false))
353 26 44 if (_M_uses_single_bucket(__bkts))
633 67 2602 if (__before_n)
726 1301 0 { return _M_emplace(__unique_keys(), std::forward<_Args>(__args)...); }
1308 67 1301 return __p ? iterator(__p) : end();
1427 1332 1337 if (!__prev_p)
1433 67 1878 if (this->_M_equals(__k, __code, __p))
1436 1850 28 if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n)
1242 608 if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n)
1270 608 if (!__p->_M_nxt || _M_bucket_index(__p->_M_next()) != __n)
1452 628 673 if (_M_buckets[__bkt])
1466 646 27 if (__node->_M_nxt)
1531 1301 0 __code = this->_M_hash_code(__k);
1534 0 0 {
1540 0 1301 if (__node_type* __p = _M_find_node(__bkt, __k, __code))
1548 1301 0 return std::make_pair(_M_insert_unique_node(__bkt, __code, __node),
1594 1301 0 = _M_rehash_policy._M_need_rehash(_M_bucket_count, _M_element_count, 1);
1598 44 1257 if (__do_rehash.first)
1600 44 0 _M_rehash(__do_rehash.second, __saved_state);
1601 44 0 __bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code);
44 0 __bkt = _M_bucket_index(this->_M_extract()(__node->_M_v()), __code);
1612 0 0 {
1953 44 0 _M_rehash_aux(__n, __unique_keys());
1978 1625 44 while (__p)
1982 1288 337 if (!__new_buckets[__bkt])
1987 1270 18 if (__p->_M_nxt)