| line |
true |
false |
branch |
|
528
|
8091 |
0 |
::new(__node) _Rb_tree_node<_Val>; |
|
529
|
8091 |
0 |
_Alloc_traits::construct(_M_get_Node_allocator(), |
|
1610
|
7830 |
8091 |
while (__x != 0) |
|
1807
|
30537 |
8091 |
while (__x != 0) |
|
1810
|
30537 |
0 |
__comp = _M_impl._M_key_compare(__k, _S_key(__x)); |
|
|
30537 |
0 |
__comp = _M_impl._M_key_compare(__k, _S_key(__x)); |
|
1811
|
10962 |
19575 |
__x = __comp ? _S_left(__x) : _S_right(__x); |
|
1814
|
4176 |
3915 |
if (__comp) |
|
1816
|
1566 |
2610 |
if (__j == begin()) |
|
1821
|
6525 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
|
6525 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
|
6264 |
261 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
2074
|
3915 |
3654 |
_S_key(__p))); |
|
2128
|
8091 |
0 |
auto __res = _M_get_insert_unique_pos(_S_key(__z)); |
|
|
8091 |
0 |
auto __res = _M_get_insert_unique_pos(_S_key(__z)); |
|
2129
|
7830 |
261 |
if (__res.second) |
|
2130
|
7830 |
0 |
return _Res(_M_insert_node(__res.first, __res.second, __z), true); |