code: public static final int nextPrime(final int desiredCapacity) {
  		final int i = Arrays.binarySearch(primeCapacities, desiredCapacity);
  		return primeCapacities[((i < 0) ? ((-i) - 1) : i)];
  	}
docs: Returns a prime number which is very close to <code>desiredCapacity</code>
  
  @param desiredCapacity the capacity desired by the user.
  @return the capacity which should be used for a hash.