void (int prime, int prime2) { for (int i = 0; i < myHashFunctionCount; ++i) { int abs = Math.abs((i * prime + prime2 * (myHashFunctionCount - i)) % myBitsCount); elementSet[abs >> BITS_PER_ELEMENT] |= (1L << abs); } }