Guava: Google Core Libraries for Java 32.1.2-jre · com.google.common.math.LongMath

Modifier and Type	Class and Description
private static enum	LongMath.MillerRabinTester

Field Summary

Modifier and Type	Field and Description
pack-priv static final int[]	biggestBinomials
pack-priv static final int[]	biggestSimpleBinomials
pack-priv static final long[]	factorials
pack-priv static final long	FLOOR_SQRT_MAX_LONG
pack-priv static final long[]	halfPowersOf10
pack-priv static final long	MAX_POWER_OF_SQRT2_UNSIGNED The biggest half power of two that fits into an unsigned long
pack-priv static final long	MAX_SIGNED_POWER_OF_TWO
pack-priv static final byte[]	maxLog10ForLeadingZeros
private static final long[][]	millerRabinBaseSets
pack-priv static final long[]	powersOf10
private static final int	SIEVE_30

Access	Constructor and Description
private	LongMath()

Method Summary

Modifier and Type	Method and Description
public static long	binomial(int n, int k) Returns `n` choose `k`, also known as the binomial coefficient of `n` and `k`, or `Long#MAX_VALUE` if the result does not fit in a `long`.
public static long	ceilingPowerOfTwo(long x) Returns the smallest power of two greater than or equal to `x`.
public static long	checkedAdd(long a, long b) Returns the sum of `a` and `b`, provided it does not overflow.
public static long	checkedMultiply(long a, long b) Returns the product of `a` and `b`, provided it does not overflow.
public static long	checkedPow(long b, int k) Returns the `b` to the `k`th power, provided it does not overflow.
public static long	checkedSubtract(long a, long b) Returns the difference of `a` and `b`, provided it does not overflow.
public static long	divide(long p, long q, RoundingMode mode) Returns the result of dividing `p` by `q`, rounding using the specified `RoundingMode`.
public static long	factorial(int n) Returns `n!`
pack-priv static boolean	fitsInInt(long x)
public static long	floorPowerOfTwo(long x) Returns the largest power of two less than or equal to `x`.
public static long	gcd(long a, long b) Returns the greatest common divisor of `a, b`.
public static boolean	isPowerOfTwo(long x) Returns `true` if `x` represents a power of two.
public static boolean	isPrime(long n) Returns `true` if `n` is a prime number: an integer greater than one that cannot be factored into a product of smaller positive integers.
pack-priv static int	lessThanBranchFree(long x, long y) Returns 1 if `x < y` as unsigned longs, and 0 otherwise.
public static int	log10(long x, RoundingMode mode) Returns the base-10 logarithm of `x`, rounded according to the specified rounding mode.
pack-priv static int	log10Floor(long x)
public static int	log2(long x, RoundingMode mode) Returns the base-2 logarithm of `x`, rounded according to the specified rounding mode.
public static long	mean(long x, long y) Returns the arithmetic mean of `x` and `y`, rounded toward negative infinity.
public static int	mod(long x, int m) Returns `x mod m`, a non-negative value less than `m`.
public static long	mod(long x, long m) Returns `x mod m`, a non-negative value less than `m`.
pack-priv static long	multiplyFraction(long x, long numerator, long denominator) Returns (x * numerator / denominator), which is assumed to come out to an integral value.
public static long	pow(long b, int k) Returns `b` to the `k`th power.
public static double	roundToDouble(long x, RoundingMode mode) Returns `x`, rounded to a `double` with the specified rounding mode.
public static long	saturatedAdd(long a, long b) Returns the sum of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively.
public static long	saturatedMultiply(long a, long b) Returns the product of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively.
public static long	saturatedPow(long b, int k) Returns the `b` to the `k`th power, unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively.
public static long	saturatedSubtract(long a, long b) Returns the difference of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively.
public static long	sqrt(long x, RoundingMode mode) Returns the square root of `x`, rounded with the specified rounding mode.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

biggestBinomials	back to summary
pack-priv static final int[] biggestBinomials

biggestSimpleBinomials	back to summary
pack-priv static final int[] biggestSimpleBinomials Annotations @VisibleForTesting

factorials	back to summary
pack-priv static final long[] factorials

FLOOR_SQRT_MAX_LONG	back to summary
pack-priv static final long FLOOR_SQRT_MAX_LONG Annotations @VisibleForTesting

halfPowersOf10	back to summary
pack-priv static final long[] halfPowersOf10 Annotations @J2ktIncompatible @GwtIncompatible @VisibleForTesting

MAX_POWER_OF_SQRT2_UNSIGNED	back to summary
pack-priv static final long MAX_POWER_OF_SQRT2_UNSIGNED The biggest half power of two that fits into an unsigned long Annotations @VisibleForTesting

MAX_SIGNED_POWER_OF_TWO	back to summary
pack-priv static final long MAX_SIGNED_POWER_OF_TWO Annotations @VisibleForTesting

maxLog10ForLeadingZeros	back to summary
pack-priv static final byte[] maxLog10ForLeadingZeros Annotations @VisibleForTesting

millerRabinBaseSets	back to summary
private static final long[][] millerRabinBaseSets

powersOf10	back to summary
pack-priv static final long[] powersOf10 Annotations @J2ktIncompatible @GwtIncompatible @VisibleForTesting

SIEVE_30	back to summary
private static final int SIEVE_30

Constructor Detail

LongMath	back to summary
private LongMath()

Method Detail

binomial back to summary

binomial	back to summary
public static long binomial(int n, int k) Returns `n` choose `k`, also known as the binomial coefficient of `n` and `k`, or `Long#MAX_VALUE` if the result does not fit in a `long`. Exceptions IllegalArgumentException: if `n < 0`, `k < 0`, or `k > n`

public static long binomial(int n, int k)

Returns n choose k, also known as the binomial coefficient of n and k, or Long#MAX_VALUE if the result does not fit in a long.

Exceptions

IllegalArgumentException:: if n < 0, k < 0, or k > n

ceilingPowerOfTwo back to summary

ceilingPowerOfTwo	back to summary
public static long ceilingPowerOfTwo(long x) Returns the smallest power of two greater than or equal to `x`. This is equivalent to `checkedPow(2, log2(x, CEILING))`. Exceptions IllegalArgumentException: if `x <= 0` ArithmeticException: of the next-higher power of two is not representable as a `long`, i.e. when `x > 2^62` Since 20.0

public static long ceilingPowerOfTwo(long x)

Returns the smallest power of two greater than or equal to x. This is equivalent to checkedPow(2, log2(x, CEILING)).

Exceptions

IllegalArgumentException:: if x <= 0
ArithmeticException:: of the next-higher power of two is not representable as a long, i.e. when x > 2^62

Since

20.0

checkedAdd back to summary

checkedAdd	back to summary
public static long checkedAdd(long a, long b) Returns the sum of `a` and `b`, provided it does not overflow. Annotations @SuppressWarnings:ShortCircuitBoolean Exceptions ArithmeticException: if `a + b` overflows in signed `long` arithmetic

public static long checkedAdd(long a, long b)

Returns the sum of a and b, provided it does not overflow.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Exceptions

ArithmeticException:: if a + b overflows in signed long arithmetic

checkedMultiply back to summary

checkedMultiply	back to summary
public static long checkedMultiply(long a, long b) Returns the product of `a` and `b`, provided it does not overflow. Annotations @SuppressWarnings:ShortCircuitBoolean Exceptions ArithmeticException: if `a * b` overflows in signed `long` arithmetic

public static long checkedMultiply(long a, long b)

Returns the product of a and b, provided it does not overflow.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Exceptions

ArithmeticException:: if a * b overflows in signed long arithmetic

checkedPow back to summary

checkedPow	back to summary
public static long checkedPow(long b, int k) Returns the `b` to the `k`th power, provided it does not overflow. Annotations @J2ktIncompatible @GwtIncompatible @SuppressWarnings:ShortCircuitBoolean Exceptions ArithmeticException: if `b` to the `k`th power overflows in signed `long` arithmetic

