Searched refs:power (Results 1 – 8 of 8) sorted by relevance
117 int power = (n == 0 || n == 1) in chunkSize() local120 return 1 << power; in chunkSize()
292 int power = (int) Math.pow(10, (9 - maxWidth)); in fixParsedValue() local293 value = (value / power) * power; in fixParsedValue()
1483 int power = 1 << getHighBit(length); in search() local1484 int extra = length - power; in search()1485 int probe = power; in search()
218 int power = random.nextInt(6) + 2; in pow() local220 BigInteger y = x.pow(power); in pow()223 for (int j=1; j<power; j++) in pow()
1257 // Input is 8 (a power of two), in unary; reluctant quantifier1276 // Input is 8 (a power of two), in unary; greedy quantifier
19 "control" means (i) the power, direct or indirect, to cause the
2282 * The unit size in bytes, must be a power of {@code 2}2287 * If the index is negative or the unit size is not a power of2306 throw new IllegalArgumentException("Unit size not a power of two: " + unitSize);2358 * The unit size in bytes, must be a power of {@code 2}2363 * If the unit size not a power of {@code 2}
386 // unit size not a power of two