mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-02-22 14:10:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

BigInteger.java (init(int,Random)): New method.

Browse Source 
* java/math/BigInteger.java (init(int,Random)):  New method.
	Move body of constructor <init>(int,Random)) here.
	Re-write it to avoid constructing unneeded temporaries.
	(<init>(int,int,Random)):  Use new init method to avoid constructing
	extra temporary BigIntegers.

From-SVN: r45240
This commit is contained in:
Per Bothner 2001-08-28 15:16:11 -07:00 committed by Per Bothner
parent 967603efc9
commit 4046760603
2 changed files with 36 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
libjava/ChangeLog
View File

@ -1,3 +1,11 @@
2001-08-28 Per Bothner <per@bothner.com>
* java/math/BigInteger.java (init(int,Random)): New method.
Move body of constructor <init>(int,Random)) here.
Re-write it to avoid constructing unneeded temporaries.
(<init>(int,int,Random)): Use new init method to avoid constructing
extra temporary BigIntegers.
2001-08-27 Tom Tromey <tromey@redhat.com>
* java/rmi/activation/Activatable.java,

42
libjava/java/math/BigInteger.java
View File

@ -143,21 +143,37 @@ public class BigInteger extends Number implements Comparable
}
public BigInteger(int numBits, Random rnd)
{
this(1, randBytes(numBits, rnd));
}
private static byte[] randBytes(int numBits, Random rnd)
{
if (numBits < 0)
throw new IllegalArgumentException();
int extra = numBits % 8;
byte[] b = new byte[numBits / 8 + (extra > 0 ? 1 : 0)];
rnd.nextBytes(b);
if (extra > 0)
b[0] &= ~((~0) << (8 - extra));
return b;
init(numBits, rnd);
}
private void init(int numBits, Random rnd)
{
int highbits = numBits & 31;
if (highbits > 0)
highbits = rnd.nextInt() >>> (32 - highbits);
int nwords = numBits / 32;
while (highbits == 0 && nwords > 0)
{
highbits = rnd.nextInt();
--nwords;
}
if (nwords == 0 && highbits >= 0)
{
ival = highbits;
}
else
{
ival = highbits < 0 ? nwords + 2 : nwords + 1;
words = new int[ival];
words[nwords] = highbits;
while (--nwords >= 0)
words[nwords] = rnd.nextInt();
}
}
public BigInteger(int bitLength, int certainty, Random rnd)
@ -170,9 +186,7 @@ public class BigInteger extends Number implements Comparable
if (isProbablePrime(certainty))
return;
BigInteger next = new BigInteger(bitLength, rnd);
this.ival = next.ival;
this.words = next.words;
init(bitLength, rnd);
}
}