public static long checkedPow(long b, int k)

Returns the b to the kth power, provided it does not overflow.

Annotations

@J2ktIncompatible
@GwtIncompatible
@SuppressWarnings:ShortCircuitBoolean

Exceptions

ArithmeticException:: if b to the kth power overflows in signed long arithmetic

checkedSubtract back to summary

checkedSubtract	back to summary
public static long checkedSubtract(long a, long b) Returns the difference of `a` and `b`, provided it does not overflow. Annotations @J2ktIncompatible @GwtIncompatible @SuppressWarnings:ShortCircuitBoolean Exceptions ArithmeticException: if `a - b` overflows in signed `long` arithmetic

public static long checkedSubtract(long a, long b)

Returns the difference of a and b, provided it does not overflow.

Annotations

@J2ktIncompatible
@GwtIncompatible
@SuppressWarnings:ShortCircuitBoolean

Exceptions

ArithmeticException:: if a - b overflows in signed long arithmetic

divide back to summary

divide	back to summary
public static long divide(long p, long q, RoundingMode mode) Returns the result of dividing `p` by `q`, rounding using the specified `RoundingMode`. Annotations @J2ktIncompatible @GwtIncompatible @SuppressWarnings:fallthrough Exceptions ArithmeticException: if `q == 0`, or if `mode == UNNECESSARY` and `a` is not an integer multiple of `b`

public static long divide(long p, long q, RoundingMode mode)

Returns the result of dividing p by q, rounding using the specified RoundingMode.

Annotations

@J2ktIncompatible
@GwtIncompatible
@SuppressWarnings:fallthrough

Exceptions

ArithmeticException:: if q == 0, or if mode == UNNECESSARY and a is not an integer multiple of b

factorial back to summary

factorial	back to summary
public static long factorial(int n) Returns `n!`, that is, the product of the first `n` positive integers, `1` if `n == 0`, or `Long#MAX_VALUE` if the result does not fit in a `long`. Annotations @J2ktIncompatible @GwtIncompatible Exceptions IllegalArgumentException: if `n < 0`

public static long factorial(int n)

Returns n!, that is, the product of the first n positive integers, 1 if n == 0, or Long#MAX_VALUE if the result does not fit in a long.

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

IllegalArgumentException:: if n < 0

fitsInInt	back to summary
pack-priv static boolean fitsInInt(long x)

floorPowerOfTwo back to summary

floorPowerOfTwo	back to summary
public static long floorPowerOfTwo(long x) Returns the largest power of two less than or equal to `x`. This is equivalent to `checkedPow(2, log2(x, FLOOR))`. Exceptions IllegalArgumentException: if `x <= 0` Since 20.0

public static long floorPowerOfTwo(long x)

Returns the largest power of two less than or equal to x. This is equivalent to checkedPow(2, log2(x, FLOOR)).

Exceptions

IllegalArgumentException:: if x <= 0

Since

20.0

gcd back to summary

gcd	back to summary
public static long gcd(long a, long b) Returns the greatest common divisor of `a, b`. Returns `0` if `a == 0 && b == 0`. Exceptions IllegalArgumentException: if `a < 0` or `b < 0`

public static long gcd(long a, long b)

Returns the greatest common divisor of a, b. Returns 0 if a == 0 && b == 0.

Exceptions

IllegalArgumentException:: if a < 0 or b < 0

isPowerOfTwo back to summary

isPowerOfTwo	back to summary
public static boolean isPowerOfTwo(long x) Returns `true` if `x` represents a power of two. This differs from `Long.bitCount(x) == 1`, because `Long.bitCount(Long.MIN_VALUE) == 1`, but `Long#MIN_VALUE` is not a power of two. Annotations @SuppressWarnings:ShortCircuitBoolean

public static boolean isPowerOfTwo(long x)

Returns true if x represents a power of two.

This differs from Long.bitCount(x) == 1, because Long.bitCount(Long.MIN_VALUE) == 1, but Long#MIN_VALUE is not a power of two.

Annotations

@SuppressWarnings:ShortCircuitBoolean

