Implement modInverse for an even modulus.

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 98 matching lines @@
    * 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.
-   * Returns 0 if no modular inverse exists.
+   * Throws a RangeError if no modular inverse exists.
    */
   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;
 
   /**
@@ skipping 163 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) });
 }