insert() [2/2]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>

fl::pair< iterator, bool > fl::MapRedBlackTree< Key, Value, Compare, Allocator >::insert ( value_type && value )

inline

Definition at line 815 of file rbtree.h.

                                                      {
        return mTree.insert(fl::move(value));
    }