| line |
true |
false |
branch |
|
86
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
|
0 |
0 |
if (__x) |
|
148
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
|
0 |
0 |
if (_M_offset++ == int(_S_word_bit) - 1) |
|
158
|
0 |
0 |
if (_M_offset-- == 0) |
|
|
0 |
0 |
if (_M_offset-- == 0) |
|
171
|
0 |
0 |
if (__n < 0) |
|
181
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
|
0 |
0 |
{ return _M_p == __i._M_p && _M_offset == __i._M_offset; } |
|
393
|
0 |
0 |
for (; __first != __last; ++__first) |
|
400
|
0 |
0 |
if (__first._M_p != __last._M_p) |
|
402
|
0 |
0 |
std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); |
|
444
|
0 |
0 |
if (_M_end_of_storage) |
|
|
0 |
0 |
if (_M_end_of_storage) |
|
|
0 |
0 |
if (_M_end_of_storage) |
|
|
0 |
0 |
if (_M_end_of_storage) |
|
|
0 |
0 |
if (_M_end_of_storage) |
|
497
|
0 |
0 |
if (_M_impl._M_start._M_p) |
|
595
|
0 |
0 |
_M_initialize(__n); |
|
596
|
0 |
0 |
std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_addr(), |
|
923
|
0 |
0 |
if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr()) |
|
1034
|
0 |
0 |
if (__new_size < size()) |
|
1242
|
0 |
0 |
if (max_size() - size() < __n) |
|
1246
|
0 |
0 |
return (__len < size() || __len > max_size()) ? max_size() : __len; |
|
|
0 |
0 |
return (__len < size() || __len > max_size()) ? max_size() : __len; |