insert() [3/3]

template<typename T>

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

inline

Definition at line 721 of file deque.h.

                                                                {
        fl::size idx = pos.mIndex;
        if (idx == mSize) {
            push_back(fl::move(value));
            return iterator(this, idx);
        }
        // Move-extend at the back so move-only T works. The moved-from
        // slot at old logical mSize-1 is overwritten by the shift loop.
        push_back(fl::move((*this)[mSize - 1]));
        for (fl::size i = mSize - 1; i > idx + 1; --i) {
            (*this)[i - 1] = fl::move((*this)[i - 2]);
        }
        (*this)[idx] = fl::move(value);
        return iterator(this, idx);
    }