HijackBag

int victimIndex = -1; float victimPri = Float.POSITIVE_INFINITY; V victimValue = null; for (int i = start, j = reprobes; j > 0; j--) { V y = (V) map.getAcquire(i); if (y == null) { //empty, but continue in case equal is found if (victimPri != NEGATIVE_INFINITY) { victimIndex = i; victimValue = null; victimPri = NEGATIVE_INFINITY; } } else if (x == y) { //identity match returning = y; incomingPri = 0; break; } else if (kHash == hashes.getAcquire(i) && keyEquals(k, y)) { //equality (non-identity) match float before = pri(y); returning = merge(y, x, overflowing); float after = pri(y); incomingPri -= (after - before); //reduce pressure break; } else { //select weakest victim if (victimPri > NEGATIVE_INFINITY) { float yp