| line |
true |
false |
branch |
|
91
|
0 |
0 |
? size_t(_GLIBCXX_DEQUE_BUF_SIZE / __size) : size_t(1)); } |
|
188
|
0 |
0 |
if (_M_cur == _M_first) |
|
|
0 |
0 |
if (_M_cur == _M_first) |
|
490
|
0 |
0 |
{ _M_initialize_map(0); } |
|
|
0 |
0 |
{ _M_initialize_map(0); } |
|
512
|
0 |
0 |
_M_initialize_map(0); |
|
|
0 |
0 |
_M_initialize_map(0); |
|
513
|
0 |
0 |
if (__x._M_impl._M_map) |
|
|
0 |
0 |
if (__x._M_impl._M_map) |
|
519
|
0 |
0 |
__gnu_cxx::__allocator_always_compares_equal<_Alloc>{}) |
|
|
0 |
0 |
__gnu_cxx::__allocator_always_compares_equal<_Alloc>{}) |
|
615
|
0 |
0 |
return _Map_alloc_traits::allocate(__map_alloc, __n); |
|
|
0 |
0 |
return _Map_alloc_traits::allocate(__map_alloc, __n); |
|
662
|
0 |
0 |
if (this->_M_impl._M_map) |
|
|
0 |
0 |
if (this->_M_impl._M_map) |
|
700
|
0 |
0 |
{ _M_create_nodes(__nstart, __nfinish); } |
|
|
0 |
0 |
{ _M_create_nodes(__nstart, __nfinish); } |
|
725
|
0 |
0 |
for (__cur = __nstart; __cur < __nfinish; ++__cur) |
|
|
0 |
0 |
for (__cur = __nstart; __cur < __nfinish; ++__cur) |
|
726
|
0 |
0 |
*__cur = this->_M_allocate_node(); |
|
|
0 |
0 |
*__cur = this->_M_allocate_node(); |
|
741
|
0 |
0 |
for (_Map_pointer __n = __nstart; __n < __nfinish; ++__n) |
|
|
0 |
0 |
for (_Map_pointer __n = __nstart; __n < __nfinish; ++__n) |
|
1518
|
0 |
0 |
if (this->_M_impl._M_finish._M_cur |
|
|
0 |
0 |
if (this->_M_impl._M_finish._M_cur |
|
1572
|
0 |
0 |
if (this->_M_impl._M_finish._M_cur |
|
|
0 |
0 |
if (this->_M_impl._M_finish._M_cur |
|
2116
|
0 |
0 |
if (__nodes_to_add + 1 > this->_M_impl._M_map_size |
|
|
0 |
0 |
if (__nodes_to_add + 1 > this->_M_impl._M_map_size |