include/bits/stl_deque.h

449       : _M_impl()
453       : _M_impl(__a)
457       : _M_impl(__a)
462       : _M_impl(__x._M_get_Tp_allocator())
465 	if (__x._M_impl._M_map)
467 	    std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
468 	    std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
469 	    std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
470 	    std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
506       { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
510       { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
519 	return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
525 	_M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
542       _Deque_impl _M_impl;
549       if (this->_M_impl._M_map)
551 	  _M_destroy_nodes(this->_M_impl._M_start._M_node,
552 			   this->_M_impl._M_finish._M_node + 1);
553 	  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
573       this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
575       this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);
582       _Tp** __nstart = (this->_M_impl._M_map
583 			+ (this->_M_impl._M_map_size - __num_nodes) / 2);
590 	  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
591 	  this->_M_impl._M_map = 0;
592 	  this->_M_impl._M_map_size = 0;
596       this->_M_impl._M_start._M_set_node(__nstart);
597       this->_M_impl._M_finish._M_set_node(__nfinish - 1);
598       this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
599       this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first
755        *  May be accessed via _M_impl.*
757       using _Base::_M_impl;
800 				    this->_M_impl._M_start,
977       { return this->_M_impl._M_start; }
985       { return this->_M_impl._M_start; }
994       { return this->_M_impl._M_finish; }
1003       { return this->_M_impl._M_finish; }
1012       { return reverse_iterator(this->_M_impl._M_finish); }
1021       { return const_reverse_iterator(this->_M_impl._M_finish); }
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; }
1057       { return this->_M_impl._M_finish; }
1066       { return const_reverse_iterator(this->_M_impl._M_finish); }
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));
1107 	  insert(this->_M_impl._M_finish, __new_size - __len, __x);
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;
1286 	if (this->_M_impl._M_finish._M_cur
1287 	    != this->_M_impl._M_finish._M_last - 1)
1289 	    this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
1290 	    ++this->_M_impl._M_finish._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;
1338 	if (this->_M_impl._M_finish._M_cur
1339 	    != this->_M_impl._M_finish._M_first)
1341 	    --this->_M_impl._M_finish._M_cur;
1342 	    this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
1483 	std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1484 	std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1485 	std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1486 	std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1740 	_M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);
1741 	this->_M_impl._M_start = __pos;
1751 			 this->_M_impl._M_finish._M_node + 1);
1752 	this->_M_impl._M_finish = __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);
1770 	const size_type __vacancies = (this->_M_impl._M_finish._M_last
1771 				       - this->_M_impl._M_finish._M_cur) - 1;
1774 	return this->_M_impl._M_finish + difference_type(__n);
1796 	if (__nodes_to_add + 1 > this->_M_impl._M_map_size
1797 	    - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))
1804 	if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node
1805 				       - this->_M_impl._M_map))