include/bits/stl_deque.h

467 	    std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
490 	iterator _M_start;
495 	  _M_start(), _M_finish()
500 	  _M_start(), _M_finish()
551 	  _M_destroy_nodes(this->_M_impl._M_start._M_node,
596       this->_M_impl._M_start._M_set_node(__nstart);
598       this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
651    *  - iterator    _M_start, _M_finish
800 				    this->_M_impl._M_start,
977       { return this->_M_impl._M_start; }
985       { return this->_M_impl._M_start; }
1030       { return reverse_iterator(this->_M_impl._M_start); }
1039       { return const_reverse_iterator(this->_M_impl._M_start); }
1048       { return this->_M_impl._M_start; }
1075       { return const_reverse_iterator(this->_M_impl._M_start); }
1082       { return this->_M_impl._M_finish - this->_M_impl._M_start; }
1105 	  _M_erase_at_end(this->_M_impl._M_start + difference_type(__new_size));
1123       { return this->_M_impl._M_finish == this->_M_impl._M_start; }
1139       { return this->_M_impl._M_start[difference_type(__n)]; }
1154       { return this->_M_impl._M_start[difference_type(__n)]; }
1255 	if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
1257 	    this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1258 	    --this->_M_impl._M_start._M_cur;
1317 	if (this->_M_impl._M_start._M_cur
1318 	    != this->_M_impl._M_start._M_last - 1)
1320 	    this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
1321 	    ++this->_M_impl._M_start._M_cur;
1483 	std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1558        *  @pre _M_start and _M_finish have already been initialized,
1740 	_M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);
1741 	this->_M_impl._M_start = __pos;
1760 	const size_type __vacancies = this->_M_impl._M_start._M_cur
1761 	                              - this->_M_impl._M_start._M_first;
1764 	return this->_M_impl._M_start - difference_type(__n);
1804 	if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node