base/common/src/main/com/thesett/common/util/maps/SequentialCuckooFunction.java
public boolean containsKey(K key)
    {
        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);

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

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

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

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

        return false;
    }
public boolean containsKey(K key)
    {
        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);

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

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

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

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

        return false;
    }
{@inheritDoc}