isPrime back to summary

isPrime	back to summary
public static boolean isPrime(long n) Returns `true` if `n` is a prime number: an integer greater than one that cannot be factored into a product of smaller positive integers. Returns `false` if `n` is zero, one, or a composite number (one which can be factored into smaller positive integers). To test larger numbers, use `BigInteger#isProbablePrime`. Annotations @J2ktIncompatible @GwtIncompatible Exceptions IllegalArgumentException: if `n` is negative Since 20.0

public static boolean isPrime(long n)

Returns true if n is a prime number: an integer greater than one that cannot be factored into a product of smaller positive integers. Returns false if n is zero, one, or a composite number (one which can be factored into smaller positive integers).

To test larger numbers, use BigInteger#isProbablePrime.

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

IllegalArgumentException:: if n is negative

Since

20.0

lessThanBranchFree back to summary

lessThanBranchFree	back to summary
pack-priv static int lessThanBranchFree(long x, long y) Returns 1 if `x < y` as unsigned longs, and 0 otherwise. Assumes that x - y fits into a signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster than the straightforward ternary expression. Annotations @VisibleForTesting

pack-priv static int lessThanBranchFree(long x, long y)

Returns 1 if x < y as unsigned longs, and 0 otherwise. Assumes that x - y fits into a signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster than the straightforward ternary expression.

Annotations

@VisibleForTesting

log10 back to summary

log10	back to summary
public static int log10(long x, RoundingMode mode) Returns the base-10 logarithm of `x`, rounded according to the specified rounding mode. Annotations @J2ktIncompatible @GwtIncompatible @SuppressWarnings:fallthrough Exceptions IllegalArgumentException: if `x <= 0` ArithmeticException: if `mode` is `RoundingMode#UNNECESSARY` and `x` is not a power of ten

public static int log10(long x, RoundingMode mode)

Returns the base-10 logarithm of x, rounded according to the specified rounding mode.

Annotations

@J2ktIncompatible
@GwtIncompatible
@SuppressWarnings:fallthrough

Exceptions

IllegalArgumentException:: if x <= 0
ArithmeticException:: if mode is RoundingMode#UNNECESSARY and x is not a power of ten

log10Floor	back to summary
pack-priv static int log10Floor(long x) Annotations @J2ktIncompatible @GwtIncompatible

log2 back to summary

log2	back to summary
public static int log2(long x, RoundingMode mode) Returns the base-2 logarithm of `x`, rounded according to the specified rounding mode. Annotations @SuppressWarnings:fallthrough Exceptions IllegalArgumentException: if `x <= 0` ArithmeticException: if `mode` is `RoundingMode#UNNECESSARY` and `x` is not a power of two

public static int log2(long x, RoundingMode mode)

Returns the base-2 logarithm of x, rounded according to the specified rounding mode.

Annotations

@SuppressWarnings:fallthrough

Exceptions

IllegalArgumentException:: if x <= 0
ArithmeticException:: if mode is RoundingMode#UNNECESSARY and x is not a power of two

mean back to summary

mean	back to summary
public static long mean(long x, long y) Returns the arithmetic mean of `x` and `y`, rounded toward negative infinity. This method is resilient to overflow. Since 14.0

public static long mean(long x, long y)

Returns the arithmetic mean of x and y, rounded toward negative infinity. This method is resilient to overflow.

Since: 14.0

mod back to summary

mod	back to summary
public static int mod(long x, int m) Returns `x mod m`, a non-negative value less than `m`. This differs from `x % m`, which might be negative. For example: `mod(7, 4) == 3 mod(-7, 4) == 1 mod(-1, 4) == 3 mod(-8, 4) == 0 mod(8, 4) == 0` Annotations @J2ktIncompatible @GwtIncompatible Exceptions ArithmeticException: if `m <= 0` See Also Remainder Operator

public static int mod(long x, int m)

Returns x mod m, a non-negative value less than m. This differs from x % m, which might be negative.

For example:

mod(7, 4) == 3
mod(-7, 4) == 1
mod(-1, 4) == 3
mod(-8, 4) == 0
mod(8, 4) == 0

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

