find_unoccupied_index_using_bitset()

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

fl::size fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::find_unoccupied_index_using_bitset ( const Key & key, const fl::bitset< 1024 > & occupied_set ) const

inlineprivate

Definition at line 900 of file unordered_map.h.

                                                                               {
        const fl::size cap = _buckets.size();
        const fl::size mask = cap - 1;
        const fl::size h = _hash(key) & mask;
 
        // Probe via the shared helper -- see find_slot() comment above.
        for (fl::size i = 0; i < cap; ++i) {
            const fl::size idx = detail::unordered_map_probe_idx(h, i, mask, cap);
            if (!occupied_set.test(idx)) {
                return idx;
            }
        }
        return npos();
    }