Update all tests

tests/corelib_strong/int_modulo_arith_test.dart

 // Copyright (c) 2015, 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.
 
 import "package:expect/expect.dart";
 
 import "dart:math" show pow;
 
 var smallNumber = 1234567890;   // is 31-bit integer.
 var mediumNumber = 1234567890123456;  // is 53-bit integer
@@ skipping 100 matching lines @@
   test(19, 1234567890, 519818059);
   test(1000000001, 1234567890, 1001100101);
 
   test(12345, 12346, 12345);
   test(12345, 12346, 12345);
 
   test(smallNumber, 137, 42);
   test(137, smallNumber, 856087223);
   test(mediumNumber, 137, 77);
   test(137, mediumNumber, 540686667207353);
-  test(bigNumber, 137, 128);                  /// bignum: ok
+  test(bigNumber, 137, 128);                  //# bignum: ok
   // Bigger numbers as modulo is tested in big_integer_arith_vm_test.dart.
   // Big doubles are not co-prime, so there is nothing to test for dart2js.
 }
 
 testGcd() {
   // Call testFunc with all combinations and orders of plus/minus
   // value and other.
   callCombos(value, other, testFunc) {
     testFunc(value, other);
     testFunc(value, -other);
@@ skipping 64 matching lines @@
   test(0x3FFFFFFF, 0x40000000, 1);
 
   test(pow(2, 54), pow(2, 53), pow(2, 53));
 
   test((pow(2, 52) - 1) * pow(2, 14),
        (pow(2, 26) - 1) * pow(2, 22),
        (pow(2, 26) - 1) * pow(2, 14));
 }
 
 main() {
-  testModPow();  /// modPow: ok
+  testModPow();  //# modPow: ok
   testModInverse();
   testGcd();
 }