insert() [3/6]

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

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

inline

Definition at line 1180 of file rbtree.h.

                                                             {
        (void)hint; // Hint parameter not currently used in implementation
        auto result = mTree.insert(fl::move(value));
        return result.first;
    }