emplace()

template<typename Key, typename T, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>, int INLINED_COUNT = FASTLED_HASHMAP_INLINED_COUNT>

template<typename... Args>

pair< iterator, bool > fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::emplace ( Args &&... args )

inline

Definition at line 470 of file unordered_map.h.

                                                              {
        // Construct a pair from the arguments
        pair<Key, T> kv(fl::forward<Args>(args)...);
        // Use move-based insert since we just constructed this pair
        return insert(fl::move(kv));
    }