Add modPow tests.

tests/corelib/big_integer_arith_vm_test.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 // Testing Bigints with and without intrinsics.
 // VMOptions=
 // VMOptions=--no_intrinsify
 
 library big_integer_test;
 import "package:expect/expect.dart";
@@ skipping 121 matching lines @@
   var iStart = 4611686018427387900;
   var prevX = -23 % iStart;
   for (int i = iStart + 1; i < iStart + 10; i++) {
     var x = -23 % i;
     Expect.equals(1, x - prevX);
     Expect.isTrue(x > 0);
     prevX = x;
   }
 }
 
+testBigintModPow() {
+  var x, e, m;
+  x = 1234567890;
+  e = 1000000001;
+  m = 19;
+  Expect.equals(11, x.modPow(e, m));
+  x = 1234567890;
+  e = 19;
+  m = 1000000001;
+  Expect.equals(122998977, x.modPow(e, m));
+  x = 19;
+  e = 1234567890;
+  m = 1000000001;
+  Expect.equals(619059596, x.modPow(e, m));
+  x = 19;
+  e = 1000000001;
+  m = 1234567890;
+  Expect.equals(84910879, x.modPow(e, m));
+  x = 1000000001;
+  e = 19;
+  m = 1234567890;
+  Expect.equals(872984351, x.modPow(e, m));
+  x = 1000000001;
+  e = 1234567890;
+  m = 19;
+  Expect.equals(0, x.modPow(e, m));
+  x = 12345678901234567890;
+  e = 10000000000000000001;
+  m = 19;
+  Expect.equals(2, x.modPow(e, m));
+  x = 12345678901234567890;
+  e = 19;
+  m = 10000000000000000001;
+  Expect.equals(3239137215315834625, x.modPow(e, m));
+  x = 19;
+  e = 12345678901234567890;
+  m = 10000000000000000001;
+  Expect.equals(4544207837373941034, x.modPow(e, m));
+  x = 19;
+  e = 10000000000000000001;
+  m = 12345678901234567890;
+  Expect.equals(11135411705397624859, x.modPow(e, m));
+  x = 10000000000000000001;
+  e = 19;
+  m = 12345678901234567890;
+  Expect.equals(2034013733189773841, x.modPow(e, m));
+  x = 10000000000000000001;
+  e = 12345678901234567890;
+  m = 19;
+  Expect.equals(1, x.modPow(e, m));
+  x = 12345678901234567890;
+  e = 19;
+  m = 10000000000000000001;
+  Expect.equals(3239137215315834625, x.modPow(e, m));
+  x = 12345678901234567890;
+  e = 10000000000000000001;
+  m = 19;
+  Expect.equals(2, x.modPow(e, m));
+  x = 123456789012345678901234567890;
+  e = 123456789012345678901234567891;
+  m = 123456789012345678901234567899;
+  Expect.equals(116401406051033429924651549616, x.modPow(e, m));
+  x = 123456789012345678901234567890;
+  e = 123456789012345678901234567899;
+  m = 123456789012345678901234567891;
+  Expect.equals(123456789012345678901234567890, x.modPow(e, m));
+  x = 123456789012345678901234567899;
+  e = 123456789012345678901234567890;
+  m = 123456789012345678901234567891;
+  Expect.equals(35088523091000351053091545070, x.modPow(e, m));
+  x = 123456789012345678901234567899;
+  e = 123456789012345678901234567891;
+  m = 123456789012345678901234567890;
+  Expect.equals(18310047270234132455316941949, x.modPow(e, m));
+  x = 123456789012345678901234567891;
+  e = 123456789012345678901234567899;
+  m = 123456789012345678901234567890;
+  Expect.equals(1, x.modPow(e, m));
+  x = 123456789012345678901234567891;
+  e = 123456789012345678901234567890;
+  m = 123456789012345678901234567899;
+  Expect.equals(40128068573873018143207285483, x.modPow(e, m));
+}
+
 testBigintNegate() {
   var a = 0xF000000000000000F;
   var b = ~a;  // negate.
   Expect.equals(-0xF0000000000000010, b);
   Expect.equals(0, a & b);
   Expect.equals(-1, a | b);
 }
 
 testShiftAmount() {
   Expect.equals(0, 12 >> 111111111111111111111111111111);
   Expect.equals(-1, -12 >> 111111111111111111111111111111);
   bool exceptionCaught = false;
   try {
     var a = 1 << 1111111111111111111111111111;
   } on OutOfMemoryError catch (e) {
     exceptionCaught = true;
   }
   Expect.equals(true, exceptionCaught);
 }
 
 main() {
   Expect.equals(1234567890123456789, foo());
   Expect.equals(12345678901234567890, bar());
   testSmiOverflow();
   testBigintAdd();
   testBigintSub();
   testBigintMul();
-  testBigintModulo();
   testBigintTruncDiv();
   testBigintDiv();
+  testBigintModulo();
+  testBigintModPow();
   testBigintNegate();
   testShiftAmount();
   Expect.equals(12345678901234567890, (12345678901234567890).abs());
   Expect.equals(12345678901234567890, (-12345678901234567890).abs());
   var a = 10000000000000000000;
   var b = 10000000000000000001;
   Expect.equals(false, a.hashCode == b.hashCode);
   Expect.equals(true, a.hashCode == (b - 1).hashCode);
-  // TODO(regis): Add a test for modPow once it is public.
 }