test/java/math/BigInteger/BigIntegerTest.java

rev 7663 : 8014319: Faster division of large integers
Summary: Implement Burnickel-Ziegler division algorithm in BigInteger
Reviewed-by: bpb
Contributed-by: Tim Buktu <tbuktu@hotmail.com>
rev 7664 : 8020641: Clean up some code style in recent BigInteger contributions
Summary: Some minor cleanup to adhere better to Java coding conventions.
Reviewed-by: darcy
Contributed-by: Brian Burkhalter <brian.burkhalter@oracle.com>

*** 46,56 ****
   * Four arguments may be specified which give the number of
   * decimal digits you desire in the four batches of test numbers.
   *
   * The tests are performed on arrays of random numbers which are
   * generated by a Random class as well as special cases which
!  * throw in boundary numbers such as 0, 1, maximum SIZEd, etc.
   *
   */
  public class BigIntegerTest {
      //
      // Bit large number thresholds based on the int thresholds
--- 46,56 ----
   * Four arguments may be specified which give the number of
   * decimal digits you desire in the four batches of test numbers.
   *
   * The tests are performed on arrays of random numbers which are
   * generated by a Random class as well as special cases which
!  * throw in boundary numbers such as 0, 1, maximum sized, etc.
   *
   */
  public class BigIntegerTest {
      //
      // Bit large number thresholds based on the int thresholds
*** 1006,1016 ****
              throw new RuntimeException("Failure in BigIntegerTest.");
      }
  
      /*
       * Get a random or boundary-case number. This is designed to provide
!      * a lot of numbers that will find failure points, such as max SIZEd
       * numbers, empty BigIntegers, etc.
       *
       * If order is less than 2, order is changed to 2.
       */
      private static BigInteger fetchNumber(int order) {
--- 1006,1016 ----
              throw new RuntimeException("Failure in BigIntegerTest.");
      }
  
      /*
       * Get a random or boundary-case number. This is designed to provide
!      * a lot of numbers that will find failure points, such as max sized
       * numbers, empty BigIntegers, etc.
       *
       * If order is less than 2, order is changed to 2.
       */
      private static BigInteger fetchNumber(int order) {