insert() [2/3]

template<typename T>

iterator fl::deque< T >::insert ( const_iterator pos, fl::size count, const T & value )

inline

Definition at line 619 of file deque.h.

                                                                      {
        fl::size index = pos.mIndex;
        ensure_capacity(mSize + count);
 
        // Shift elements from pos to end 'count' positions to the right
        for (fl::size i = mSize + count - 1; i >= index + 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();
        }
 
        // Insert new elements
        for (fl::size i = 0; i < count; ++i) {
            fl::size insert_idx = get_index(index + i);
            new (&mData[insert_idx]) T(value);
        }
        mSize += count;
 
        return iterator(this, index);
    }