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>

size_t fl::HashMap< 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 428 of file hash_map.h.

                                                                  {
        const size_t cap = _buckets.size();
        const size_t mask = cap - 1;
        const size_t h = _hash(key) & mask;
 
        if (cap <= kLinearProbingOnlySize) {
            // linear probing
            for (size_t i = 0; i < cap; ++i) {
                const size_t idx = (h + i) & mask;
                bool occupied = occupied_set.test(idx);
                if (occupied) {
                    continue;
                }
                return idx;
            }
        } else {
            // quadratic probing up to 8 tries
            size_t i = 0;
            for (; i < kQuadraticProbingTries; ++i) {
                const size_t idx = (h + i + i * i) & mask;
                bool occupied = occupied_set.test(idx);
                if (occupied) {
                    continue;
                }
                return idx;
            }
            // fallback to linear for the rest
            for (; i < cap; ++i) {
                const size_t idx = (h + i) & mask;
                bool occupied = occupied_set.test(idx);
                if (occupied) {
                    continue;
                }
                return idx;
            }
        }
        return npos;
    }

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

Here is the caller graph for this function: