emplace()

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

template<class... Args>

fl::pair< iterator, bool > fl::SortedHeapMap< Key, Value, Less >::emplace ( Args &&... args )

inline

Definition at line 385 of file map.h.

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