Lines Matching refs:_M_impl
451 : _M_impl()
455 : _M_impl()
459 : _M_impl(__a)
463 : _M_impl(__a)
468 : _M_impl(__x._M_get_Tp_allocator())
471 if (__x._M_impl._M_map)
473 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
474 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
475 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
476 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
512 { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
516 { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
525 return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
531 _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
548 _Deque_impl _M_impl;
555 if (this->_M_impl._M_map)
557 _M_destroy_nodes(this->_M_impl._M_start._M_node,
558 this->_M_impl._M_finish._M_node + 1);
559 _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
579 this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
581 this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);
588 _Tp** __nstart = (this->_M_impl._M_map
589 + (this->_M_impl._M_map_size - __num_nodes) / 2);
596 _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
597 this->_M_impl._M_map = 0;
598 this->_M_impl._M_map_size = 0;
602 this->_M_impl._M_start._M_set_node(__nstart);
603 this->_M_impl._M_finish._M_set_node(__nfinish - 1);
604 this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
605 this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first
761 * May be accessed via _M_impl.*
763 using _Base::_M_impl;
833 this->_M_impl._M_start,
1010 { return this->_M_impl._M_start; }
1018 { return this->_M_impl._M_start; }
1027 { return this->_M_impl._M_finish; }
1036 { return this->_M_impl._M_finish; }
1045 { return reverse_iterator(this->_M_impl._M_finish); }
1054 { return const_reverse_iterator(this->_M_impl._M_finish); }
1063 { return reverse_iterator(this->_M_impl._M_start); }
1072 { return const_reverse_iterator(this->_M_impl._M_start); }
1081 { return this->_M_impl._M_start; }
1090 { return this->_M_impl._M_finish; }
1099 { return const_reverse_iterator(this->_M_impl._M_finish); }
1108 { return const_reverse_iterator(this->_M_impl._M_start); }
1115 { return this->_M_impl._M_finish - this->_M_impl._M_start; }
1139 _M_erase_at_end(this->_M_impl._M_start
1159 insert(this->_M_impl._M_finish, __new_size - __len, __x);
1161 _M_erase_at_end(this->_M_impl._M_start
1181 insert(this->_M_impl._M_finish, __new_size - __len, __x);
1183 _M_erase_at_end(this->_M_impl._M_start
1201 { return this->_M_impl._M_finish == this->_M_impl._M_start; }
1217 { return this->_M_impl._M_start[difference_type(__n)]; }
1232 { return this->_M_impl._M_start[difference_type(__n)]; }
1333 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
1335 this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1336 --this->_M_impl._M_start._M_cur;
1364 if (this->_M_impl._M_finish._M_cur
1365 != this->_M_impl._M_finish._M_last - 1)
1367 this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
1368 ++this->_M_impl._M_finish._M_cur;
1395 if (this->_M_impl._M_start._M_cur
1396 != this->_M_impl._M_start._M_last - 1)
1398 this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
1399 ++this->_M_impl._M_start._M_cur;
1416 if (this->_M_impl._M_finish._M_cur
1417 != this->_M_impl._M_finish._M_first)
1419 --this->_M_impl._M_finish._M_cur;
1420 this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
1561 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1562 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1563 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1564 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1824 _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);
1825 this->_M_impl._M_start = __pos;
1835 this->_M_impl._M_finish._M_node + 1);
1836 this->_M_impl._M_finish = __pos;
1850 const size_type __vacancies = this->_M_impl._M_start._M_cur
1851 - this->_M_impl._M_start._M_first;
1854 return this->_M_impl._M_start - difference_type(__n);
1860 const size_type __vacancies = (this->_M_impl._M_finish._M_last
1861 - this->_M_impl._M_finish._M_cur) - 1;
1864 return this->_M_impl._M_finish + difference_type(__n);
1886 if (__nodes_to_add + 1 > this->_M_impl._M_map_size
1887 - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))
1894 if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node
1895 - this->_M_impl._M_map))
