insert() [1/2]

template<typename T>

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

inline

Definition at line 338 of file list.h.

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

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

Referenced by push_back(), push_back(), push_front(), and push_front().

Here is the call graph for this function:

Here is the caller graph for this function: