SDK fixes

lib/runtime/dart/collection.js

 var collection;
 (function(exports) {
   'use strict';
   let _source = Symbol('_source');
   let UnmodifiableListView$ = dart.generic(function(E) {
     class UnmodifiableListView extends _internal.UnmodifiableListBase$(E) {
       UnmodifiableListView(source) {
         this[_source] = source;
       }
       get [core.$length]() {
@@ skipping 1657 matching lines @@
           throw _internal.IterableElementError.noElement();
         }
         let result = this[core.$get](dart.notNull(this[core.$length]) - 1);
         this[core.$length] = dart.notNull(this[core.$length]) - 1;
         return result;
       }
       [core.$sort](compare) {
         if (compare === void 0)
           compare = null;
         dart.as(compare, dart.functionType(core.int, [E, E]));
-        if (compare == null) {
-          let defaultCompare = dart.bind(core.Comparable, 'compare');
-          compare = defaultCompare;
-        }
-        _internal.Sort.sort(this, compare);
+        _internal.Sort.sort(this, dart.as(compare == null ? dart.bind(core.Comparable, 'compare') : compare, __CastType20));
       }
       [core.$shuffle](random) {
         if (random === void 0)
           random = null;
         if (random == null)
           random = new math.Random();
         let length = this[core.$length];
         while (dart.notNull(length) > 1) {
           let pos = random.nextInt(length);
           length = dart.notNull(length) - 1;
@@ skipping 192 matching lines @@
   let ListMixin = ListMixin$();
   let ListBase$ = dart.generic(function(E) {
     class ListBase extends dart.mixin(core.Object, ListMixin$(E)) {
       static listToString(list) {
         return IterableBase.iterableToFullString(list, '[', ']');
       }
     }
     return ListBase;
   });
   let ListBase = ListBase$();
+  let __CastType20 = dart.typedef('__CastType20', () => dart.functionType(core.int, [dart.dynamic, dart.dynamic]));
   let MapMixin$ = dart.generic(function(K, V) {
     class MapMixin extends core.Object {
       forEach(action) {
         dart.as(action, dart.functionType(dart.void, [K, V]));
         for (let key of this.keys) {
           action(key, this.get(key));
         }
       }
       addAll(other) {
         dart.as(other, core.Map$(K, V));
         for (let key of other.keys) {
           this.set(key, other.get(key));
         }
       }
       containsValue(value) {
-        dart.as(value, V);
         for (let key of this.keys) {
           if (dart.equals(this.get(key), value))
             return true;
         }
         return false;
       }
       putIfAbsent(key, ifAbsent) {
         dart.as(key, K);
         dart.as(ifAbsent, dart.functionType(V, []));
         if (this.keys[core.$contains](key)) {
@@ skipping 1036 matching lines @@
       }
       [_clear]() {
         this[_root] = null;
         this[_count] = 0;
         this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
       }
     }
     return _SplayTree;
   });
   let _SplayTree = _SplayTree$();
-  let _TypeTest$ = dart.generic(function(T) {
-    class _TypeTest extends core.Object {
-      test(v) {
-        return dart.is(v, T);
-      }
-    }
-    return _TypeTest;
-  });
-  let _TypeTest = _TypeTest$();
   let _comparator = Symbol('_comparator');
   let _validKey = Symbol('_validKey');
   let SplayTreeMap$ = dart.generic(function(K, V) {
     class SplayTreeMap extends _SplayTree$(K) {
       SplayTreeMap(compare, isValidKey) {
         if (compare === void 0)
           compare = null;
         if (isValidKey === void 0)
           isValidKey = null;
         this[_comparator] = dart.as(compare == null ? dart.bind(core.Comparable, 'compare') : compare, core.Comparator$(K));
@@ skipping 237 matching lines @@
         this[_splayCount] = tree[_splayCount];
         if (dart.notNull(compare) < 0) {
           this[_findLeftMostDescendent](tree[_root].right);
         } else {
           this[_workList][core.$add](tree[_root]);
         }
       }
       get current() {
         if (this[_currentNode] == null)
           return null;
-        return this[_getValue](this[_currentNode]);
+        return this[_getValue](dart.as(this[_currentNode], _SplayTreeMapNode));
       }
       [_findLeftMostDescendent](node) {
         while (node != null) {
           this[_workList][core.$add](node);
           node = node.left;
         }
       }
       [_rebuildWorkList](currentNode) {
         dart.assert(!dart.notNull(this[_workList][core.$isEmpty]));
         this[_workList][core.$clear]();
@@ skipping 37 matching lines @@
         return this[_tree][_count];
       }
       get [core.$isEmpty]() {
         return this[_tree][_count] == 0;
       }
       get [core.$iterator]() {
         return new (_SplayTreeKeyIterator$(K))(this[_tree]);
       }
       [core.$toSet]() {
         let setOrMap = this[_tree];
-        let set = new (SplayTreeSet$(K))(dart.as(setOrMap[_comparator], __CastType20), dart.as(setOrMap[_validKey], __CastType23));
+        let set = new (SplayTreeSet$(K))(dart.as(setOrMap[_comparator], __CastType23), dart.as(setOrMap[_validKey], __CastType26));
         set[_count] = this[_tree][_count];
         set[_root] = set[_copyNode](this[_tree][_root]);
         return set;
       }
     }
     _SplayTreeKeyIterable[dart.implements] = () => [_internal.EfficientLength];
     return _SplayTreeKeyIterable;
   });
   let _SplayTreeKeyIterable = _SplayTreeKeyIterable$();
   let _SplayTreeValueIterable$ = dart.generic(function(K, V) {
@@ skipping 138 matching lines @@
           }
         }
       }
       removeAll(elements) {
         for (let element of elements) {
           if (dart.dcall(this[_validKey], element))
             this[_remove](dart.as(element, E));
         }
       }
       retainAll(elements) {
-        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], __CastType25), this[_validKey]);
+        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], __CastType28), this[_validKey]);
         let modificationCount = this[_modificationCount];
         for (let object of elements) {
           if (modificationCount != this[_modificationCount]) {
             throw new core.ConcurrentModificationError(this);
           }
           if (dart.notNull(dart.dcall(this[_validKey], object)) && this[_splay](dart.as(object, E)) == 0)
             retainSet.add(this[_root].key);
         }
         if (retainSet[_count] != this[_count]) {
           this[_root] = retainSet[_root];
           this[_count] = retainSet[_count];
           this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
         }
       }
       lookup(object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return null;
         let comp = this[_splay](dart.as(object, E));
         if (comp != 0)
           return null;
         return this[_root].key;
       }
       intersection(other) {
-        dart.as(other, core.Set$(E));
         let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         for (let element of this) {
           if (other[core.$contains](element))
             result.add(element);
         }
         return result;
       }
       difference(other) {
-        dart.as(other, core.Set$(E));
         let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         for (let element of this) {
           if (!dart.notNull(other[core.$contains](element)))
             result.add(element);
         }
         return result;
       }
       union(other) {
         dart.as(other, core.Set$(E));
         let _ = this[_clone]();
@@ skipping 22 matching lines @@
         return this[_clone]();
       }
       toString() {
         return IterableBase.iterableToFullString(this, '{', '}');
       }
     }
     dart.defineNamedConstructor(SplayTreeSet, 'from');
     return SplayTreeSet;
   });
   let SplayTreeSet = SplayTreeSet$();
-  let __CastType20$ = dart.generic(function(K) {
-    let __CastType20 = dart.typedef('__CastType20', () => dart.functionType(core.int, [K, K]));
-    return __CastType20;
+  let __CastType23$ = dart.generic(function(K) {
+    let __CastType23 = dart.typedef('__CastType23', () => dart.functionType(core.int, [K, K]));
+    return __CastType23;
   });
-  let __CastType20 = __CastType20$();
-  let __CastType23 = dart.typedef('__CastType23', () => dart.functionType(core.bool, [dart.dynamic]));
-  let __CastType25$ = dart.generic(function(E) {
-    let __CastType25 = dart.typedef('__CastType25', () => dart.functionType(core.int, [E, E]));
-    return __CastType25;
+  let __CastType23 = __CastType23$();
+  let __CastType26 = dart.typedef('__CastType26', () => dart.functionType(core.bool, [dart.dynamic]));
+  let __CastType28$ = dart.generic(function(E) {
+    let __CastType28 = dart.typedef('__CastType28', () => dart.functionType(core.int, [E, E]));
+    return __CastType28;
   });
-  let __CastType25 = __CastType25$();
+  let __CastType28 = __CastType28$();
   let _strings = Symbol('_strings');
   let _nums = Symbol('_nums');
   let _rest = Symbol('_rest');
   let _containsKey = Symbol('_containsKey');
   let _getBucket = Symbol('_getBucket');
   let _findBucketIndex = Symbol('_findBucketIndex');
   let _computeKeys = Symbol('_computeKeys');
   let _get = Symbol('_get');
   let _addHashTableEntry = Symbol('_addHashTableEntry');
   let _set = Symbol('_set');
@@ skipping 1632 matching lines @@
   exports.LinkedHashMapKeyIterable$ = LinkedHashMapKeyIterable$;
   exports.LinkedHashMapKeyIterable = LinkedHashMapKeyIterable;
   exports.LinkedHashMapKeyIterator$ = LinkedHashMapKeyIterator$;
   exports.LinkedHashMapKeyIterator = LinkedHashMapKeyIterator;
   exports.HashSetIterator$ = HashSetIterator$;
   exports.HashSetIterator = HashSetIterator;
   exports.LinkedHashSetCell = LinkedHashSetCell;
   exports.LinkedHashSetIterator$ = LinkedHashSetIterator$;
   exports.LinkedHashSetIterator = LinkedHashSetIterator;
 })(collection || (collection = {}));