rehash()

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 >::rehash ( fl::size n )

inline

Definition at line 772 of file unordered_map.h.

                                       {
        // Ensure n is at least as large as the current number of elements
        fl::size min_buckets = _size;
        if (n < min_buckets) {
            n = min_buckets;
        }
 
        // Only rehash if we need more buckets than we currently have
        if (n > _buckets.size()) {
            rehash_internal(n);
        }
        // If n <= current bucket count, do nothing (std::unordered_map behavior)
    }