125   _Tp* _M_last;  member
130       _M_last(*__y + _S_buffer_size()), _M_node(__y) {}  in _Deque_iterator()
131   _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}  in _Deque_iterator()
134       _M_last(__x._M_last), _M_node(__x._M_node) {}  in _Deque_iterator()
143       (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
148     if (_M_cur == _M_last) {
163       _M_cur = _M_last;
215     _M_last = _M_first + difference_type(_S_buffer_size());  in _M_set_node()
695     if (_M_finish._M_cur != _M_finish._M_last - 1) {  in push_back()
704     if (_M_finish._M_cur != _M_finish._M_last - 1) {  in push_back()
741     if (_M_start._M_cur != _M_start._M_last - 1) {  in pop_front()
903     size_type __vacancies = (_M_finish._M_last - _M_finish._M_cur) - 1;  in _M_reserve_elements_at_back()
1080     destroy(_M_start._M_cur, _M_start._M_last);  in clear()
1187     _M_start._M_cur = _M_start._M_last - 1;  in _M_push_front_aux()
1202     _M_start._M_cur = _M_start._M_last - 1;  in _M_push_front_aux()
1215   _M_finish._M_cur = _M_finish._M_last - 1;  in _M_pop_back_aux()