Home | History | Annotate | Download | only in math

Lines Matching defs:Integer

55    * <p>This differs from {@code Integer.bitCount(x) == 1}, because
56 * {@code Integer.bitCount(Integer.MIN_VALUE) == 1}, but {@link Integer#MIN_VALUE} is not a power
72 return ~~(x - y) >>> (Integer.SIZE - 1);
92 return (Integer.SIZE - 1) - Integer.numberOfLeadingZeros(x);
96 return Integer.SIZE - Integer.numberOfLeadingZeros(x - 1);
102 int leadingZeros = Integer.numberOfLeadingZeros(x);
105 int logFloor = (Integer.SIZE - 1) - leadingZeros;
124 int y = maxLog10ForLeadingZeros[Integer.numberOfLeadingZeros(x)];
141 {3, 31, 316, 3162, 31622, 316227, 3162277, 31622776, 316227766, Integer.MAX_VALUE};
154 * is not an integer multiple of {@code b}
176 int signum = 1 | ((p ^ q) >> (Integer.SIZE - 1));
246 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
262 int aTwos = Integer.numberOfTrailingZeros(a);
264 int bTwos = Integer.numberOfTrailingZeros(b);
276 int minDeltaOrZero = delta & (delta >> (Integer.SIZE - 1));
283 a >>= Integer.numberOfTrailingZeros(a); // divide out all 2s, since 2 doesn't divide b
339 checkNoOverflow(k < Integer.SIZE - 1);
342 checkNoOverflow(k < Integer.SIZE);
371 * integers, {@code 1} if {@code n == 0}, or {@link Integer#MAX_VALUE} if the
378 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;
398 Integer.MAX_VALUE,
399 Integer.MAX_VALUE,