insert() [2/6]

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

pair< iterator, bool > fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::insert ( const pair< Key, T > & kv )

inline

Definition at line 386 of file unordered_map.h.

                                                        {
        return insert(kv.first, kv.second);
    }