private static long extraLargeCapacity(long desiredCapacity) { for (long c = desiredCapacity; c < Long.MAX_VALUE; c++) { if (isQHashPrime(c)) return c; } throw new IllegalArgumentException( "There isn't long qHash capacities higher than " + desiredCapacity); }
private static long extraLargeCapacity(long desiredCapacity) { for (long c = desiredCapacity; c < Long.MAX_VALUE; c++) { if (isQHashPrime(c)) return c; } throw new IllegalArgumentException( "There isn't long qHash capacities higher than " + desiredCapacity); }
long highPrime; for (long i = limit - 1L; ; i--) { if (isQHashPrime(i)) { highPrime = i; capacities.add(highPrime); long qPrimeNearToPowerOf2 = 0L; for (long i = minPrevPrime; i < highPrime; i++) { if (isQHashPrime(i)) { long lowerPowerOf2 = Long.highestOneBit(i); long avoidDiffWithPowerOf2 = lowerPowerOf2 >> avoidBitsAroundPowersOf2; break; for (long j = lowerPowerOf2 + avoidDiffWithPowerOf2; j > i; j--) { if (isQHashPrime(j)) { qPrimeNearToPowerOf2 = j; break; for (long j = higherPowerOf2 + avoidDiffWithPowerOf2; abs(higherPowerOf2 - i) < abs(higherPowerOf2 - j); j--) { if (isQHashPrime(j)) { qPrimeNearToPowerOf2 = j; break; if (isQHashPrime(i)) capacities.add(i);
long highPrime; for (long i = limit - 1L; ; i--) { if (isQHashPrime(i)) { highPrime = i; capacities.add(highPrime); long qPrimeNearToPowerOf2 = 0L; for (long i = minPrevPrime; i < highPrime; i++) { if (isQHashPrime(i)) { long lowerPowerOf2 = Long.highestOneBit(i); long avoidDiffWithPowerOf2 = lowerPowerOf2 >> avoidBitsAroundPowersOf2; break; for (long j = lowerPowerOf2 + avoidDiffWithPowerOf2; j > i; j--) { if (isQHashPrime(j)) { qPrimeNearToPowerOf2 = j; break; for (long j = higherPowerOf2 + avoidDiffWithPowerOf2; abs(higherPowerOf2 - i) < abs(higherPowerOf2 - j); j--) { if (isQHashPrime(j)) { qPrimeNearToPowerOf2 = j; break; if (isQHashPrime(i)) capacities.add(i);