include/bits/stl_deque.h

410 	iterator _M_start;
415 	  _M_start(), _M_finish()
420 	  _M_start(), _M_finish()
471 	  _M_destroy_nodes(this->_M_impl._M_start._M_node,
518       this->_M_impl._M_start._M_set_node(__nstart);
520       this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
575    *  - iterator    _M_start, _M_finish
721 				    this->_M_impl._M_start,
812       { return this->_M_impl._M_start; }
820       { return this->_M_impl._M_start; }
865       { return reverse_iterator(this->_M_impl._M_start); }
874       { return const_reverse_iterator(this->_M_impl._M_start); }
880       { return this->_M_impl._M_finish - this->_M_impl._M_start; }
903 	  _M_erase_at_end(this->_M_impl._M_start + difference_type(__new_size));
914       { return this->_M_impl._M_finish == this->_M_impl._M_start; }
930       { return this->_M_impl._M_start[difference_type(__n)]; }
945       { return this->_M_impl._M_start[difference_type(__n)]; }
1046 	if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
1048 	    this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1049 	    --this->_M_impl._M_start._M_cur;
1088 	if (this->_M_impl._M_start._M_cur
1089 	    != this->_M_impl._M_start._M_last - 1)
1091 	    this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
1092 	    ++this->_M_impl._M_start._M_cur;
1211 	std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1286        *  @pre _M_start and _M_finish have already been initialized,
1467 	_M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);
1468 	this->_M_impl._M_start = __pos;
1492 	const size_type __vacancies = this->_M_impl._M_start._M_cur
1493 	                              - this->_M_impl._M_start._M_first;
1496 	return this->_M_impl._M_start - difference_type(__n);
1538 	if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node