insert() [2/2]

template<typename T>

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

inline

Definition at line 345 of file list.h.

                                             {
        Node* new_node = create_node(fl::move(value));
        link_before(pos.mNode, new_node);
        ++mSize;
        return iterator(new_node);
    }

References create_node(), link_before(), fl::fl::move(), mSize, pos, and fl::type_rank< T >::value.

Here is the call graph for this function: