Branch Coverage

/usr/include/c++/5/bits/stl_tree.h
Criterion Covered Total %
branch 27 80 33.7


line true false branch
107 0 0 while (__x->_M_left != 0) __x = __x->_M_left;
121 0 0 while (__x->_M_right != 0) __x = __x->_M_right;
368 0 0 if (_M_root)
372 0 0 if (_M_nodes->_M_left)
395 0 0 if (__node)
409 0 0 if (!_M_nodes)
414 0 0 if (_M_nodes)
416 0 0 if (_M_nodes->_M_right == __node)
420 0 0 if (_M_nodes->_M_left)
424 0 0 while (_M_nodes->_M_right)
427 0 0 if (_M_nodes->_M_left)
528 527 0 ::new(__node) _Rb_tree_node<_Val>;
0 0 ::new(__node) _Rb_tree_node<_Val>;
529 527 0 _Alloc_traits::construct(_M_get_Node_allocator(),
0 0 _Alloc_traits::construct(_M_get_Node_allocator(),
1388 17 0 if (_Alloc_traits::_S_propagate_on_move_assign()
1393 17 0 if (__x._M_root() != nullptr)
1404 0 0 if (__x._M_root() != nullptr)
1579 0 0 if (__x->_M_right)
1580 0 0 __top->_M_right = _M_copy(_S_right(__x), __top, __node_gen);
1584 0 0 while (__x != 0)
1586 0 0 _Link_type __y = _M_clone_node(__x, __node_gen);
1589 0 0 if (__x->_M_right)
1590 0 0 __y->_M_right = _M_copy(_S_right(__x), __y, __node_gen);
1596 0 0 {
1610 510 561 while (__x != 0)
1807 1989 527 while (__x != 0)
1810 1989 0 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
1989 0 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
1811 714 1275 __x = __comp ? _S_left(__x) : _S_right(__x);
1814 272 255 if (__comp)
1816 102 170 if (__j == begin())
1821 425 0 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
425 0 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
408 17 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
2074 255 238 _S_key(__p)));
2128 527 0 auto __res = _M_get_insert_unique_pos(_S_key(__z));
527 0 auto __res = _M_get_insert_unique_pos(_S_key(__z));
2129 510 17 if (__res.second)
2130 510 0 return _Res(_M_insert_node(__res.first, __res.second, __z), true);