insert() [4/4]

template<typename Key, typename Value, typename Less = fl::less<Key>>

fl::pair< iterator, bool > fl::SortedHeapMap< Key, Value, Less >::insert ( value_type && value )

inline

Definition at line 368 of file map.h.

                                                      {
        InsertResult result;
        bool success = data.insert(fl::move(value), &result);
        iterator it = success ? data.find(value) : data.end();
        return fl::pair<iterator, bool>(it, success);
    }