Implement modInverse (bigint version does not support even modulus yet).

sdk/lib/core/int.dart

 // Copyright (c) 2012, 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.
 
 part of dart.core;
 
 /**
  * An arbitrarily large integer.
  *
  * **Note:** When compiling to JavaScript, integers are
@@ skipping 93 matching lines @@
   int operator >>(int shiftAmount);
 
   /**
    * Returns this integer to the power of [exponent] modulo [modulus].
    *
    * The [exponent] must be non-negative and [modulus] must be
    * positive.
    */
   int modPow(int exponent, int modulus);
 
+  /**
+   * Returns the modular multiplicative inverse of this integer
+   * modulo [modulus].
+   *
+   * The [modulus] must be positive.
+   */
+  int modInverse(int modulus);
+
   /** Returns true if and only if this integer is even. */
   bool get isEven;
 
   /** Returns true if and only if this integer is odd. */
   bool get isOdd;
 
   /**
    * Returns the minimum number of bits required to store this integer.
    *
    * The number of bits excludes the sign bit, which gives the natural length
@@ skipping 160 matching lines @@
    *     var value = int.parse(text, onError: (source) => null);
    *     if (value == null) ... handle the problem
    *
    * The [onError] function is only invoked if [source] is a [String]. It is
    * not invoked if the [source] is, for example, `null`.
    */
   external static int parse(String source,
                             { int radix,
                               int onError(String source) });
 }