ArithmeticException:: if m <= 0

See Also

Remainder Operator

mod back to summary

mod	back to summary
public static long mod(long x, long m) Returns `x mod m`, a non-negative value less than `m`. This differs from `x % m`, which might be negative. For example: `mod(7, 4) == 3 mod(-7, 4) == 1 mod(-1, 4) == 3 mod(-8, 4) == 0 mod(8, 4) == 0` Annotations @J2ktIncompatible @GwtIncompatible Exceptions ArithmeticException: if `m <= 0` See Also Remainder Operator

public static long mod(long x, long m)

Returns x mod m, a non-negative value less than m. This differs from x % m, which might be negative.

For example:

mod(7, 4) == 3
mod(-7, 4) == 1
mod(-1, 4) == 3
mod(-8, 4) == 0
mod(8, 4) == 0

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

ArithmeticException:: if m <= 0

See Also

Remainder Operator

multiplyFraction	back to summary
pack-priv static long multiplyFraction(long x, long numerator, long denominator) Returns (x * numerator / denominator), which is assumed to come out to an integral value.

pow back to summary

pow	back to summary
public static long pow(long b, int k) Returns `b` to the `k`th power. Even if the result overflows, it will be equal to `BigInteger.valueOf(b).pow(k).longValue()`. This implementation runs in `O(log k)` time. Annotations @J2ktIncompatible @GwtIncompatible Exceptions IllegalArgumentException: if `k < 0`

public static long pow(long b, int k)

Returns b to the kth power. Even if the result overflows, it will be equal to BigInteger.valueOf(b).pow(k).longValue(). This implementation runs in O(log k) time.

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

IllegalArgumentException:: if k < 0

roundToDouble back to summary

roundToDouble	back to summary
public static double roundToDouble(long x, RoundingMode mode) Returns `x`, rounded to a `double` with the specified rounding mode. If `x` is precisely representable as a `double`, its `double` value will be returned; otherwise, the rounding will choose between the two nearest representable values with `mode`. For the case of `RoundingMode#HALF_EVEN`, this implementation uses the IEEE 754 default rounding mode: if the two nearest representable values are equally near, the one with the least significant bit zero is chosen. (In such cases, both of the nearest representable values are even integers; this method returns the one that is a multiple of a greater power of two.) Annotations @SuppressWarnings:deprecation @J2ktIncompatible @GwtIncompatible Exceptions ArithmeticException: if `mode` is `RoundingMode#UNNECESSARY` and `x` is not precisely representable as a `double` Since 30.0

public static double roundToDouble(long x, RoundingMode mode)

Returns x, rounded to a double with the specified rounding mode. If x is precisely representable as a double, its double value will be returned; otherwise, the rounding will choose between the two nearest representable values with mode.

For the case of RoundingMode#HALF_EVEN, this implementation uses the IEEE 754 default rounding mode: if the two nearest representable values are equally near, the one with the least significant bit zero is chosen. (In such cases, both of the nearest representable values are even integers; this method returns the one that is a multiple of a greater power of two.)

Annotations

@SuppressWarnings:deprecation
@J2ktIncompatible
@GwtIncompatible

Exceptions

ArithmeticException:: if mode is RoundingMode#UNNECESSARY and x is not precisely representable as a double

Since

30.0

saturatedAdd back to summary

saturatedAdd	back to summary
public static long saturatedAdd(long a, long b) Returns the sum of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively. Annotations @SuppressWarnings:ShortCircuitBoolean Since 20.0

public static long saturatedAdd(long a, long b)

Returns the sum of a and b unless it would overflow or underflow in which case Long.MAX_VALUE or Long.MIN_VALUE is returned, respectively.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Since

20.0

saturatedMultiply back to summary

saturatedMultiply	back to summary
public static long saturatedMultiply(long a, long b) Returns the product of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively. Annotations @SuppressWarnings:ShortCircuitBoolean Since 20.0

public static long saturatedMultiply(long a, long b)

