rehash()

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

void fl::HashMap< Key, T, Hash, KeyEqual, INLINED_COUNT >::rehash ( size_t new_cap )

inlineprivate

Definition at line 468 of file hash_map.h.

                                {
        new_cap = next_power_of_two(new_cap);
        fl::vector_inlined<Entry, INLINED_COUNT> old;
        fl::bitset<1024> old_occupied = _occupied;
 
        _buckets.swap(old);
        _buckets.clear();
        _buckets.assign(new_cap, Entry{});
 
        _occupied.reset();
        _occupied.resize(new_cap);
        _deleted.reset();
        _deleted.resize(new_cap);
 
        _size = _tombstones = 0;
 
        for (size_t i = 0; i < old.size(); i++) {
            if (old_occupied.test(i))
                insert(old[i].key, old[i].value);
        }
    }

Referenced by fl::HashMap< Key, T, Hash, KeyEqual >::insert().

Here is the caller graph for this function: