insert() [4/4]

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator<fl::pair<Key, Value>>>

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

inline

Definition at line 322 of file multi_map.h.

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