insert() [4/6]

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

template<typename InputIt>

void fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::insert ( InputIt first, InputIt last )

inline

Definition at line 400 of file unordered_map.h.

                                                          {
        for (; first != last; ++first) {
            insert(*first);  // Uses pair-based insert
        }
    }