insert() [2/3]

template<typename T>

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

inline

Definition at line 737 of file deque.h.

                                                                                   {
        fl::size idx = pos.mIndex;
        if (count == 0) return iterator(this, idx);
        fl::size old_size = mSize;
        // Extend by `count` slots. First push uses `value` if the deque
        // is empty, else copies the current back; subsequent pushes copy
        // whatever's at the back now. All these copies will be overwritten
        // by the shift + fill below.
        for (fl::size k = 0; k < count; ++k) {
            if (mSize == 0) push_back(value);
            else push_back((*this)[mSize - 1]);
        }
        // Shift elements [idx .. old_size) right by `count` slots.
        for (fl::size i = old_size; i > idx; --i) {
            (*this)[i - 1 + count] = fl::move((*this)[i - 1]);
        }
        for (fl::size i = 0; i < count; ++i) {
            (*this)[idx + i] = value;
        }
        return iterator(this, idx);
    }