find_slot()

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

pair< fl::size, bool > fl::unordered_map< Key, T, Hash, KeyEqual, INLINED_COUNT >::find_slot ( const Key & key ) const

inlineprivate

Definition at line 848 of file unordered_map.h.

                                                                    {
        const fl::size cap = _buckets.size();
        const fl::size mask = cap - 1;
        const fl::size h = _hash(key) & mask;
        fl::size first_tomb = npos();
 
        // Probe sequence comes from the shared (non-template) helper -- avoids
        // duplicating the (cap <= 8 ? linear : quadratic-then-linear)
        // branch logic across every unordered_map<K, V, Hash, Equal>
        // instantiation. See FastLED #3235 Tier 1C.
        for (fl::size i = 0; i < cap; ++i) {
            const fl::size idx = detail::unordered_map_probe_idx(h, i, mask, cap);
 
            if (is_empty(idx))
                return {first_tomb != npos() ? first_tomb : idx, true};
            if (is_deleted(idx)) {
                if (first_tomb == npos())
                    first_tomb = idx;
            } else if (is_occupied(idx) && _equal(_buckets[idx].key, key)) {
                return {idx, false};
            }
        }
 
        return {npos(), false};
    }