Lines Matching defs:_M_impl
452 : _M_impl()
456 : _M_impl()
460 : _M_impl(__a)
464 : _M_impl(__a)
469 : _M_impl(std::move(__x._M_get_Tp_allocator()))
472 if (__x._M_impl._M_map)
474 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
475 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
476 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
477 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
520 { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }
524 { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }
533 return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
539 _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
556 _Deque_impl _M_impl;
563 if (this->_M_impl._M_map)
565 _M_destroy_nodes(this->_M_impl._M_start._M_node,
566 this->_M_impl._M_finish._M_node + 1);
567 _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
587 this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,
589 this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);
596 _Tp** __nstart = (this->_M_impl._M_map
597 + (this->_M_impl._M_map_size - __num_nodes) / 2);
604 _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);
605 this->_M_impl._M_map = 0;
606 this->_M_impl._M_map_size = 0;
610 this->_M_impl._M_start._M_set_node(__nstart);
611 this->_M_impl._M_finish._M_set_node(__nfinish - 1);
612 this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;
613 this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first
772 * May be accessed via _M_impl.*
774 using _Base::_M_impl;
844 this->_M_impl._M_start,
1038 { return this->_M_impl._M_start; }
1046 { return this->_M_impl._M_start; }
1055 { return this->_M_impl._M_finish; }
1064 { return this->_M_impl._M_finish; }
1073 { return reverse_iterator(this->_M_impl._M_finish); }
1082 { return const_reverse_iterator(this->_M_impl._M_finish); }
1091 { return reverse_iterator(this->_M_impl._M_start); }
1100 { return const_reverse_iterator(this->_M_impl._M_start); }
1109 { return this->_M_impl._M_start; }
1118 { return this->_M_impl._M_finish; }
1127 { return const_reverse_iterator(this->_M_impl._M_finish); }
1136 { return const_reverse_iterator(this->_M_impl._M_start); }
1143 { return this->_M_impl._M_finish - this->_M_impl._M_start; }
1167 _M_erase_at_end(this->_M_impl._M_start
1187 insert(this->_M_impl._M_finish, __new_size - __len, __x);
1189 _M_erase_at_end(this->_M_impl._M_start
1209 insert(this->_M_impl._M_finish, __new_size - __len, __x);
1211 _M_erase_at_end(this->_M_impl._M_start
1229 { return this->_M_impl._M_finish == this->_M_impl._M_start; }
1245 { return this->_M_impl._M_start[difference_type(__n)]; }
1260 { return this->_M_impl._M_start[difference_type(__n)]; }
1361 if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)
1363 this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1364 --this->_M_impl._M_start._M_cur;
1392 if (this->_M_impl._M_finish._M_cur
1393 != this->_M_impl._M_finish._M_last - 1)
1395 this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
1396 ++this->_M_impl._M_finish._M_cur;
1423 if (this->_M_impl._M_start._M_cur
1424 != this->_M_impl._M_start._M_last - 1)
1426 this->_M_impl.destroy(this->_M_impl._M_start._M_cur);
1427 ++this->_M_impl._M_start._M_cur;
1444 if (this->_M_impl._M_finish._M_cur
1445 != this->_M_impl._M_finish._M_first)
1447 --this->_M_impl._M_finish._M_cur;
1448 this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);
1598 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1599 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1600 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1601 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1861 _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);
1862 this->_M_impl._M_start = __pos;
1872 this->_M_impl._M_finish._M_node + 1);
1873 this->_M_impl._M_finish = __pos;
1890 const size_type __vacancies = this->_M_impl._M_start._M_cur
1891 - this->_M_impl._M_start._M_first;
1894 return this->_M_impl._M_start - difference_type(__n);
1900 const size_type __vacancies = (this->_M_impl._M_finish._M_last
1901 - this->_M_impl._M_finish._M_cur) - 1;
1904 return this->_M_impl._M_finish + difference_type(__n);
1926 if (__nodes_to_add + 1 > this->_M_impl._M_map_size
1927 - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))
1934 if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node
1935 - this->_M_impl._M_map))