reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
140 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) 140 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) 143 this->_M_impl._M_start._M_cur - 1, 145 --this->_M_impl._M_start._M_cur; 187 if (__position._M_cur == this->_M_impl._M_start._M_cur) 190 return this->_M_impl._M_start; 307 if (__pos._M_cur == this->_M_impl._M_start._M_cur) 312 std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start, 314 this->_M_impl._M_start = __new_start; 319 this->_M_impl._M_start._M_node); 396 for (__cur = this->_M_impl._M_start._M_node; 407 std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), 450 for (__cur_node = this->_M_impl._M_start._M_node; 466 std::_Destroy(this->_M_impl._M_start, 522 *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node(); 525 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node 525 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node 527 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; 527 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; 530 this->_M_impl._M_start._M_cur, 538 ++this->_M_impl._M_start; 539 _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1)); 566 this->_M_impl._M_start._M_cur); 567 _M_deallocate_node(this->_M_impl._M_start._M_first); 568 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); 568 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); 569 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; 569 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; 590 if (__pos._M_cur == this->_M_impl._M_start._M_cur) 597 this->_M_impl._M_start = __new_start; 602 this->_M_impl._M_start._M_node); 642 difference_type __index = __pos - this->_M_impl._M_start; 646 iterator __front1 = this->_M_impl._M_start; 650 __pos = this->_M_impl._M_start + __index; 662 __pos = this->_M_impl._M_start + __index; 674 const difference_type __elems_before = __pos - this->_M_impl._M_start; 680 iterator __old_start = this->_M_impl._M_start; 681 __pos = this->_M_impl._M_start + __elems_before; 686 iterator __start_n = (this->_M_impl._M_start 688 std::__uninitialized_move_a(this->_M_impl._M_start, 691 this->_M_impl._M_start = __new_start; 697 std::__uninitialized_move_fill(this->_M_impl._M_start, 699 this->_M_impl._M_start, 702 this->_M_impl._M_start = __new_start; 709 this->_M_impl._M_start._M_node); 762 const difference_type __elemsbefore = __pos - this->_M_impl._M_start; 767 iterator __old_start = this->_M_impl._M_start; 768 __pos = this->_M_impl._M_start + __elemsbefore; 773 iterator __start_n = (this->_M_impl._M_start 775 std::__uninitialized_move_a(this->_M_impl._M_start, 778 this->_M_impl._M_start = __new_start; 786 std::__uninitialized_move_copy(this->_M_impl._M_start, 790 this->_M_impl._M_start = __new_start; 797 this->_M_impl._M_start._M_node); 880 *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node(); 885 _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j)); 921 = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1; 930 if (__new_nstart < this->_M_impl._M_start._M_node) 931 std::copy(this->_M_impl._M_start._M_node, 935 std::copy_backward(this->_M_impl._M_start._M_node, 948 std::copy(this->_M_impl._M_start._M_node, 957 this->_M_impl._M_start._M_set_node(__new_nstart);usr/include/c++/7.4.0/bits/stl_deque.h
579 swap(this->_M_start, __x._M_start); 579 swap(this->_M_start, __x._M_start); 665 _M_destroy_nodes(this->_M_impl._M_start._M_node, 710 this->_M_impl._M_start._M_set_node(__nstart); 712 this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first; 712 this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first; 951 this->_M_impl._M_start, 1167 { return this->_M_impl._M_start; } 1175 { return this->_M_impl._M_start; } 1220 { return reverse_iterator(this->_M_impl._M_start); } 1238 { return this->_M_impl._M_start; } 1272 { return this->_M_impl._M_finish - this->_M_impl._M_start; } 1358 { return this->_M_impl._M_finish == this->_M_impl._M_start; } 1376 return this->_M_impl._M_start[difference_type(__n)]; 1394 return this->_M_impl._M_start[difference_type(__n)]; 1507 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) 1507 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) 1510 this->_M_impl._M_start._M_cur - 1, 1512 --this->_M_impl._M_start._M_cur; 1581 if (this->_M_impl._M_start._M_cur 1582 != this->_M_impl._M_start._M_last - 1) 1585 this->_M_impl._M_start._M_cur); 1586 ++this->_M_impl._M_start._M_cur; 2080 _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node); 2081 this->_M_impl._M_start = __pos; 2115 const size_type __vacancies = this->_M_impl._M_start._M_cur 2116 - this->_M_impl._M_start._M_first; 2119 return this->_M_impl._M_start - difference_type(__n); 2159 if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node