insert() [2/2]

template<typename T, typename Compare = less<T>, typename Allocator = allocator_slab<char>>

fl::pair< iterator, bool > fl::RedBlackTree< T, Compare, Allocator >::insert ( value_type && value )

inline

Definition at line 567 of file rbtree.h.

                                                      {
        return insertImpl(fl::move(value));
    }