__BVECTOR __BVECTOR __BVECTOR __BVECTOR __BVECTOR __BVECTOR __BVECTOR __chunk_type _Base _Iterator_category _M_fill_assign _M_fill_insert _M_initialize _M_insert_aux _M_range_check _Self _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS allocator_type assign at at back back begin begin capacity clear const_iterator const_pointer const_reference difference_type empty end end erase erase flip front front insert insert insert insert iterator max_size operator= operator[] operator[] pointer pop_back push_back rbegin rbegin reference rend rend reserve resize size size_type swap value_type ~__BVECTOR

void __BVECTOR_QUALIFIED::_M_insert_aux ( iterator  __position, bool  __x  ) [inline, protected] Definition at line 396 of file _bvector.h. Referenced by insert(), and push_back(). { if (this->_M_finish._M_p != this->_M_end_of_storage._M_data) { _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1, random_access_iterator_tag(), (difference_type*)0 ); *__position = __x; ++this->_M_finish; } else { size_type __len = size() ? 2 * size() : _STLP_WORD_BIT; __chunk_type* __q = this->_M_bit_alloc(__len); iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); *__i++ = __x; this->_M_finish = _STLP_STD::copy(__position, end(), __i); this->_M_deallocate(); this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len); this->_M_start = iterator(__q, 0); } }