erase() [1/2]

template<typename T>

iterator fl::deque< T >::erase ( const_iterator first, const_iterator last )

inline

Definition at line 663 of file deque.h.

                                                              {
        if (first == last) return iterator(this, first.mIndex);
 
        fl::size start_idx = first.mIndex;
        fl::size count = last.mIndex - first.mIndex;
 
        // Destroy elements in range
        for (fl::size i = 0; i < count; ++i) {
            fl::size destroy_idx = get_index(start_idx + i);
            mData[destroy_idx].~T();
        }
 
        // Shift remaining elements left
        for (fl::size i = start_idx; i < mSize - count; ++i) {
            fl::size from_idx = get_index(i + count);
            fl::size to_idx = get_index(i);
            new (&mData[to_idx]) T(fl::move(mData[from_idx]));
            mData[from_idx].~T();
        }
 
        mSize -= count;
        return iterator(this, start_idx);
    }