Update to latest analyzer

lib/runtime/dart/collection.js

 dart_library.library('dart/collection', null, /* Imports */[
   "dart/_runtime",
   'dart/core'
 ], /* Lazy imports */[
   'dart/_internal',
   'dart/_js_helper',
   'dart/math'
 ], function(exports, dart, core, _internal, _js_helper, math) {
   'use strict';
   let dartx = dart.dartx;
@@ skipping 66 matching lines @@
         }
         return new (_CustomHashMap$(K, V))(equals, hashCode, isValidKey);
       }
       static identity() {
         return new (_IdentityHashMap$(K, V))();
       }
       static from(other) {
         let result = HashMap$(K, V).new();
         other.forEach(dart.fn((k, v) => {
           result.set(dart.as(k, K), dart.as(v, V));
-        }));
+        }, dart.void, [dart.dynamic, dart.dynamic]));
         return result;
       }
       static fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let map = HashMap$(K, V).new();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
       static fromIterables(keys, values) {
@@ skipping 139 matching lines @@
         let value = iterator.current;
         while (dart.notNull(iterator.moveNext())) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       fold(initialValue, combine) {
         dart.as(combine, dart.functionType(dart.dynamic, [dart.dynamic, E]));
         let value = initialValue;
         for (let element of this)
-          value = dart.dcall(combine, value, element);
+          value = combine(value, element);
         return value;
       }
       every(f) {
         dart.as(f, dart.functionType(core.bool, [E]));
         for (let element of this) {
           if (!dart.notNull(f(element))) return false;
         }
         return true;
       }
       join(separator) {
@@ skipping 304 matching lines @@
         let value = iterator.current;
         while (dart.notNull(iterator.moveNext())) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       fold(initialValue, combine) {
         dart.as(combine, dart.functionType(dart.dynamic, [dart.dynamic, E]));
         let value = initialValue;
         for (let element of this)
-          value = dart.dcall(combine, value, element);
+          value = combine(value, element);
         return value;
       }
       every(f) {
         dart.as(f, dart.functionType(core.bool, [E]));
         for (let element of this) {
           if (!dart.notNull(f(element))) return false;
         }
         return true;
       }
       join(separator) {
@@ skipping 233 matching lines @@
         let value = iterator.current;
         while (dart.notNull(iterator.moveNext())) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       fold(initialValue, combine) {
         dart.as(combine, dart.functionType(dart.dynamic, [dart.dynamic, E]));
         let value = initialValue;
         for (let element of this)
-          value = dart.dcall(combine, value, element);
+          value = combine(value, element);
         return value;
       }
       every(f) {
         dart.as(f, dart.functionType(core.bool, [E]));
         for (let element of this) {
           if (!dart.notNull(f(element))) return false;
         }
         return true;
       }
       join(separator) {
@@ skipping 404 matching lines @@
         }
         return new (_LinkedCustomHashMap$(K, V))(equals, hashCode, isValidKey);
       }
       static identity() {
         return new (_LinkedIdentityHashMap$(K, V))();
       }
       static from(other) {
         let result = LinkedHashMap$(K, V).new();
         other.forEach(dart.fn((k, v) => {
           result.set(dart.as(k, K), dart.as(v, V));
-        }));
+        }, dart.void, [dart.dynamic, dart.dynamic]));
         return result;
       }
       static fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let map = LinkedHashMap$(K, V).new();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
       static fromIterables(keys, values) {
@@ skipping 98 matching lines @@
       addFirst(entry) {
         dart.as(entry, E);
         this[_insertAfter](this, entry);
       }
       add(entry) {
         dart.as(entry, E);
         this[_insertAfter](this[_previous], entry);
       }
       addAll(entries) {
         dart.as(entries, core.Iterable$(E));
-        entries[dartx.forEach](dart.fn((entry => this[_insertAfter](this[_previous], dart.as(entry, E))).bind(this), dart.void, [dart.dynamic]));
+        entries[dartx.forEach](dart.fn((entry => this[_insertAfter](this[_previous], entry)).bind(this), dart.void, [E]));
       }
       remove(entry) {
         dart.as(entry, E);
         if (!dart.equals(entry[_list], this)) return false;
         this[_unlink](entry);
         return true;
       }
       get iterator() {
         return new (_LinkedListIterator$(E))(this);
       }
@@ skipping 307 matching lines @@
         let buffer = new core.StringBuffer();
         buffer.writeAll(this, separator);
         return dart.toString(buffer);
       }
       where(test) {
         dart.as(test, dart.functionType(core.bool, [E]));
         return new (_internal.WhereIterable$(E))(this, test);
       }
       map(f) {
         dart.as(f, dart.functionType(dart.dynamic, [E]));
-        return new _internal.MappedListIterable(this, f);
+        return new (_internal.MappedListIterable$(E, dart.dynamic))(this, f);
       }
       expand(f) {
         dart.as(f, dart.functionType(core.Iterable, [E]));
         return new (_internal.ExpandIterable$(E, dart.dynamic))(this, f);
       }
       reduce(combine) {
         dart.as(combine, dart.functionType(E, [E, E]));
         let length = this.length;
         if (length == 0) dart.throw(_internal.IterableElementError.noElement());
         let value = this.get(0);
         for (let i = 1; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           value = combine(value, this.get(i));
           if (length != this.length) {
             dart.throw(new core.ConcurrentModificationError(this));
           }
         }
         return value;
       }
       fold(initialValue, combine) {
         dart.as(combine, dart.functionType(dart.dynamic, [dart.dynamic, E]));
         let value = initialValue;
         let length = this.length;
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
-          value = dart.dcall(combine, value, this.get(i));
+          value = combine(value, this.get(i));
           if (length != this.length) {
             dart.throw(new core.ConcurrentModificationError(this));
           }
         }
         return value;
       }
       skip(count) {
         return new (_internal.SubListIterable$(E))(this, count, null);
       }
       skipWhile(test) {
@@ skipping 89 matching lines @@
         if (this[dartx.length] == 0) {
           dart.throw(_internal.IterableElementError.noElement());
         }
         let result = this.get(dart.notNull(this[dartx.length]) - 1);
         this[dartx.length] = dart.notNull(this[dartx.length]) - 1;
         return result;
       }
       sort(compare) {
         if (compare === void 0) compare = null;
         dart.as(compare, dart.functionType(core.int, [E, E]));
-        _internal.Sort.sort(this, compare == null ? core.Comparable.compare : compare);
+        _internal.Sort.sort(this, dart.as(compare == null ? core.Comparable.compare : compare, __CastType0));
       }
       shuffle(random) {
         if (random === void 0) random = null;
         if (random == null) random = math.Random.new();
         let length = this.length;
         while (dart.notNull(length) > 1) {
           let pos = random.nextInt(length);
           length = dart.notNull(length) - 1;
           let tmp = this.get(length);
           this.set(length, this.get(pos));
@@ skipping 282 matching lines @@
         return IterableBase.iterableToFullString(list, '[', ']');
       }
     }
     dart.setSignature(ListBase, {
       statics: () => ({listToString: [core.String, [core.List]]}),
       names: ['listToString']
     });
     return ListBase;
   });
   let ListBase = ListBase$();
