include/bits/stl_deque.h

367       : _M_impl(__a)
371       : _M_impl(__a)
400       { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
404       { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
413 	return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
419 	_M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
436       _Deque_impl _M_impl;
443       if (this->_M_impl._M_map)
445 	  _M_destroy_nodes(this->_M_impl._M_start._M_node,
446 			   this->_M_impl._M_finish._M_node + 1);
447 	  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
469       this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
471       this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);
478       _Tp** __nstart = (this->_M_impl._M_map
479 			+ (this->_M_impl._M_map_size - __num_nodes) / 2);
486 	  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
487 	  this->_M_impl._M_map = 0;
488 	  this->_M_impl._M_map_size = 0;
492       this->_M_impl._M_start._M_set_node(__nstart);
493       this->_M_impl._M_finish._M_set_node(__nfinish - 1);
494       this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
495       this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first
654        *  May be accessed via _M_impl.*
657       using _Base::_M_impl;
692 				    this->_M_impl._M_start,
725       { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
784       { return this->_M_impl._M_start; }
792       { return this->_M_impl._M_start; }
801       { return this->_M_impl._M_finish; }
810       { return this->_M_impl._M_finish; }
819       { return reverse_iterator(this->_M_impl._M_finish); }
828       { return const_reverse_iterator(this->_M_impl._M_finish); }
836       rend() { return reverse_iterator(this->_M_impl._M_start); }
845       { return const_reverse_iterator(this->_M_impl._M_start); }
851       { return this->_M_impl._M_finish - this->_M_impl._M_start; }
874 	  erase(this->_M_impl._M_start + __new_size, this->_M_impl._M_finish);
876 	  insert(this->_M_impl._M_finish, __new_size - __len, __x);
885       { return this->_M_impl._M_finish == this->_M_impl._M_start; }
901       { return this->_M_impl._M_start[difference_type(__n)]; }
916       { return this->_M_impl._M_start[difference_type(__n)]; }
1017 	if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
1019 	    this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1020 	    --this->_M_impl._M_start._M_cur;
1038 	if (this->_M_impl._M_finish._M_cur
1039 	    != this->_M_impl._M_finish._M_last - 1)
1041 	    this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
1042 	    ++this->_M_impl._M_finish._M_cur;
1059 	if (this->_M_impl._M_start._M_cur
1060 	    != this->_M_impl._M_start._M_last - 1)
1062 	    this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
1063 	    ++this->_M_impl._M_start._M_cur;
1080 	if (this->_M_impl._M_finish._M_cur
1081 	    != this->_M_impl._M_finish._M_first)
1083 	    --this->_M_impl._M_finish._M_cur;
1084 	    this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
1182 	std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1183 	std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1184 	std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1185 	std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1404 	const size_type __vacancies = this->_M_impl._M_start._M_cur
1405 	                              - this->_M_impl._M_start._M_first;
1408 	return this->_M_impl._M_start - difference_type(__n);
1414 	const size_type __vacancies = (this->_M_impl._M_finish._M_last
1415 				       - this->_M_impl._M_finish._M_cur) - 1;
1418 	return this->_M_impl._M_finish + difference_type(__n);
1442 	if (__nodes_to_add + 1 > this->_M_impl._M_map_size
1443 	    - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))
1450 	if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node
1451 				       - this->_M_impl._M_map))