base/common/src/main/com/thesett/common/util/maps/SequentialCuckooFunction.java
private Entry<K> entryForKey(K key)
    {
        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);

        Entry<K> entry = hashTable[indexFor(hash1)];

        if ((entry != null) && key.equals(entry.key))
        {
            return entry;
        }

        int hash2 = hash2(hash1, keyHashCode);
        entry = hashTable[indexFor(hash2)];

        if ((entry != null) && key.equals(entry.key))
        {
            return entry;
        }

        return null;
    }
private Entry<K> entryForKey(K key)
    {
        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);

        Entry<K> entry = hashTable[indexFor(hash1)];

        if ((entry != null) && key.equals(entry.key))
        {
            return entry;
        }

        int hash2 = hash2(hash1, keyHashCode);
        entry = hashTable[indexFor(hash2)];

        if ((entry != null) && key.equals(entry.key))
        {
            return entry;
        }

        return null;
    }
Checks if the specified key can be found in the set, and returns its entry if so.

@param  key The key to check for in the entry set.

@return The keys entry if it is already in the set, <tt>null</tt> if not.