insert() [1/3]

template<typename T>

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

inline

Definition at line 579 of file deque.h.

                                                        {
        fl::size index = pos.mIndex;
        ensure_capacity(mSize + 1);
 
        // Shift elements from pos to end one position to the right
        for (fl::size i = mSize; i > index; --i) {
            fl::size from_idx = get_index(i - 1);
            fl::size to_idx = get_index(i);
            new (&mData[to_idx]) T(fl::move(mData[from_idx]));
            mData[from_idx].~T();
        }
 
        // Insert new element
        fl::size insert_idx = get_index(index);
        new (&mData[insert_idx]) T(value);
        ++mSize;
 
        return iterator(this, index);
    }