Returns the product of a and b unless it would overflow or underflow in which case Long.MAX_VALUE or Long.MIN_VALUE is returned, respectively.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Since

20.0

saturatedPow back to summary

saturatedPow	back to summary
public static long saturatedPow(long b, int k) Returns the `b` to the `k`th power, unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively. Annotations @SuppressWarnings:ShortCircuitBoolean Since 20.0

public static long saturatedPow(long b, int k)

Returns the b to the kth power, unless it would overflow or underflow in which case Long.MAX_VALUE or Long.MIN_VALUE is returned, respectively.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Since

20.0

saturatedSubtract back to summary

saturatedSubtract	back to summary
public static long saturatedSubtract(long a, long b) Returns the difference of `a` and `b` unless it would overflow or underflow in which case `Long.MAX_VALUE` or `Long.MIN_VALUE` is returned, respectively. Annotations @SuppressWarnings:ShortCircuitBoolean Since 20.0

public static long saturatedSubtract(long a, long b)

Returns the difference of a and b unless it would overflow or underflow in which case Long.MAX_VALUE or Long.MIN_VALUE is returned, respectively.

Annotations

@SuppressWarnings:ShortCircuitBoolean

Since

20.0

sqrt back to summary

sqrt	back to summary
public static long sqrt(long x, RoundingMode mode) Returns the square root of `x`, rounded with the specified rounding mode. Annotations @J2ktIncompatible @GwtIncompatible Exceptions IllegalArgumentException: if `x < 0` ArithmeticException: if `mode` is `RoundingMode#UNNECESSARY` and `sqrt(x)` is not an integer

public static long sqrt(long x, RoundingMode mode)

Returns the square root of x, rounded with the specified rounding mode.

Annotations

@J2ktIncompatible
@GwtIncompatible

Exceptions

IllegalArgumentException:: if x < 0
ArithmeticException:: if mode is RoundingMode#UNNECESSARY and sqrt(x) is not an integer

Field Summary

Modifier and Type	Field and Description
public static final LongMath.MillerRabinTester	LARGE Works for all nonnegative signed longs.
public static final LongMath.MillerRabinTester	SMALL Works for inputs ≤ FLOOR_SQRT_MAX_LONG.

Access	Constructor and Description
private	MillerRabinTester()

Method Summary

Modifier and Type	Method and Description
pack-priv abstract long	mulMod(long a, long b, long m) Returns a * b mod m.
private long	powMod(long a, long p, long m) Returns a^p mod m.
pack-priv abstract long	squareMod(long a, long m) Returns a^2 mod m.
pack-priv static boolean	test(long base, long n)
private boolean	testWitness(long base, long n) Returns true if n is a strong probable prime relative to the specified base.
public static LongMath.MillerRabinTester	valueOf(String name)
public static LongMath.MillerRabinTester[]	values()

Inherited from java.lang.Enum:: clone compareTo describeConstable equals finalize getDeclaringClass hashCode name ordinal toString valueOf

Field Detail

LARGE	back to summary
public static final LongMath.MillerRabinTester LARGE Works for all nonnegative signed longs.

SMALL	back to summary
public static final LongMath.MillerRabinTester SMALL Works for inputs ≤ FLOOR_SQRT_MAX_LONG.

Constructor Detail

MillerRabinTester	back to summary
private MillerRabinTester()

Method Detail

mulMod	back to summary
pack-priv abstract long mulMod(long a, long b, long m) Returns a * b mod m.

powMod	back to summary
private long powMod(long a, long p, long m) Returns a^p mod m.

squareMod	back to summary
pack-priv abstract long squareMod(long a, long m) Returns a^2 mod m.

test	back to summary
pack-priv static boolean test(long base, long n)

testWitness	back to summary
private boolean testWitness(long base, long n) Returns true if n is a strong probable prime relative to the specified base.

valueOf	back to summary
public static LongMath.MillerRabinTester valueOf(String name)

values	back to summary
public static LongMath.MillerRabinTester[] values()

public final Class LongMath

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private sealed Enum LongMath.MillerRabinTester

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail