ensure_capacity()

template<typename T>

void fl::deque< T >::ensure_capacity ( fl::size min_capacity )

inlineprivate

Definition at line 24 of file deque.h.

                                              {
        if (mCapacity >= min_capacity) {
            return;
        }
 
        fl::size new_capacity = mCapacity == 0 ? kInitialCapacity : mCapacity * 2;
        while (new_capacity < min_capacity) {
            new_capacity *= 2;
        }
 
        T* new_data = static_cast<T*>(mResource->allocate(new_capacity * sizeof(T)));
        if (!new_data) {
            return; // Allocation failed
        }
 
        // Copy existing elements to new buffer in linear order
        for (fl::size i = 0; i < mSize; ++i) {
            fl::size old_idx = (mFront + i) % mCapacity;
            new (&new_data[i]) T(fl::move(mData[old_idx]));
            mData[old_idx].~T();
        }
 
        if (mData) {
            mResource->deallocate(mData, mCapacity * sizeof(T));
        }
 
        mData = new_data;
        mCapacity = new_capacity;
        mFront = 0; // Reset front to 0 after reallocation
    }

Referenced by fl::deque< int >::assign(), fl::deque< int >::emplace(), fl::deque< int >::emplace_back(), fl::deque< int >::emplace_front(), fl::deque< int >::insert(), fl::deque< int >::insert(), fl::deque< int >::insert(), fl::deque< int >::push_back(), fl::deque< int >::push_back(), fl::deque< int >::push_front(), fl::deque< int >::push_front(), fl::deque< int >::reserve(), and fl::deque< int >::resize().

Here is the caller graph for this function: