Big merge from experimental to bleeding edge.

runtime/lib/integers.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.
 
 // TODO(srdjan): fix limitations.
 // - shift amount must be a Smi.
 class _IntegerImplementation {
   factory _IntegerImplementation._uninstantiable() {
     throw new UnsupportedError(
         "_IntegerImplementation can only be allocated by the VM");
@@ skipping 113 matching lines @@
     } else {
       return EQUAL;
     }
   }
 
   int round() { return this; }
   int floor() { return this; }
   int ceil() { return this; }
   int truncate() { return this; }
 
+  num clamp(num lowerLimit, num upperLimit) {
+    if (lowerLimit is! num) throw new ArgumentError(lowerLimit);
+    if (upperLimit is! num) throw new ArgumentError(upperLimit);
+
+    // Special case for integers.
+    if (lowerLimit is int && upperLimit is int) {
+      if (lowerLimit > upperLimit) {
+        throw new ArgumentError(lowerLimit);
+      }
+      if (this < lowerLimit) return lowerLimit;
+      if (this > upperLimit) return upperLimit;
+      return this;
+    }
+    // Generic case involving doubles.
+    if (lowerLimit.compareTo(upperLimit) > 0) {
+      throw new ArgumentError(lowerLimit);
+    }
+    if (lowerLimit.isNaN) return lowerLimit;
+    // Note that we don't need to care for -0.0 for the lower limit.
+    if (this < lowerLimit) return lowerLimit;
+    if (this.compareTo(upperLimit) > 0) return upperLimit;
+    return this;
+  }
+
   int toInt() { return this; }
   double toDouble() { return new _Double.fromInteger(this); }
 
   int pow(int exponent) {
     double res = this.toDouble().pow(exponent);
     if (res.isInfinite) {
       // Use Bigint instead.
       throw "_IntegerImplementation.pow not implemented for large integers.";
     }
     return res.toInt();
   }
 
   String toStringAsFixed(int fractionDigits) {
     return this.toDouble().toStringAsFixed(fractionDigits);
   }
-  String toStringAsExponential(int fractionDigits) {
+  String toStringAsExponential([int fractionDigits]) {
     return this.toDouble().toStringAsExponential(fractionDigits);
   }
   String toStringAsPrecision(int precision) {
     return this.toDouble().toStringAsPrecision(precision);
   }
+
   String toRadixString(int radix) {
     final table = const ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9",
                          "a", "b", "c", "d", "e", "f", "g", "h", "i", "j",
                          "k", "l", "m", "n", "o", "p", "q", "r", "s", "t",
                          "u", "v", "w", "x", "y", "z"];
-    if (radix < 2 || radix > 36) {
+    if (radix is! int || radix < 2 || radix > 36) {
       throw new ArgumentError(radix);
     }
     final bool isNegative = this < 0;
-    var value = isNegative ? -this : this;
+    int value = isNegative ? -this : this;
     List temp = new List();
     while (value > 0) {
-      var digit = value % radix;
+      int digit = value % radix;
       value ~/= radix;
       temp.add(digit);
     }
     if (temp.isEmpty) {
       return "0";
     }
     StringBuffer buffer = new StringBuffer();
     if (isNegative) buffer.add("-");
     for (int i = temp.length - 1; i >= 0; i--) {
       buffer.add(table[temp[i]]);
@@ skipping 60 matching lines @@
     }
   }
   int _shlFromInt(int other) {
     throw const OutOfMemoryError();
   }
 
   int pow(int exponent) {
     throw "Bigint.pow not implemented";
   }
 }