reserve()

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

inline

Definition at line 787 of file unordered_map.h.

                                        {
        // Calculate required buckets to hold n elements without exceeding load factor
        float max_lf = max_load_factor();
        if (max_lf <= 0.0f) {
            max_lf = 0.7f; // Default if somehow zero
        }
        // Required buckets = ceil(n / max_load_factor)
        fl::size required_buckets = static_cast<fl::size>(
            static_cast<float>(n) / max_lf + 0.999999f // Add almost 1 to simulate ceil
        );
        if (required_buckets > _buckets.size()) {
            rehash(required_buckets);
        }
    }