insert() [4/4]

template<typename Key, typename Compare = less<Key>, typename Allocator = allocator<Key>>

iterator fl::MultiSetTree< Key, Compare, Allocator >::insert ( value_type && value )

inline

Definition at line 217 of file multi_set.h.

                                        {
        ValueWithId vwid(fl::move(value), mNextId++);
        auto result = mTree.insert(fl::move(vwid));
        return iterator(result.first);
    }