| line |
true |
false |
branch |
|
528
|
4 |
0 |
::new(__node) _Rb_tree_node<_Val>; |
|
529
|
4 |
0 |
_Alloc_traits::construct(_M_get_Node_allocator(), |
|
1610
|
4 |
5 |
while (__x != 0) |
|
1627
|
25 |
15 |
while (__x != 0) |
|
1628
|
17 |
8 |
if (!_M_impl._M_key_compare(_S_key(__x), __k)) |
|
1807
|
5 |
4 |
while (__x != 0) |
|
1810
|
5 |
0 |
__comp = _M_impl._M_key_compare(__k, _S_key(__x)); |
|
1811
|
3 |
2 |
__x = __comp ? _S_left(__x) : _S_right(__x); |
|
1814
|
2 |
2 |
if (__comp) |
|
1816
|
2 |
0 |
if (__j == begin()) |
|
1821
|
2 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
|
2 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
2074
|
1 |
2 |
_S_key(__p))); |
|
2128
|
4 |
0 |
auto __res = _M_get_insert_unique_pos(_S_key(__z)); |
|
|
4 |
0 |
auto __res = _M_get_insert_unique_pos(_S_key(__z)); |
|
2129
|
4 |
0 |
if (__res.second) |
|
2130
|
4 |
0 |
return _Res(_M_insert_node(__res.first, __res.second, __z), true); |
|
2295
|
15 |
0 |
iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); |
|
2296
|
0 |
15 |
return (__j == end() |
|
|
0 |
0 |
return (__j == end() |
|
2298
|
14 |
1 |
_S_key(__j._M_node))) ? end() : __j; |