boolean (int prime, int prime2) { for(int i = 0; i < myHashFunctionCount; ++i) { int abs = Math.abs((i * prime + prime2 * (myHashFunctionCount - i)) % myBitsCount); if ((elementSet[abs >> BITS_PER_ELEMENT] & (1L << abs)) == 0) { return false; } } return true; }