| line |
true |
false |
branch |
|
502
|
1325 |
0 |
{ get_allocator().construct(__node->_M_valptr(), __x); } |
|
|
1325 |
0 |
{ get_allocator().construct(__node->_M_valptr(), __x); } |
|
|
1325 |
0 |
{ get_allocator().construct(__node->_M_valptr(), __x); } |
|
504
|
0 |
0 |
{ |
|
520
|
1325 |
0 |
{ get_allocator().destroy(__p->_M_valptr()); } |
|
858
|
1724 |
0 |
{ _M_erase(_M_begin()); } |
|
984
|
1325 |
0 |
return _M_insert_unique_(__pos, __x, __an); |
|
1506
|
469 |
0 |
|| _M_impl._M_key_compare(_KeyOfValue()(__v), |
|
|
856 |
469 |
|| _M_impl._M_key_compare(_KeyOfValue()(__v), |
|
|
0 |
0 |
|| _M_impl._M_key_compare(_KeyOfValue()(__v), |
|
1507
|
469 |
0 |
_S_key(__p))); |
|
|
0 |
469 |
_S_key(__p))); |
|
1610
|
1325 |
3049 |
while (__x != 0) |
|
1627
|
5712 |
5964 |
while (__x != 0) |
|
1628
|
3212 |
2500 |
if (!_M_impl._M_key_compare(_S_key(__x), __k)) |
|
1807
|
0 |
807 |
while (__x != 0) |
|
1810
|
0 |
0 |
__comp = _M_impl._M_key_compare(__k, _S_key(__x)); |
|
|
0 |
0 |
__comp = _M_impl._M_key_compare(__k, _S_key(__x)); |
|
1811
|
0 |
0 |
__x = __comp ? _S_left(__x) : _S_right(__x); |
|
1814
|
807 |
0 |
if (__comp) |
|
1816
|
807 |
0 |
if (__j == begin()) |
|
1821
|
0 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
|
0 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
|
0 |
0 |
if (_M_impl._M_key_compare(_S_key(__j._M_node), __k)) |
|
1910
|
1269 |
56 |
if (__pos._M_node == _M_end()) |
|
1912
|
462 |
807 |
if (size() > 0 |
|
|
462 |
0 |
if (size() > 0 |
|
|
462 |
807 |
if (size() > 0 |
|
1913
|
462 |
0 |
&& _M_impl._M_key_compare(_S_key(_M_rightmost()), __k)) |
|
|
462 |
0 |
&& _M_impl._M_key_compare(_S_key(_M_rightmost()), __k)) |
|
1916
|
807 |
0 |
return _M_get_insert_unique_pos(__k); |
|
1918
|
56 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node))) |
|
|
56 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node))) |
|
|
56 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node))) |
|
1922
|
42 |
14 |
if (__pos._M_node == _M_leftmost()) // begin() |
|
1924
|
14 |
0 |
else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k)) |
|
|
14 |
0 |
else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k)) |
|
|
14 |
0 |
else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k)) |
|
1926
|
7 |
7 |
if (_S_right(__before._M_node) == 0) |
|
1932
|
0 |
0 |
return _M_get_insert_unique_pos(__k); |
|
1934
|
0 |
0 |
else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k)) |
|
|
0 |
0 |
else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k)) |
|
|
0 |
0 |
else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k)) |
|
1938
|
0 |
0 |
if (__pos._M_node == _M_rightmost()) |
|
1940
|
0 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node))) |
|
|
0 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node))) |
|
|
0 |
0 |
else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node))) |
|
1942
|
0 |
0 |
if (_S_right(__pos._M_node) == 0) |
|
1948
|
0 |
0 |
return _M_get_insert_unique_pos(__k); |
|
1973
|
1325 |
0 |
= _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v)); |
|
1975
|
1325 |
0 |
if (__res.second) |
|
1978
|
1325 |
0 |
__node_gen); |
|
2295
|
4639 |
0 |
iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); |
|
2296
|
4639 |
0 |
return (__j == end() |
|
|
0 |
4639 |
return (__j == end() |
|
|
0 |
0 |
return (__j == end() |
|
2297
|
2716 |
0 |
|| _M_impl._M_key_compare(__k, |
|
2298
|
2716 |
1923 |
_S_key(__j._M_node))) ? end() : __j; |
|
|
2716 |
0 |
_S_key(__j._M_node))) ? end() : __j; |
|
|
1083 |
1633 |
_S_key(__j._M_node))) ? end() : __j; |
|
|
3006 |
0 |
_S_key(__j._M_node))) ? end() : __j; |