From 4ed63286e3e67ba87df24b55ddac81dbb6168daf Mon Sep 17 00:00:00 2001
From: warrenl <warrenl@138bc75d-0d04-0410-961f-82ee72b054a4>
Date: Mon, 14 Feb 2000 10:23:29 +0000
Subject: 	* gnu/gcj/math/MPN.java(findLowestBit): Made methods public.

	* java/math/BigInteger.java(BigInteger(int,int,java.util.Random):
	  New constructor.
	(min): Implemented.
	(max): Implemented.
	(modPow): Rewritten to not use the naive, slow, brute force approach.
	(isProbablePrime): Implemented.
	(testBit): Implemented.
	(flipBit): Implemented.
	(getLowestSetBit): Implemented.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@31966 138bc75d-0d04-0410-961f-82ee72b054a4
---
 libjava/gnu/gcj/math/MPN.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'libjava/gnu')

diff --git a/libjava/gnu/gcj/math/MPN.java b/libjava/gnu/gcj/math/MPN.java
index 5bbabfdc3fe..6ae60f26a22 100644
--- a/libjava/gnu/gcj/math/MPN.java
+++ b/libjava/gnu/gcj/math/MPN.java
@@ -571,7 +571,7 @@ public class MPN
 
   /** Return least i such that word&(1<<i). Assumes word!=0. */
 
-  static int findLowestBit (int word)
+  public static int findLowestBit (int word)
   {
     int i = 0;
     while ((word & 0xF) == 0)
@@ -591,7 +591,7 @@ public class MPN
 
   /** Return least i such that words & (1<<i). Assumes there is such an i. */
 
-  static int findLowestBit (int[] words)
+  public static int findLowestBit (int[] words)
   {
     for (int i = 0;  ; i++)
       {
-- 
cgit v1.2.3