insert() [3/6]

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

void fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::insert ( fl::initializer_list< pair< Key, T > > init )

inline

Definition at line 406 of file unordered_map.h.

                                                                    {
        for (const auto& kv : init) {
            insert(kv);  // Uses pair-based insert
        }
    }