unordered_map() [5/9]

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

fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::unordered_map ( const unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT > & other )

inline

Definition at line 80 of file unordered_map.h.

        : _buckets(other._buckets.size()), _size(0), _tombstones(0),
          mLoadFactor(other.mLoadFactor), _occupied(other._buckets.size()),
          _deleted(other._buckets.size()), _hash(other._hash), _equal(other._equal) {
        // Copy all occupied entries using insert to properly hash them
        for (fl::size i = 0; i < other._buckets.size(); ++i) {
            if (other.is_occupied(i)) {
                insert(other._buckets[i].key, other._buckets[i].value);
            }
        }
    }