Package it.unimi.dsi.test
Class XorShiftPoly
- java.lang.Object
-
- it.unimi.dsi.test.XorShiftPoly
-
public class XorShiftPoly extends java.lang.Object
-
-
Field Summary
Fields Modifier and Type Field Description static intbitsThe number of bits of state of the generator.static java.math.BigInteger[]cofactorAn array of cofactors.static java.math.BigInteger[]factorFactors of the Fermat “primes” up to the eleventh (22048 + 1).static intnumCofactorsThe actual number of valid entries incofactor.static java.math.BigIntegertwoToBitsMinus1The period of the generator (2bits− 1).
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static voidmain(java.lang.String[] arg)static voidmPow(java.math.BigInteger e)Computes the power to a given exponent, given the quadratures.
-
-
-
Field Detail
-
bits
public static int bits
The number of bits of state of the generator.
-
twoToBitsMinus1
public static java.math.BigInteger twoToBitsMinus1
The period of the generator (2bits− 1).
-
factor
public static final java.math.BigInteger[] factor
Factors of the Fermat “primes” up to the eleventh (22048 + 1).
-
cofactor
public static final java.math.BigInteger[] cofactor
An array of cofactors. Entry 0 ≤i<numCofactorscontainstwoToBitsMinus1divided byfactor[i]. Note that some entries can benullifbitsis less then 4096.
-
numCofactors
public static int numCofactors
The actual number of valid entries incofactor.
-
-
Method Detail
-
mPow
public static void mPow(java.math.BigInteger e)
Computes the power to a given exponent, given the quadratures.- Parameters:
e- an exponent smaller than or equal to 2bits.
-
main
public static void main(java.lang.String[] arg)
-
-