_Base _Base _Base _ConstructCheck _Invalidate_all _Invalidate_iterator _Invalidate_iterators _Iterator_category _Iterator_category _M_erase _M_erase _M_erase _M_erase _M_fill_assign _M_fill_initialize _M_fill_initialize _M_fill_insert _M_fill_insert_aux _M_fill_insert_aux _M_impl _M_initialize _M_insert_range_aux _M_insert_range_aux _M_insert_range_aux _M_insert_range_aux _M_iter_list _M_new_elements_at_back _M_new_elements_at_front _M_non_dbg_impl _M_pop_back_aux _M_pop_front_aux _M_push_back_aux_v _M_push_front_aux_v _M_range_check _M_reallocate_map _M_reserve_elements_at_back _M_reserve_elements_at_front _M_reserve_map_at_back _M_reserve_map_at_front _Map_pointer _Self _Self _Self _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS _StorageType _StorageTypeAlloc allocator_type allocator_type assign assign assign assign assign assign assign assign assign at at at at at at back back back back back back begin begin begin begin begin begin cast_traits clear clear clear const_iterator const_iterator const_iterator const_pointer const_pointer const_reference const_reference deque deque deque deque deque deque deque deque deque deque deque deque deque deque deque deque deque deque deque difference_type difference_type empty empty empty end end end end end end erase erase erase erase erase erase front front front front front front get_allocator get_allocator get_allocator insert insert insert insert insert insert insert insert insert insert insert insert insert ite_cast_traits iterator iterator iterator max_size max_size max_size operator= operator= operator= operator[] operator[] operator[] operator[] operator[] operator[] pointer pointer pop_back pop_back pop_back pop_front pop_front pop_front push_back push_back push_back push_front push_front push_front rbegin rbegin rbegin rbegin rbegin rbegin reference reference rend rend rend rend rend rend resize resize resize size size size size_type size_type swap swap swap value_type value_type ~deque

template<class _Tp , class _Alloc > void deque< _Tp, _Alloc >::_M_reallocate_map ( size_type  __nodes_to_add, bool  __add_at_front  ) [protected] Definition at line 773 of file _deque.c. Referenced by deque< ShellDirectory * >::_M_reserve_map_at_back(), and deque< ShellDirectory * >::_M_reserve_map_at_front(). { size_type __old_num_nodes = this->_M_finish._M_node - this->_M_start._M_node + 1; size_type __new_num_nodes = __old_num_nodes + __nodes_to_add; _Map_pointer __new_nstart; if (this->_M_map_size._M_data > 2 * __new_num_nodes) { __new_nstart = this->_M_map._M_data + (this->_M_map_size._M_data - __new_num_nodes) / 2 + (__add_at_front ? __nodes_to_add : 0); if (__new_nstart < this->_M_start._M_node) _STLP_STD::copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart); else _STLP_STD::copy_backward(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart + __old_num_nodes); } else { size_type __new_map_size = this->_M_map_size._M_data + (max)((size_t)this->_M_map_size._M_data, __nodes_to_add) + 2; _Map_pointer __new_map = this->_M_map.allocate(__new_map_size); __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2 + (__add_at_front ? __nodes_to_add : 0); _STLP_STD::copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart); this->_M_map.deallocate(this->_M_map._M_data, this->_M_map_size._M_data); this->_M_map._M_data = __new_map; this->_M_map_size._M_data = __new_map_size; } this->_M_start._M_set_node(__new_nstart); this->_M_finish._M_set_node(__new_nstart + __old_num_nodes - 1); }