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