insert() [2/2]

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

fl::pair< const_iterator, bool > fl::SetRedBlackTree< Key, Compare, Allocator >::insert ( value_type && value )

inline

Definition at line 956 of file rbtree.h.

                                                            {
        auto result = mTree.insert(fl::move(value));
        return fl::pair<const_iterator, bool>(result.first, result.second);
    }