base/common/src/main/com/thesett/common/util/maps/SequentialCuckooFunction.java
public Integer remove(Object objectKey)
    {
        K key = (K) objectKey;

        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);
        int index1 = indexFor(hash1);

        Entry<K> entry = hashTable[index1];

        if ((entry != null) && key.equals(entry.key))
        {
            hashTable[index1] = null;

            return entry.seq;
        }

        int hash2 = hash2(hash1, keyHashCode);
        int index2 = indexFor(hash2);

        entry = hashTable[index2];

        if ((entry != null) && key.equals(entry.key))
        {
            hashTable[index2] = null;

            return entry.seq;
        }

        return null;
    }
public Integer remove(Object objectKey)
    {
        K key = (K) objectKey;

        int keyHashCode = key.hashCode();
        int hash1 = hash1(keyHashCode);
        int index1 = indexFor(hash1);

        Entry<K> entry = hashTable[index1];

        if ((entry != null) && key.equals(entry.key))
        {
            hashTable[index1] = null;

            return entry.seq;
        }

        int hash2 = hash2(hash1, keyHashCode);
        int index2 = indexFor(hash2);

        entry = hashTable[index2];

        if ((entry != null) && key.equals(entry.key))
        {
            hashTable[index2] = null;

            return entry.seq;
        }

        return null;
    }
public Integer remove ( Object objectKey ) { K key = ( K ) objectKey ; int keyHashCode = key . hashCode ( ) ; int hash1 = hash1 ( keyHashCode ) ; int index1 = indexFor ( hash1 ) ; Entry < K > entry = hashTable [ index1 ] ; if ( ( entry != null ) && key . equals ( entry . key ) ) { hashTable [ index1 ] = null ; return entry . seq ; } int hash2 = hash2 ( hash1 , keyHashCode ) ; int index2 = indexFor ( hash2 ) ; entry = hashTable [ index2 ] ; if ( ( entry != null ) && key . equals ( entry . key ) ) { hashTable [ index2 ] = null ; return entry . seq ; } return null ; }
{@inheritDoc}
{