grow_map()

template<typename T>

void fl::deque< T >::grow_map ( fl::size extra_front, fl::size extra_back )

inlineprivate

Definition at line 97 of file deque.h.

                                                                      {
        fl::size used = used_chunks();
        fl::size needed = used + extra_front + extra_back;
        fl::size new_cap = detail::deque_grow_map_capacity(mMapCapacity, needed);
        // Center the existing chunks within the new map, biased to leave the
        // requested extra room on each side.
        fl::size new_front = extra_front + (new_cap - needed) / 2;
        T** new_map = allocate_map(new_cap);
        if (!new_map) {
            // Allocation failure: match the silent-fail behavior of the prior
            // vector-style ensure_capacity. Callers must defensively check
            // capacity / size after push_*.
            return;
        }
        // Free any chunk pointers in the OLD map that live outside the
        // [mFrontMapIdx, mFrontMapIdx+used) live range; those are orphans
        // and would otherwise leak when the old map is deallocated.
        fl::size live_end = mFrontMapIdx + used;
        for (fl::size i = 0; i < mMapCapacity; ++i) {
            if (i < mFrontMapIdx || i >= live_end) {
                deallocate_chunk(mMap[i]);
                mMap[i] = nullptr;
            }
        }
        for (fl::size i = 0; i < used; ++i) {
            new_map[new_front + i] = mMap[mFrontMapIdx + i];
        }
        deallocate_map(mMap, mMapCapacity);
        mMap = new_map;
        mMapCapacity = new_cap;
        mFrontMapIdx = new_front;
    }

Referenced by fl::deque< int >::ensure_back_room(), fl::deque< int >::ensure_front_room(), and fl::deque< int >::reserve().

Here is the caller graph for this function: