insert() [2/2]

template<typename T, fl::size INLINED_SIZE>

bool fl::InlinedVector< T, INLINED_SIZE >::insert ( iterator pos, T && value )

inline

Definition at line 1158 of file vector.h.

                                         {
        if (mUsingHeap) {
            // return insert(pos, value);
            return mHeap.insert(pos, fl::move(value));
        }
 
        if (mFixed.size() < INLINED_SIZE) {
            return mFixed.insert(pos, fl::move(value));
        }
 
        // fl::size diff = pos - mFixed.begin();
        // make safe for data that grows down
        fl::size idx = mFixed.end() - pos;
 
        // overflow: move inline data into heap
        mHeap.reserve(INLINED_SIZE * 2);
        for (auto &v : mFixed) {
            mHeap.push_back(v);
        }
        mFixed.clear();
        return mHeap.insert(mHeap.begin() + idx, fl::move(value));
    }

References mFixed, mHeap, fl::move(), mUsingHeap, and pos.

Here is the call graph for this function: