base/common/src/main/com/thesett/common/util/maps/SequentialCuckooFunction.java
private int hash2(int hash1, int key)
    {
        key = hash32shift(key);

        while (key == hash1)
        {
            key = hash32shift(key);
        }

        return key;
    }
private int hash2(int hash1, int key)
    {
        key = hash32shift(key);

        while (key == hash1)
        {
            key = hash32shift(key);
        }

        return key;
    }
private int hash2 ( int hash1 , int key ) { key = hash32shift ( key ) ; while ( key == hash1 ) { key = hash32shift ( key ) ; } return key ; }
Implements a secondary hash. This uses the 32-bit shift hash implemented by {@link #hash32shift(int)} and then
successively applies {@link #hash1(int)} if the generated hash code is not different to the hash code generated
by running {@link #hash1(int)} on the key. This ensures that the hash code returned by this will be different to
the one generated by {@link #hash1(int)}.

@param  hash1 The output of the hash1 function.
@param  key   The integer to compute a hash of.

@return A hash of the integer which is different to that generated by {@link #hash1(int)}.
Implements a secondary hash . This uses the 32 - bit shift hash implemented by { @link #hash32shift ( int ) } and then successively applies { @link #hash1 ( int ) } if the generated hash code is not different to the hash code generated by running { @link #hash1 ( int ) } on the key . This ensures that the hash code returned by this will be different to the one generated by { @link #hash1 ( int ) } .