Branch Coverage

/usr/include/c++/5/bits/hashtable_policy.h
Criterion Covered Total %
branch 13 146 8.9


line true false branch
135 0 0 if (_M_nodes)
0 0 if (_M_nodes)
0 0 if (_M_nodes)
0 0 if (_M_nodes)
0 0 if (_M_nodes)
0 0 if (_M_nodes)
595 0 0 if (!__p)
4 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
620 0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
20 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
645 0 0 if (!__p)
0 0 if (!__p)
0 0 if (!__p)
664 0 0 if (!__p)
715 0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
648 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
0 0 return __h._M_insert(__v, __node_gen, __unique_keys());
812 0 0 return __h._M_insert(std::move(__v), __node_gen, __unique_keys());
1982 0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
23 8 while (__n)
614 6 while (__n)
0 6 while (__n)
0 2 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
0 0 while (__n)
4 2 while (__n)
20 1 while (__n)