+  const __CastType0 = dart.typedef('__CastType0', () => dart.functionType(core.int, [dart.dynamic, dart.dynamic]));
   const 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));
@@ skipping 313 matching lines @@
         result.write('{');
         let first = true;
         m.forEach(dart.fn((k, v) => {
           if (!dart.notNull(first)) {
             result.write(', ');
           }
           first = false;
           result.write(k);
           result.write(': ');
           result.write(v);
-        }));
+        }, dart.void, [dart.dynamic, dart.dynamic]));
         result.write('}');
       } finally {
         dart.assert(core.identical(IterableBase._toStringVisiting[dartx.last], m));
         IterableBase._toStringVisiting[dartx.removeLast]();
       }
       return dart.toString(result);
     }
     static _id(x) {
       return x;
     }
@@ skipping 902 matching lines @@
   });
   let _SplayTree = _SplayTree$();
   const _comparator = Symbol('_comparator');
   const _validKey = Symbol('_validKey');
   const 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 ? core.Comparable.compare : compare, core.Comparator$(K));
-        this[_validKey] = isValidKey != null ? isValidKey : dart.fn(v => dart.is(v, K), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(isValidKey != null ? isValidKey : dart.fn(v => dart.is(v, K), core.bool, [core.Object]), _Predicate$(core.Object));
         super._SplayTree();
       }
       static from(other, compare, isValidKey) {
         if (compare === void 0) compare = null;
         if (isValidKey === void 0) isValidKey = null;
         let result = new (SplayTreeMap$(K, V))();
         other.forEach(dart.fn((k, v) => {
           result.set(dart.as(k, K), dart.as(v, V));
-        }));
+        }, dart.void, [dart.dynamic, dart.dynamic]));
         return result;
       }
       static fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let compare = opts && 'compare' in opts ? opts.compare : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         let map = new (SplayTreeMap$(K, V))(compare, isValidKey);
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
@@ skipping 69 matching lines @@
         }
         this[_addNewRoot](new (_SplayTreeMapNode$(K, dart.dynamic))(key, value), comp);
         return value;
       }
       addAll(other) {
         dart.as(other, core.Map$(K, V));
         other.forEach(dart.fn(((key, value) => {
           dart.as(key, K);
           dart.as(value, V);
           this.set(key, value);
-        }).bind(this), dart.dynamic, [K, V]));
+        }).bind(this), dart.void, [K, V]));
       }
       get isEmpty() {
         return this[_root] == null;
       }
       get isNotEmpty() {
         return !dart.notNull(this.isEmpty);
       }
       forEach(f) {
         dart.as(f, dart.functionType(dart.void, [K, V]));
         let nodes = new (_SplayTreeNodeIterator$(K))(this);
@@ skipping 298 matching lines @@
     return _SplayTreeNodeIterator;
   });
   let _SplayTreeNodeIterator = _SplayTreeNodeIterator$();
   const _clone = Symbol('_clone');
   const SplayTreeSet$ = dart.generic(function(E) {
     class SplayTreeSet extends dart.mixin(_SplayTree$(E), IterableMixin$(E), SetMixin$(E)) {
       SplayTreeSet(compare, isValidKey) {
         if (compare === void 0) compare = null;
         if (isValidKey === void 0) isValidKey = null;
         this[_comparator] = dart.as(compare == null ? core.Comparable.compare : compare, core.Comparator$(E));
-        this[_validKey] = isValidKey != null ? isValidKey : dart.fn(v => dart.is(v, E), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(isValidKey != null ? isValidKey : dart.fn(v => dart.is(v, E), core.bool, [core.Object]), _Predicate$(core.Object));
         super._SplayTree();
       }
       static from(elements, compare, isValidKey) {
         if (compare === void 0) compare = null;
         if (isValidKey === void 0) isValidKey = null;
         let result = new (SplayTreeSet$(E))(compare, isValidKey);
         for (let element of dart.as(elements, core.Iterable$(E))) {
           result.add(element);
         }
         return result;
@@ skipping 182 matching lines @@
       get isEmpty() {
         return this[_length] == 0;
       }
       get isNotEmpty() {
         return !dart.notNull(this.isEmpty);
       }
       get keys() {
         return new (HashMapKeyIterable$(K))(this);
       }
       get values() {
-        return _internal.MappedIterable$(K, V).new(this.keys, dart.fn((each => this.get(each)).bind(this), V, [dart.dynamic]));
+        return _internal.MappedIterable$(K, V).new(this.keys, dart.fn((each => this.get(each)).bind(this), V, [K]));
       }
       containsKey(key) {
         if (dart.notNull(_HashMap$()._isStringKey(key))) {
           let strings = this[_strings];
           return strings == null ? false : _HashMap$()._hasTableEntry(strings, key);
         } else if (dart.notNull(_HashMap$()._isNumericKey(key))) {
           let nums = this[_nums];
           return nums == null ? false : _HashMap$()._hasTableEntry(nums, key);
         } else {
           return this[_containsKey](key);
         }
       }
       [_containsKey](key) {
         let rest = this[_rest];
         if (rest == null) return false;
         let bucket = this[_getBucket](rest, key);
         return dart.notNull(this[_findBucketIndex](bucket, key)) >= 0;
       }
       containsValue(value) {
         return this[_computeKeys]()[dartx.any](dart.fn((each => dart.equals(this.get(each), value)).bind(this), core.bool, [dart.dynamic]));
       }
       addAll(other) {
         dart.as(other, core.Map$(K, V));
         other.forEach(dart.fn(((key, value) => {
           dart.as(key, K);
           dart.as(value, V);
           this.set(key, value);
-        }).bind(this), dart.dynamic, [K, V]));
+        }).bind(this), dart.void, [K, V]));
       }
       get(key) {
         if (dart.notNull(_HashMap$()._isStringKey(key))) {
           let strings = this[_strings];
-          return strings == null ? null : dart.as(_HashMap$()._getTableEntry(strings, key), V);
+          return dart.as(strings == null ? null : _HashMap$()._getTableEntry(strings, key), V);
         } else if (dart.notNull(_HashMap$()._isNumericKey(key))) {
           let nums = this[_nums];
-          return nums == null ? null : dart.as(_HashMap$()._getTableEntry(nums, key), V);
+          return dart.as(nums == null ? null : _HashMap$()._getTableEntry(nums, key), V);
         } else {
           return this[_get](key);
         }
       }
       [_get](key) {
         let rest = this[_rest];
         if (rest == null) return null;
         let bucket = this[_getBucket](rest, key);
         let index = this[_findBucketIndex](bucket, key);
-        return dart.notNull(index) < 0 ? null : dart.as(bucket[dart.notNull(index) + 1], V);
+        return dart.as(dart.notNull(index) < 0 ? null : bucket[dart.notNull(index) + 1], V);
       }
       set(key, value) {
         dart.as(key, K);
         dart.as(value, V);
         if (dart.notNull(_HashMap$()._isStringKey(key))) {
           let strings = this[_strings];
           if (strings == null) this[_strings] = strings = _HashMap$()._newHashTable();
           this[_addHashTableEntry](strings, key, value);
         } else if (dart.notNull(_HashMap$()._isNumericKey(key))) {
           let nums = this[_nums];
@@ skipping 237 matching lines @@
     return _IdentityHashMap;
   });
   let _IdentityHashMap = _IdentityHashMap$();
   const _equals = Symbol('_equals');
   const _hashCode = Symbol('_hashCode');
   const _CustomHashMap$ = dart.generic(function(K, V) {
     class _CustomHashMap extends _HashMap$(K, V) {
       _CustomHashMap(equals, hashCode, validKey) {
         this[_equals] = equals;
         this[_hashCode] = hashCode;
-        this[_validKey] = validKey != null ? validKey : dart.fn(v => dart.is(v, K), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(validKey != null ? validKey : dart.fn(v => dart.is(v, K), core.bool, [core.Object]), _Predicate$(core.Object));
         super._HashMap();
       }
       get(key) {
         if (!dart.notNull(this[_validKey](key))) return null;
         return super[_get](key);
       }
       set(key, value) {
         dart.as(key, K);
         dart.as(value, V);
         super[_set](key, value);
@@ skipping 135 matching lines @@
       get isEmpty() {
         return this[_length] == 0;
       }
       get isNotEmpty() {
         return !dart.notNull(this.isEmpty);
       }
       get keys() {
         return new (LinkedHashMapKeyIterable$(K))(this);
       }
       get values() {
-        return _internal.MappedIterable$(K, V).new(this.keys, dart.fn((each => this.get(each)).bind(this), V, [dart.dynamic]));
+        return _internal.MappedIterable$(K, V).new(this.keys, dart.fn((each => this.get(each)).bind(this), V, [K]));
       }
       containsKey(key) {
         if (dart.notNull(_LinkedHashMap$()._isStringKey(key))) {
           let strings = this[_strings];
           if (strings == null) return false;
           let cell = dart.as(_LinkedHashMap$()._getTableEntry(strings, key), LinkedHashMapCell);
           return cell != null;
         } else if (dart.notNull(_LinkedHashMap$()._isNumericKey(key))) {
           let nums = this[_nums];
           if (nums == null) return false;
           let cell = dart.as(_LinkedHashMap$()._getTableEntry(nums, key), LinkedHashMapCell);
           return cell != null;
         } else {
           return this[_containsKey](key);
         }
       }
       [_containsKey](key) {
         let rest = this[_rest];
         if (rest == null) return false;
         let bucket = this[_getBucket](rest, key);
         return dart.notNull(this[_findBucketIndex](bucket, key)) >= 0;
       }
       containsValue(value) {
-        return this.keys[dartx.any](dart.fn((each => dart.equals(this.get(each), value)).bind(this), core.bool, [dart.dynamic]));
+        return this.keys[dartx.any](dart.fn((each => dart.equals(this.get(each), value)).bind(this), core.bool, [K]));
       }
       addAll(other) {
         dart.as(other, core.Map$(K, V));
         other.forEach(dart.fn(((key, value) => {
           dart.as(key, K);
           dart.as(value, V);
           this.set(key, value);
-        }).bind(this), dart.dynamic, [K, V]));
+        }).bind(this), dart.void, [K, V]));
       }
       get(key) {
         if (dart.notNull(_LinkedHashMap$()._isStringKey(key))) {
           let strings = this[_strings];
           if (strings == null) return null;
           let cell = dart.as(_LinkedHashMap$()._getTableEntry(strings, key), LinkedHashMapCell);
-          return cell == null ? null : dart.as(cell[_value], V);
+          return dart.as(cell == null ? null : cell[_value], V);
         } else if (dart.notNull(_LinkedHashMap$()._isNumericKey(key))) {
           let nums = this[_nums];
           if (nums == null) return null;
           let cell = dart.as(_LinkedHashMap$()._getTableEntry(nums, key), LinkedHashMapCell);
-          return cell == null ? null : dart.as(cell[_value], V);
+          return dart.as(cell == null ? null : cell[_value], V);
         } else {
           return this[_get](key);
         }
       }
       [_get](key) {
         let rest = this[_rest];
         if (rest == null) return null;
         let bucket = this[_getBucket](rest, key);
         let index = this[_findBucketIndex](bucket, key);
         if (dart.notNull(index) < 0) return null;
@@ skipping 238 matching lines @@
       }
     }
     return _LinkedIdentityHashMap;
   });
   let _LinkedIdentityHashMap = _LinkedIdentityHashMap$();
   const _LinkedCustomHashMap$ = dart.generic(function(K, V) {
     class _LinkedCustomHashMap extends _LinkedHashMap$(K, V) {
       _LinkedCustomHashMap(equals, hashCode, validKey) {
         this[_equals] = equals;
         this[_hashCode] = hashCode;
-        this[_validKey] = validKey != null ? validKey : dart.fn(v => dart.is(v, K), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(validKey != null ? validKey : dart.fn(v => dart.is(v, K), core.bool, [core.Object]), _Predicate$(core.Object));
         super._LinkedHashMap();
       }
       get(key) {
         if (!dart.notNull(this[_validKey](key))) return null;
         return super[_get](key);
       }
       set(key, value) {
         dart.as(key, K);
         dart.as(value, V);
         super[_set](key, value);
@@ skipping 410 matching lines @@
     return _IdentityHashSet;
   });
   let _IdentityHashSet = _IdentityHashSet$();
   const _equality = Symbol('_equality');
   const _hasher = Symbol('_hasher');
   const _CustomHashSet$ = dart.generic(function(E) {
     class _CustomHashSet extends _HashSet$(E) {
       _CustomHashSet(equality, hasher, validKey) {
         this[_equality] = equality;
         this[_hasher] = hasher;
-        this[_validKey] = validKey != null ? validKey : dart.fn(x => dart.is(x, E), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(validKey != null ? validKey : dart.fn(x => dart.is(x, E), core.bool, [core.Object]), _Predicate$(core.Object));
         super._HashSet();
       }
       [_newSet]() {
         return new (_CustomHashSet$(E))(this[_equality], this[_hasher], this[_validKey]);
       }
       [_findBucketIndex](bucket, element) {
         if (bucket == null) return -1;
         let length = bucket.length;
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           if (dart.notNull(this[_equality](dart.as(bucket[i], E), dart.as(element, E)))) return i;
@@ skipping 397 matching lines @@
       methods: () => ({[_newSet]: [core.Set$(E), []]})
     });
     return _LinkedIdentityHashSet;
   });
   let _LinkedIdentityHashSet = _LinkedIdentityHashSet$();
   const _LinkedCustomHashSet$ = dart.generic(function(E) {
     class _LinkedCustomHashSet extends _LinkedHashSet$(E) {
       _LinkedCustomHashSet(equality, hasher, validKey) {
         this[_equality] = equality;
         this[_hasher] = hasher;
-        this[_validKey] = validKey != null ? validKey : dart.fn(x => dart.is(x, E), core.bool, [dart.dynamic]);
+        this[_validKey] = dart.as(validKey != null ? validKey : dart.fn(x => dart.is(x, E), core.bool, [core.Object]), _Predicate$(core.Object));
         super._LinkedHashSet();
       }
       [_newSet]() {
         return new (_LinkedCustomHashSet$(E))(this[_equality], this[_hasher], this[_validKey]);
       }
       [_findBucketIndex](bucket, element) {
         if (bucket == null) return -1;
         let length = bucket.length;
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           let cell = dart.as(bucket[i], LinkedHashSetCell);
@@ skipping 148 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;
 });