is_empty()

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

bool fl::HashMap< Key, T, Hash, KeyEqual, INLINED_COUNT >::is_empty ( size_t idx ) const

inlineprivate

Definition at line 298 of file hash_map.h.

                                    {
        return !is_occupied(idx) && !is_deleted(idx);
    }

Referenced by fl::HashMap< Key, T, Hash, KeyEqual >::find_index(), and fl::HashMap< Key, T, Hash, KeyEqual >::find_slot().

Here is the caller graph for this function: