commit 56bcbf121b29a035fba68a87b0c77ffa9d12a845
author Annie Chin <afchin@google.com> Fri Sep 23 17:04:22 2016 -0700
committer Annie Chin <afchin@google.com> Wed Oct 12 17:23:51 2016 -0700
tree b7130caddce38b52b57c25e0de8014782c3e3bd3
parent fdc69f65ca2541712292bd2236fecf83779b2665

Accommodate unit tests.

Bug: 30416650

-Make some methods public for test access
-Add handling for KEYCODE_CLEAR
-Remove old tests

Change-Id: Icc180990b48e86d5a77d4b2ae6705927c540d10e

src/com/android/calculator2/BoundedRational.java

diff --git a/src/com/android/calculator2/BoundedRational.java b/src/com/android/calculator2/BoundedRational.java
index f2f7185..f3452a2 100644
--- a/src/com/android/calculator2/BoundedRational.java
+++ b/src/com/android/calculator2/BoundedRational.java
@@ -16,10 +16,10 @@
 
 package com.android.calculator2;
 
-import java.util.Random;
+import com.hp.creals.CR;
 
 import java.math.BigInteger;
-import com.hp.creals.CR;
+import java.util.Random;
 
 /**
  * Rational numbers that may turn to null if they get too big.
@@ -240,7 +240,7 @@
         return new BoundedRational(r.mNum.negate(), r.mDen);
     }
 
-    static BoundedRational subtract(BoundedRational r1, BoundedRational r2) {
+    public static BoundedRational subtract(BoundedRational r1, BoundedRational r2) {
         return add(r1, negate(r2));
     }
 
@@ -265,7 +265,7 @@
         return new BoundedRational(num,den);
     }
 
-    static BoundedRational multiply(BoundedRational r1, BoundedRational r2) {
+    public static BoundedRational multiply(BoundedRational r1, BoundedRational r2) {
         return maybeReduce(rawMultiply(r1, r2));
     }
 
@@ -278,7 +278,7 @@
     /**
      * Return the reciprocal of r (or null if the argument was null).
      */
-    static BoundedRational inverse(BoundedRational r) {
+    public static BoundedRational inverse(BoundedRational r) {
         if (r == null) {
             return null;
         }
@@ -288,11 +288,11 @@
         return new BoundedRational(r.mDen, r.mNum);
     }
 
-    static BoundedRational divide(BoundedRational r1, BoundedRational r2) {
+    public static BoundedRational divide(BoundedRational r1, BoundedRational r2) {
         return multiply(r1, inverse(r2));
     }
 
-    static BoundedRational sqrt(BoundedRational r) {
+    public static BoundedRational sqrt(BoundedRational r) {
         // Return non-null if numerator and denominator are small perfect squares.
         if (r == null) {
             return null;
@@ -396,7 +396,7 @@
      * Return Integer.MAX_VALUE if that's not possible.  Never returns a value less than zero, even
      * if r is a power of ten.
      */
-    static int digitsRequired(BoundedRational r) {
+    public static int digitsRequired(BoundedRational r) {
         if (r == null) {
             return Integer.MAX_VALUE;
         }