add checks needed for covariant generics, and List<E>

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 21 matching lines @@
   let _Equality = _Equality$();
   let _Hasher$ = dart.generic(function(K) {
     let _Hasher = dart.typedef('_Hasher', () => dart.functionType(core.int, [K]));
     return _Hasher;
   });
   let _Hasher = _Hasher$();
   let HashMap$ = dart.generic(function(K, V) {
     class HashMap extends core.Object {
       HashMap(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
+        dart.as(equals, dart.functionType(core.bool, [K, K]));

[vsm, 2015/04/30 14:00:51]

We shouldn't need runtime checks on constructor params.  These are basically
static calls & should be enforced by static checks.

[Jennifer Messerly, 2015/05/01 20:43:04]

fixed

         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
+        dart.as(hashCode, dart.functionType(core.int, [K]));
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_HashMap$(K, V))();
             }
             hashCode = dart.as(_defaultHashCode, __CastType0);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_IdentityHashMap$(K, V))();
             }
@@ skipping 16 matching lines @@
       }
       from(other) {
         let result = new (HashMap$(K, V))();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
       fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
+        dart.as(key, dart.functionType(K, [dart.dynamic]));
         let value = opts && 'value' in opts ? opts.value : null;
+        dart.as(value, dart.functionType(V, [dart.dynamic]));
         let map = new (HashMap$(K, V))();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
       fromIterables(keys, values) {
         let map = new (HashMap$(K, V))();
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
     }
@@ skipping 202 matching lines @@
         if (!dart.notNull(it.moveNext())) {
           throw _internal.IterableElementError.noElement();
         }
         let result = null;
         do {
           result = dart.as(it.current, E);
         } while (it.moveNext());
         return result;
       }
       [core.$firstWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         for (let element of this) {
           if (test(element))
             return element;
         }
         if (orElse != null)
           return orElse();
         throw _internal.IterableElementError.noElement();
       }
       [core.$lastWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         let result = null;
         let foundMatching = false;
         for (let element of this) {
           if (test(element)) {
             result = element;
             foundMatching = true;
           }
         }
         if (foundMatching)
           return result;
@@ skipping 69 matching lines @@
         }).bind(this)();
       }
     }
     return _HashSetBase;
   });
   let _HashSetBase = _HashSetBase$();
   let HashSet$ = dart.generic(function(E) {
     class HashSet extends core.Object {
       HashSet(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
+        dart.as(equals, dart.functionType(core.bool, [E, E]));
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
+        dart.as(hashCode, dart.functionType(core.int, [E]));
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_HashSet$(E))();
             }
             hashCode = dart.as(_defaultHashCode, __CastType5);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_IdentityHashSet$(E))();
             }
@@ skipping 165 matching lines @@
       get [core.$single]() {
         let it = this[core.$iterator];
         if (!dart.notNull(it.moveNext()))
           throw _internal.IterableElementError.noElement();
         let result = dart.as(it.current, E);
         if (it.moveNext())
           throw _internal.IterableElementError.tooMany();
         return result;
       }
       [core.$firstWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         for (let element of this) {
           if (test(element))
             return element;
         }
         if (orElse != null)
           return orElse();
         throw _internal.IterableElementError.noElement();
       }
       [core.$lastWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         let result = null;
         let foundMatching = false;
         for (let element of this) {
           if (test(element)) {
             result = element;
             foundMatching = true;
           }
         }
         if (foundMatching)
           return result;
@@ skipping 167 matching lines @@
       get [core.$single]() {
         let it = this[core.$iterator];
         if (!dart.notNull(it.moveNext()))
           throw _internal.IterableElementError.noElement();
         let result = dart.as(it.current, E);
         if (it.moveNext())
           throw _internal.IterableElementError.tooMany();
         return result;
       }
       [core.$firstWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         for (let element of this) {
           if (test(element))
             return element;
         }
         if (orElse != null)
           return orElse();
         throw _internal.IterableElementError.noElement();
       }
       [core.$lastWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         let result = null;
         let foundMatching = false;
         for (let element of this) {
           if (test(element)) {
             result = element;
             foundMatching = true;
           }
         }
         if (foundMatching)
           return result;
@@ skipping 205 matching lines @@
     HasNextIterator._HAS_NEXT_AND_NEXT_IN_CURRENT = 0;
     HasNextIterator._NO_NEXT = 1;
     HasNextIterator._NOT_MOVED_YET = 2;
     return HasNextIterator;
   });
   let HasNextIterator = HasNextIterator$();
   let LinkedHashMap$ = dart.generic(function(K, V) {
     class LinkedHashMap extends core.Object {
       LinkedHashMap(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
+        dart.as(equals, dart.functionType(core.bool, [K, K]));
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
+        dart.as(hashCode, dart.functionType(core.int, [K]));
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_LinkedHashMap$(K, V))();
             }
             hashCode = dart.as(_defaultHashCode, __CastType10);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_LinkedIdentityHashMap$(K, V))();
             }
@@ skipping 16 matching lines @@
       }
       from(other) {
         let result = new (LinkedHashMap$(K, V))();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
       fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
+        dart.as(key, dart.functionType(K, [dart.dynamic]));
         let value = opts && 'value' in opts ? opts.value : null;
+        dart.as(value, dart.functionType(V, [dart.dynamic]));
         let map = new (LinkedHashMap$(K, V))();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
       fromIterables(keys, values) {
         let map = new (LinkedHashMap$(K, V))();
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
       _literal(keyValuePairs) {
@@ skipping 20 matching lines @@
   let __CastType10 = __CastType10$();
   let __CastType12$ = dart.generic(function(K) {
     let __CastType12 = dart.typedef('__CastType12', () => dart.functionType(core.bool, [K, K]));
     return __CastType12;
   });
   let __CastType12 = __CastType12$();
   let LinkedHashSet$ = dart.generic(function(E) {
     class LinkedHashSet extends core.Object {
       LinkedHashSet(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
+        dart.as(equals, dart.functionType(core.bool, [E, E]));
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
+        dart.as(hashCode, dart.functionType(core.int, [E]));
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_LinkedHashSet$(E))();
             }
             hashCode = dart.as(_defaultHashCode, __CastType15);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_LinkedIdentityHashSet$(E))();
             }
@@ skipping 49 matching lines @@
     class LinkedList extends IterableBase$(E) {
       LinkedList() {
         this[_modificationCount] = 0;
         this[_length] = 0;
         this[_next] = null;
         this[_previous] = null;
         super.IterableBase();
         this[_next] = this[_previous] = this;
       }
       addFirst(entry) {
+        dart.as(entry, E);
         this[_insertAfter](this, entry);
       }
       add(entry) {
+        dart.as(entry, E);
         this[_insertAfter](this[_previous], entry);
       }
       addAll(entries) {
         entries[core.$forEach]((entry => this[_insertAfter](this[_previous], dart.as(entry, E))).bind(this));
       }
       remove(entry) {
+        dart.as(entry, E);
         if (!dart.equals(entry[_list], this))
           return false;
         this[_unlink](entry);
         return true;
       }
       get [core.$iterator]() {
         return new (_LinkedListIterator$(E))(this);
       }
       get [core.$length]() {
         return this[_length];
@@ skipping 38 matching lines @@
           if (modificationCount != this[_modificationCount]) {
             throw new core.ConcurrentModificationError(this);
           }
           current = current[_next];
         }
       }
       get [core.$isEmpty]() {
         return this[_length] == 0;
       }
       [_insertAfter](entry, newEntry) {
+        dart.as(newEntry, E);
         if (newEntry.list != null) {
           throw new core.StateError('LinkedListEntry is already in a LinkedList');
         }
         this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
         newEntry[_list] = this;
         let predecessor = entry;
         let successor = entry[_next];
         successor[_previous] = newEntry;
         newEntry[_previous] = predecessor;
         newEntry[_next] = successor;
@@ skipping 65 matching lines @@
           return null;
         let result = dart.as(this[_next], E);
         return result;
       }
       get previous() {
         if (core.identical(this[_previous], this[_list]))
           return null;
         return dart.as(this[_previous], E);
       }
       insertAfter(entry) {
+        dart.as(entry, E);
         this[_list][_insertAfter](this, entry);
       }
       insertBefore(entry) {
+        dart.as(entry, E);
         this[_list][_insertAfter](this[_previous], entry);
       }
     }
     LinkedListEntry[dart.implements] = () => [_LinkedListLink];
     return LinkedListEntry;
   });
   let LinkedListEntry = LinkedListEntry$();
   let ListMixin$ = dart.generic(function(E) {
     class ListMixin extends core.Object {
       get [core.$iterator]() {
@@ skipping 61 matching lines @@
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           if (test(this[core.$get](i)))
             return true;
           if (length != this[core.$length]) {
             throw new core.ConcurrentModificationError(this);
           }
         }
         return false;
       }
       [core.$firstWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         let length = this[core.$length];
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           let element = this[core.$get](i);
           if (test(element))
             return element;
           if (length != this[core.$length]) {
             throw new core.ConcurrentModificationError(this);
           }
         }
         if (orElse != null)
           return orElse();
         throw _internal.IterableElementError.noElement();
       }
       [core.$lastWhere](test, opts) {
+        dart.as(test, dart.functionType(core.bool, [E]));
         let orElse = opts && 'orElse' in opts ? opts.orElse : null;
+        dart.as(orElse, dart.functionType(E, []));
         let length = this[core.$length];
         for (let i = dart.notNull(length) - 1; dart.notNull(i) >= 0; i = dart.notNull(i) - 1) {
           let element = this[core.$get](i);
           if (test(element))
             return element;
           if (length != this[core.$length]) {
             throw new core.ConcurrentModificationError(this);
           }
         }
         if (orElse != null)
@@ skipping 90 matching lines @@
         return result;
       }
       [core.$toSet]() {
         let result = new (core.Set$(E))();
         for (let i = 0; dart.notNull(i) < dart.notNull(this[core.$length]); i = dart.notNull(i) + 1) {
           result.add(this[core.$get](i));
         }
         return result;
       }
       [core.$add](element) {
+        dart.as(element, E);
         this[core.$set]((() => {
           let o = this, x = o[core.$length];
           o[core.$length] = dart.notNull(x) + 1;
           return x;
         }).bind(this)(), element);
       }
       [core.$addAll](iterable) {
         for (let element of iterable) {
           this[core.$set]((() => {
             let o = this, x = o[core.$length];
@@ skipping 43 matching lines @@
         if (this[core.$length] == 0) {
           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);
       }
       [core.$shuffle](random) {
         if (random === void 0)
           random = null;
         if (random == null)
@@ skipping 32 matching lines @@
       [core.$removeRange](start, end) {
         core.RangeError.checkValidRange(start, end, this[core.$length]);
         let length = dart.notNull(end) - dart.notNull(start);
         this[core.$setRange](start, dart.notNull(this[core.$length]) - dart.notNull(length), this, end);
         let o = this;
         o[core.$length] = dart.notNull(o[core.$length]) - dart.notNull(length);
       }
       [core.$fillRange](start, end, fill) {
         if (fill === void 0)
           fill = null;
+        dart.as(fill, E);
         core.RangeError.checkValidRange(start, end, this[core.$length]);
         for (let i = start; dart.notNull(i) < dart.notNull(end); i = dart.notNull(i) + 1) {
           this[core.$set](i, fill);
         }
       }
       [core.$setRange](start, end, iterable, skipCount) {
+        dart.as(iterable, core.Iterable$(E));
         if (skipCount === void 0)
           skipCount = 0;
         core.RangeError.checkValidRange(start, end, this[core.$length]);
         let length = dart.notNull(end) - dart.notNull(start);
         if (length == 0)
           return;
         core.RangeError.checkNotNegative(skipCount, "skipCount");
         let otherList = null;
         let otherStart = null;
         if (dart.is(iterable, core.List)) {
@@ skipping 71 matching lines @@
           }
         }
         for (let i = startIndex; dart.notNull(i) >= 0; i = dart.notNull(i) - 1) {
           if (dart.equals(this[core.$get](i), element)) {
             return i;
           }
         }
         return -1;
       }
       [core.$insert](index, element) {
+        dart.as(element, E);
         core.RangeError.checkValueInInterval(index, 0, this[core.$length], "index");
         if (index == this[core.$length]) {
           this[core.$add](element);
           return;
         }
         if (!(typeof index == 'number'))
           throw new core.ArgumentError(index);
         let o = this;
         o[core.$length] = dart.notNull(o[core.$length]) + 1;
         this[core.$setRange](dart.notNull(index) + 1, this[core.$length], this, index);
@@ skipping 55 matching lines @@
         for (let key of this.keys) {
           action(key, this.get(key));
         }
       }
       addAll(other) {
         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)) {
           return this.get(key);
         }
         return this.set(key, ifAbsent());
       }
       containsKey(key) {
         return this.keys[core.$contains](key);
       }
       get length() {
         return this.keys[core.$length];
@@ skipping 16 matching lines @@
   });
   let MapMixin = MapMixin$();
   let MapBase$ = dart.generic(function(K, V) {
     class MapBase extends dart.mixin(core.Object, MapMixin$(K, V)) {}
     return MapBase;
   });
   let MapBase = MapBase$();
   let _UnmodifiableMapMixin$ = dart.generic(function(K, V) {
     class _UnmodifiableMapMixin extends core.Object {
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         throw new core.UnsupportedError("Cannot modify unmodifiable map");
       }
       addAll(other) {
         throw new core.UnsupportedError("Cannot modify unmodifiable map");
       }
       clear() {
         throw new core.UnsupportedError("Cannot modify unmodifiable map");
       }
       remove(key) {
         throw new core.UnsupportedError("Cannot modify unmodifiable map");
       }
       putIfAbsent(key, ifAbsent) {
+        dart.as(key, K);
+        dart.as(ifAbsent, dart.functionType(V, []));
         throw new core.UnsupportedError("Cannot modify unmodifiable map");
       }
     }
     _UnmodifiableMapMixin[dart.implements] = () => [core.Map$(K, V)];
     return _UnmodifiableMapMixin;
   });
   let _UnmodifiableMapMixin = _UnmodifiableMapMixin$();
   let UnmodifiableMapBase$ = dart.generic(function(K, V) {
     class UnmodifiableMapBase extends dart.mixin(MapBase$(K, V), _UnmodifiableMapMixin$(K, V)) {}
     return UnmodifiableMapBase;
@@ skipping 58 matching lines @@
   let _MapBaseValueIterator = _MapBaseValueIterator$();
   let MapView$ = dart.generic(function(K, V) {
     class MapView extends core.Object {
       MapView(map) {
         this[_map] = map;
       }
       get(key) {
         return this[_map].get(key);
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         this[_map].set(key, value);
       }
       addAll(other) {
         this[_map].addAll(other);
       }
       clear() {
         this[_map].clear();
       }
       putIfAbsent(key, ifAbsent) {
+        dart.as(key, K);
+        dart.as(ifAbsent, dart.functionType(V, []));
         return this[_map].putIfAbsent(key, ifAbsent);
       }
       containsKey(key) {
         return this[_map].containsKey(key);
       }
       containsValue(value) {
         return this[_map].containsValue(value);
       }
       forEach(action) {
         this[_map].forEach(action);
@@ skipping 141 matching lines @@
     dart.defineNamedConstructor(Queue, 'from');
     return Queue;
   });
   let Queue = Queue$();
   let _element = Symbol('_element');
   let _link = Symbol('_link');
   let _asNonSentinelEntry = Symbol('_asNonSentinelEntry');
   let DoubleLinkedQueueEntry$ = dart.generic(function(E) {
     class DoubleLinkedQueueEntry extends core.Object {
       DoubleLinkedQueueEntry(e) {
+        dart.as(e, E);
         this[_element] = e;
         this[_previous] = null;
         this[_next] = null;
       }
       [_link](previous, next) {
         this[_next] = next;
         this[_previous] = previous;
         previous[_next] = this;
         next[_previous] = this;
       }
       append(e) {
+        dart.as(e, E);
         new (DoubleLinkedQueueEntry$(E))(e)[_link](this, this[_next]);
       }
       prepend(e) {
+        dart.as(e, E);
         new (DoubleLinkedQueueEntry$(E))(e)[_link](this[_previous], this);
       }
       remove() {
         this[_previous][_next] = this[_next];
         this[_next][_previous] = this[_previous];
         this[_next] = null;
         this[_previous] = null;
         return this[_element];
       }
       [_asNonSentinelEntry]() {
         return this;
       }
       previousEntry() {
         return this[_previous][_asNonSentinelEntry]();
       }
       nextEntry() {
         return this[_next][_asNonSentinelEntry]();
       }
       get element() {
         return this[_element];
       }
       set element(e) {
+        dart.as(e, E);
         this[_element] = e;
       }
     }
     return DoubleLinkedQueueEntry;
   });
   let DoubleLinkedQueueEntry = DoubleLinkedQueueEntry$();
   let _DoubleLinkedQueueEntrySentinel$ = dart.generic(function(E) {
     class _DoubleLinkedQueueEntrySentinel extends DoubleLinkedQueueEntry$(E) {
       _DoubleLinkedQueueEntrySentinel() {
         super.DoubleLinkedQueueEntry(null);
         this[_link](this, this);
       }
       remove() {
         throw _internal.IterableElementError.noElement();
       }
       [_asNonSentinelEntry]() {
         return null;
       }
       set element(e) {
+        dart.as(e, E);
         dart.assert(false);
       }
       get element() {
         throw _internal.IterableElementError.noElement();
       }
     }
     return _DoubleLinkedQueueEntrySentinel;
   });
   let _DoubleLinkedQueueEntrySentinel = _DoubleLinkedQueueEntrySentinel$();
   let _sentinel = Symbol('_sentinel');
@@ skipping 11 matching lines @@
         let list = new (DoubleLinkedQueue$(E))();
         for (let e of dart.as(elements, core.Iterable$(E))) {
           list.addLast(e);
         }
         return dart.as(list, DoubleLinkedQueue$(E));
       }
       get [core.$length]() {
         return this[_elementCount];
       }
       addLast(value) {
+        dart.as(value, E);
         this[_sentinel].prepend(value);
         this[_elementCount] = dart.notNull(this[_elementCount]) + 1;
       }
       addFirst(value) {
+        dart.as(value, E);
         this[_sentinel].append(value);
         this[_elementCount] = dart.notNull(this[_elementCount]) + 1;
       }
       add(value) {
+        dart.as(value, E);
         this[_sentinel].prepend(value);
         this[_elementCount] = dart.notNull(this[_elementCount]) + 1;
       }
       addAll(iterable) {
         for (let value of iterable) {
           this[_sentinel].prepend(value);
           this[_elementCount] = dart.notNull(this[_elementCount]) + 1;
         }
       }
       removeLast() {
@@ skipping 199 matching lines @@
         if (growable) {
           list = new (core.List$(E))();
           list[core.$length] = this[core.$length];
         } else {
           list = new (core.List$(E))(this[core.$length]);
         }
         this[_writeToList](list);
         return list;
       }
       add(element) {
+        dart.as(element, E);
         this[_add](element);
       }
       addAll(elements) {
         if (dart.is(elements, core.List)) {
           let list = dart.as(elements, core.List);
           let addCount = list[core.$length];
           let length = this[core.$length];
           if (dart.notNull(length) + dart.notNull(addCount) >= dart.notNull(this[_table][core.$length])) {
             this[_preGrow](dart.notNull(length) + dart.notNull(addCount));
             this[_table][core.$setRange](length, dart.notNull(length) + dart.notNull(addCount), dart.as(list, core.Iterable$(E)), 0);
@@ skipping 55 matching lines @@
             this[_table][core.$set](i, null);
           }
           this[_head] = this[_tail] = 0;
           this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
         }
       }
       toString() {
         return IterableBase.iterableToFullString(this, "{", "}");
       }
       addLast(element) {
+        dart.as(element, E);
         this[_add](element);
       }
       addFirst(element) {
+        dart.as(element, E);
         this[_head] = dart.notNull(this[_head]) - 1 & dart.notNull(this[_table][core.$length]) - 1;
         this[_table][core.$set](this[_head], element);
         if (this[_head] == this[_tail])
           this[_grow]();
         this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
       }
       removeFirst() {
         if (this[_head] == this[_tail])
           throw _internal.IterableElementError.noElement();
         this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
@@ skipping 23 matching lines @@
             return number;
           number = nextNumber;
         }
       }
       [_checkModification](expectedModificationCount) {
         if (expectedModificationCount != this[_modificationCount]) {
           throw new core.ConcurrentModificationError(this);
         }
       }
       [_add](element) {
+        dart.as(element, E);
         this[_table][core.$set](this[_tail], element);
         this[_tail] = dart.notNull(this[_tail]) + 1 & dart.notNull(this[_table][core.$length]) - 1;
         if (this[_head] == this[_tail])
           this[_grow]();
         this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
       }
       [_remove](offset) {
         let mask = dart.notNull(this[_table][core.$length]) - 1;
         let startDistance = dart.notNull(offset) - dart.notNull(this[_head]) & dart.notNull(mask);
         let endDistance = dart.notNull(this[_tail]) - dart.notNull(offset) & dart.notNull(mask);
@@ skipping 88 matching lines @@
   });
   let _ListQueueIterator = _ListQueueIterator$();
   let _Predicate$ = dart.generic(function(T) {
     let _Predicate = dart.typedef('_Predicate', () => dart.functionType(core.bool, [T]));
     return _Predicate;
   });
   let _Predicate = _Predicate$();
   let _SplayTreeNode$ = dart.generic(function(K) {
     class _SplayTreeNode extends core.Object {
       _SplayTreeNode(key) {
+        dart.as(key, K);
         this.key = key;
         this.left = null;
         this.right = null;
       }
     }
     return _SplayTreeNode;
   });
   let _SplayTreeNode = _SplayTreeNode$();
   let _SplayTreeMapNode$ = dart.generic(function(K, V) {
     class _SplayTreeMapNode extends _SplayTreeNode$(K) {
       _SplayTreeMapNode(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         this.value = value;
         super._SplayTreeNode(key);
       }
     }
     return _SplayTreeMapNode;
   });
   let _SplayTreeMapNode = _SplayTreeMapNode$();
   let _dummy = Symbol('_dummy');
   let _root = Symbol('_root');
   let _count = Symbol('_count');
   let _splayCount = Symbol('_splayCount');
   let _splay = Symbol('_splay');
   let _compare = Symbol('_compare');
   let _splayMin = Symbol('_splayMin');
   let _splayMax = Symbol('_splayMax');
   let _addNewRoot = Symbol('_addNewRoot');
   let _first = Symbol('_first');
   let _last = Symbol('_last');
   let _clear = Symbol('_clear');
   let _SplayTree$ = dart.generic(function(K) {
     class _SplayTree extends core.Object {
       _SplayTree() {
         this[_dummy] = new (_SplayTreeNode$(K))(null);
         this[_root] = null;
         this[_count] = 0;
         this[_modificationCount] = 0;
         this[_splayCount] = 0;
       }
       [_splay](key) {
+        dart.as(key, K);
         if (this[_root] == null)
           return -1;
         let left = this[_dummy];
         let right = this[_dummy];
         let current = this[_root];
         let comp = null;
         while (true) {
           comp = this[_compare](current.key, key);
           if (dart.notNull(comp) > 0) {
             if (current.left == null)
@@ skipping 53 matching lines @@
         let current = node;
         while (current.right != null) {
           let right = current.right;
           current.right = right.left;
           right.left = current;
           current = right;
         }
         return dart.as(current, _SplayTreeNode$(K));
       }
       [_remove](key) {
+        dart.as(key, K);
         if (this[_root] == null)
           return null;
         let comp = this[_splay](key);
         if (comp != 0)
           return null;
         let result = this[_root];
         this[_count] = dart.notNull(this[_count]) - 1;
         if (this[_root].left == null) {
           this[_root] = this[_root].right;
         } else {
@@ skipping 52 matching lines @@
     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;
+        dart.as(compare, dart.functionType(core.int, [K, K]));
         if (isValidKey === void 0)
           isValidKey = null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         this[_comparator] = dart.as(compare == null ? dart.bind(core.Comparable, 'compare') : compare, core.Comparator$(K));
         this[_validKey] = dart.as(isValidKey != null ? isValidKey : v => dart.is(v, K), _Predicate);
         super._SplayTree();
       }
       from(other, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
+        dart.as(compare, dart.functionType(core.int, [K, K]));
         if (isValidKey === void 0)
           isValidKey = null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         let result = new (SplayTreeMap$(K, V))();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
       fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
+        dart.as(key, dart.functionType(K, [dart.dynamic]));
         let value = opts && 'value' in opts ? opts.value : null;
+        dart.as(value, dart.functionType(V, [dart.dynamic]));
         let compare = opts && 'compare' in opts ? opts.compare : null;
+        dart.as(compare, dart.functionType(core.int, [K, K]));
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         let map = new (SplayTreeMap$(K, V))(compare, isValidKey);
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
       fromIterables(keys, values, compare, isValidKey) {
+        dart.as(keys, core.Iterable$(K));
+        dart.as(values, core.Iterable$(V));
         if (compare === void 0)
           compare = null;
+        dart.as(compare, dart.functionType(core.int, [K, K]));
         if (isValidKey === void 0)
           isValidKey = null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         let map = new (SplayTreeMap$(K, V))(compare, isValidKey);
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
       [_compare](key1, key2) {
+        dart.as(key1, K);
+        dart.as(key2, K);
         return this[_comparator](key1, key2);
       }
       _internal() {
         this[_comparator] = null;
         this[_validKey] = null;
         super._SplayTree();
       }
       get(key) {
         if (key == null)
           throw new core.ArgumentError(key);
@@ skipping 10 matching lines @@
       }
       remove(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         let mapRoot = dart.as(this[_remove](dart.as(key, K)), _SplayTreeMapNode);
         if (mapRoot != null)
           return dart.as(mapRoot.value, V);
         return null;
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         if (key == null)
           throw new core.ArgumentError(key);
         let comp = this[_splay](key);
         if (comp == 0) {
           let mapRoot = dart.as(this[_root], _SplayTreeMapNode);
           mapRoot.value = value;
           return;
         }
         this[_addNewRoot](new (_SplayTreeMapNode$(K, dart.dynamic))(key, value), comp);
       }
       putIfAbsent(key, ifAbsent) {
+        dart.as(key, K);
+        dart.as(ifAbsent, dart.functionType(V, []));
         if (key == null)
           throw new core.ArgumentError(key);
         let comp = this[_splay](key);
         if (comp == 0) {
           let mapRoot = dart.as(this[_root], _SplayTreeMapNode);
           return dart.as(mapRoot.value, V);
         }
         let modificationCount = this[_modificationCount];
         let splayCount = this[_splayCount];
         let value = ifAbsent();
         if (modificationCount != this[_modificationCount]) {
           throw new core.ConcurrentModificationError(this);
         }
         if (splayCount != this[_splayCount]) {
           comp = this[_splay](key);
           dart.assert(comp != 0);
         }
         this[_addNewRoot](new (_SplayTreeMapNode$(K, dart.dynamic))(key, value), comp);
         return value;
       }
       addAll(other) {
         other.forEach(((key, value) => {
+          dart.as(key, K);
+          dart.as(value, V);
           this.set(key, value);
         }).bind(this));
       }
       get isEmpty() {
         return this[_root] == null;
       }
       get isNotEmpty() {
         return !dart.notNull(this.isEmpty);
       }
       forEach(f) {
@@ skipping 44 matching lines @@
         if (this[_root] == null)
           return null;
         return dart.as(this[_first].key, K);
       }
       lastKey() {
         if (this[_root] == null)
           return null;
         return dart.as(this[_last].key, K);
       }
       lastKeyBefore(key) {
+        dart.as(key, K);
         if (key == null)
           throw new core.ArgumentError(key);
         if (this[_root] == null)
           return null;
         let comp = this[_splay](key);
         if (dart.notNull(comp) < 0)
           return this[_root].key;
         let node = this[_root].left;
         if (node == null)
           return null;
         while (node.right != null) {
           node = node.right;
         }
         return node.key;
       }
       firstKeyAfter(key) {
+        dart.as(key, K);
         if (key == null)
           throw new core.ArgumentError(key);
         if (this[_root] == null)
           return null;
         let comp = this[_splay](key);
         if (dart.notNull(comp) > 0)
           return this[_root].key;
         let node = this[_root].right;
         if (node == null)
           return null;
@@ skipping 173 matching lines @@
     dart.defineNamedConstructor(_SplayTreeNodeIterator, 'startAt');
     return _SplayTreeNodeIterator;
   });
   let _SplayTreeNodeIterator = _SplayTreeNodeIterator$();
   let _clone = Symbol('_clone');
   let 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;
+        dart.as(compare, dart.functionType(core.int, [E, E]));
         if (isValidKey === void 0)
           isValidKey = null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         this[_comparator] = dart.as(compare == null ? dart.bind(core.Comparable, 'compare') : compare, core.Comparator);
         this[_validKey] = dart.as(isValidKey != null ? isValidKey : v => dart.is(v, E), _Predicate);
         super._SplayTree();
       }
       from(elements, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
+        dart.as(compare, dart.functionType(core.int, [E, E]));
         if (isValidKey === void 0)
           isValidKey = null;
+        dart.as(isValidKey, dart.functionType(core.bool, [dart.dynamic]));
         let result = new (SplayTreeSet$(E))(compare, isValidKey);
         for (let element of dart.as(elements, core.Iterable$(E))) {
           result.add(element);
         }
         return result;
       }
       [_compare](e1, e2) {
+        dart.as(e1, E);
+        dart.as(e2, E);
         return dart.dcall(this[_comparator], e1, e2);
       }
       get [core.$iterator]() {
         return new (_SplayTreeKeyIterator$(E))(this);
       }
       get [core.$length]() {
         return this[_count];
       }
       get [core.$isEmpty]() {
         return this[_root] == null;
@@ skipping 15 matching lines @@
         if (this[_count] == 0)
           throw _internal.IterableElementError.noElement();
         if (dart.notNull(this[_count]) > 1)
           throw _internal.IterableElementError.tooMany();
         return this[_root].key;
       }
       [core.$contains](object) {
         return dart.notNull(dart.dcall(this[_validKey], object)) && this[_splay](dart.as(object, E)) == 0;
       }
       add(element) {
+        dart.as(element, E);
         let compare = this[_splay](element);
         if (compare == 0)
           return false;
         this[_addNewRoot](new (_SplayTreeNode$(E))(element), compare);
         return true;
       }
       remove(object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return this[_remove](dart.as(object, E)) != null;
@@ skipping 148 matching lines @@
         if (rest == null)
           return false;
         let bucket = this[_getBucket](rest, key);
         return dart.notNull(this[_findBucketIndex](bucket, key)) >= 0;
       }
       containsValue(value) {
         return this[_computeKeys]()[core.$any]((each => dart.equals(this.get(each), value)).bind(this));
       }
       addAll(other) {
         other.forEach(((key, value) => {
+          dart.as(key, K);
+          dart.as(value, V);
           this.set(key, value);
         }).bind(this));
       }
       get(key) {
         if (_HashMap._isStringKey(key)) {
           let strings = this[_strings];
           return dart.as(strings == null ? null : _HashMap._getTableEntry(strings, key), V);
         } else if (_HashMap._isNumericKey(key)) {
           let nums = this[_nums];
           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.as(dart.notNull(index) < 0 ? null : bucket[dart.notNull(index) + 1], V);
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         if (_HashMap._isStringKey(key)) {
           let strings = this[_strings];
           if (strings == null)
             this[_strings] = strings = _HashMap._newHashTable();
           this[_addHashTableEntry](strings, key, value);
         } else if (_HashMap._isNumericKey(key)) {
           let nums = this[_nums];
           if (nums == null)
             this[_nums] = nums = _HashMap._newHashTable();
           this[_addHashTableEntry](nums, key, value);
         } else {
           this[_set](key, value);
         }
       }
       [_set](key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         let rest = this[_rest];
         if (rest == null)
           this[_rest] = rest = _HashMap._newHashTable();
         let hash = this[_computeHashCode](key);
         let bucket = rest[hash];
         if (bucket == null) {
           _HashMap._setTableEntry(rest, hash, [key, value]);
           this[_length] = dart.notNull(this[_length]) + 1;
           this[_keys] = null;
         } else {
           let index = this[_findBucketIndex](bucket, key);
           if (dart.notNull(index) >= 0) {
             bucket[dart.notNull(index) + 1] = value;
           } else {
             bucket.push(key, value);
             this[_length] = dart.notNull(this[_length]) + 1;
             this[_keys] = null;
           }
         }
       }
       putIfAbsent(key, ifAbsent) {
+        dart.as(key, K);
+        dart.as(ifAbsent, dart.functionType(V, []));
         if (this.containsKey(key))
           return this.get(key);
         let value = ifAbsent();
         this.set(key, value);
         return value;
       }
       remove(key) {
         if (_HashMap._isStringKey(key)) {
           return this[_removeHashTableEntry](this[_strings], key);
         } else if (_HashMap._isNumericKey(key)) {
@@ skipping 67 matching lines @@
               let key = bucket[i];
               result[index] = key;
               index = dart.notNull(index) + 1;
             }
           }
         }
         dart.assert(index == this[_length]);
         return this[_keys] = result;
       }
       [_addHashTableEntry](table, key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         if (!dart.notNull(_HashMap._hasTableEntry(table, key))) {
           this[_length] = dart.notNull(this[_length]) + 1;
           this[_keys] = null;
         }
         _HashMap._setTableEntry(table, key, value);
       }
       [_removeHashTableEntry](table, key) {
         if (dart.notNull(table != null) && dart.notNull(_HashMap._hasTableEntry(table, key))) {
           let value = dart.as(_HashMap._getTableEntry(table, key), V);
           _HashMap._deleteTableEntry(table, key);
@@ skipping 85 matching lines @@
         this[_hashCode] = hashCode;
         this[_validKey] = dart.as(validKey != null ? validKey : v => dart.is(v, K), _Predicate);
         super._HashMap();
       }
       get(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_get](key);
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         super[_set](key, value);
       }
       containsKey(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return false;
         return super[_containsKey](key);
       }
       remove(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
@@ skipping 136 matching lines @@
         if (rest == null)
           return false;
         let bucket = this[_getBucket](rest, key);
         return dart.notNull(this[_findBucketIndex](bucket, key)) >= 0;
       }
       containsValue(value) {
         return this.keys[core.$any]((each => dart.equals(this.get(each), value)).bind(this));
       }
       addAll(other) {
         other.forEach(((key, value) => {
+          dart.as(key, K);
+          dart.as(value, V);
           this.set(key, value);
         }).bind(this));
       }
       get(key) {
         if (_LinkedHashMap._isStringKey(key)) {
           let strings = this[_strings];
           if (strings == null)
             return null;
           let cell = dart.as(_LinkedHashMap._getTableEntry(strings, key), LinkedHashMapCell);
           return dart.as(cell == null ? null : cell[_value], V);
@@ skipping 12 matching lines @@
         if (rest == null)
           return null;
         let bucket = this[_getBucket](rest, key);
         let index = this[_findBucketIndex](bucket, key);
         if (dart.notNull(index) < 0)
           return null;
         let cell = dart.as(bucket[index], LinkedHashMapCell);
         return dart.as(cell[_value], V);
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         if (_LinkedHashMap._isStringKey(key)) {
           let strings = this[_strings];
           if (strings == null)
             this[_strings] = strings = _LinkedHashMap._newHashTable();
           this[_addHashTableEntry](strings, key, value);
         } else if (_LinkedHashMap._isNumericKey(key)) {
           let nums = this[_nums];
           if (nums == null)
             this[_nums] = nums = _LinkedHashMap._newHashTable();
           this[_addHashTableEntry](nums, key, value);
         } else {
           this[_set](key, value);
         }
       }
       [_set](key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         let rest = this[_rest];
         if (rest == null)
           this[_rest] = rest = _LinkedHashMap._newHashTable();
         let hash = this[_computeHashCode](key);
         let bucket = rest[hash];
         if (bucket == null) {
           let cell = this[_newLinkedCell](key, value);
           _LinkedHashMap._setTableEntry(rest, hash, [cell]);
         } else {
           let index = this[_findBucketIndex](bucket, key);
           if (dart.notNull(index) >= 0) {
             let cell = dart.as(bucket[index], LinkedHashMapCell);
             cell[_value] = value;
           } else {
             let cell = this[_newLinkedCell](key, value);
             bucket.push(cell);
           }
         }
       }
       putIfAbsent(key, ifAbsent) {
+        dart.as(key, K);
+        dart.as(ifAbsent, dart.functionType(V, []));
         if (this.containsKey(key))
           return this.get(key);
         let value = ifAbsent();
         this.set(key, value);
         return value;
       }
       remove(key) {
         if (_LinkedHashMap._isStringKey(key)) {
           return this[_removeHashTableEntry](this[_strings], key);
         } else if (_LinkedHashMap._isNumericKey(key)) {
@@ skipping 26 matching lines @@
         let modifications = this[_modifications];
         while (cell != null) {
           action(dart.as(cell[_key], K), dart.as(cell[_value], V));
           if (modifications != this[_modifications]) {
             throw new core.ConcurrentModificationError(this);
           }
           cell = cell[_next];
         }
       }
       [_addHashTableEntry](table, key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         let cell = dart.as(_LinkedHashMap._getTableEntry(table, key), LinkedHashMapCell);
         if (cell == null) {
           _LinkedHashMap._setTableEntry(table, key, this[_newLinkedCell](key, value));
         } else {
           cell[_value] = value;
         }
       }
       [_removeHashTableEntry](table, key) {
         if (table == null)
           return null;
         let cell = dart.as(_LinkedHashMap._getTableEntry(table, key), LinkedHashMapCell);
         if (cell == null)
           return null;
         this[_unlinkCell](cell);
         _LinkedHashMap._deleteTableEntry(table, key);
         return dart.as(cell[_value], V);
       }
       [_modified]() {
         this[_modifications] = dart.notNull(this[_modifications]) + 1 & 67108863;
       }
       [_newLinkedCell](key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         let cell = new LinkedHashMapCell(key, value);
         if (this[_first] == null) {
           this[_first] = this[_last] = cell;
         } else {
           let last = this[_last];
           cell[_previous] = last;
           this[_last] = last[_next] = cell;
         }
         this[_length] = dart.notNull(this[_length]) + 1;
         this[_modified]();
@@ skipping 93 matching lines @@
         this[_hashCode] = hashCode;
         this[_validKey] = dart.as(validKey != null ? validKey : v => dart.is(v, K), _Predicate);
         super._LinkedHashMap();
       }
       get(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_get](key);
       }
       set(key, value) {
+        dart.as(key, K);
+        dart.as(value, V);
         super[_set](key, value);
       }
       containsKey(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return false;
         return super[_containsKey](key);
       }
       remove(key) {
         if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
@@ skipping 145 matching lines @@
         let rest = this[_rest];
         if (rest == null)
           return null;
         let bucket = this[_getBucket](rest, object);
         let index = this[_findBucketIndex](bucket, object);
         if (dart.notNull(index) < 0)
           return null;
         return dart.as(bucket[core.$get](index), E);
       }
       add(element) {
+        dart.as(element, E);
         if (_HashSet._isStringElement(element)) {
           let strings = this[_strings];
           if (strings == null)
             this[_strings] = strings = _HashSet._newHashTable();
           return this[_addHashTableEntry](strings, element);
         } else if (_HashSet._isNumericElement(element)) {
           let nums = this[_nums];
           if (nums == null)
             this[_nums] = nums = _HashSet._newHashTable();
           return this[_addHashTableEntry](nums, element);
         } else {
           return this[_add](element);
         }
       }
       [_add](element) {
+        dart.as(element, E);
         let rest = this[_rest];
         if (rest == null)
           this[_rest] = rest = _HashSet._newHashTable();
         let hash = this[_computeHashCode](element);
         let bucket = rest[hash];
         if (bucket == null) {
           _HashSet._setTableEntry(rest, hash, [element]);
         } else {
           let index = this[_findBucketIndex](bucket, element);
           if (dart.notNull(index) >= 0)
@@ skipping 73 matching lines @@
             for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
               result[index] = bucket[i];
               index = dart.notNull(index) + 1;
             }
           }
         }
         dart.assert(index == this[_length]);
         return this[_elements] = result;
       }
       [_addHashTableEntry](table, element) {
+        dart.as(element, E);
         if (_HashSet._hasTableEntry(table, element))
           return false;
         _HashSet._setTableEntry(table, element, 0);
         this[_length] = dart.notNull(this[_length]) + 1;
         this[_elements] = null;
         return true;
       }
       [_removeHashTableEntry](table, element) {
         if (dart.notNull(table != null) && dart.notNull(_HashSet._hasTableEntry(table, element))) {
           _HashSet._deleteTableEntry(table, element);
@@ skipping 92 matching lines @@
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           if (this[_equality](dart.as(bucket[i], E), dart.as(element, E)))
             return i;
         }
         return -1;
       }
       [_computeHashCode](element) {
         return this[_hasher](dart.as(element, E)) & 0x3ffffff;
       }
       add(object) {
+        dart.as(object, E);
         return super[_add](object);
       }
       [core.$contains](object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_contains](object);
       }
       lookup(object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return null;
@@ skipping 124 matching lines @@
         if (this[_first] == null)
           throw new core.StateError("No elements");
         return dart.as(this[_first][_element], E);
       }
       get [core.$last]() {
         if (this[_last] == null)
           throw new core.StateError("No elements");
         return dart.as(this[_last][_element], E);
       }
       add(element) {
+        dart.as(element, E);
         if (_LinkedHashSet._isStringElement(element)) {
           let strings = this[_strings];
           if (strings == null)
             this[_strings] = strings = _LinkedHashSet._newHashTable();
           return this[_addHashTableEntry](strings, element);
         } else if (_LinkedHashSet._isNumericElement(element)) {
           let nums = this[_nums];
           if (nums == null)
             this[_nums] = nums = _LinkedHashSet._newHashTable();
           return this[_addHashTableEntry](nums, element);
         } else {
           return this[_add](element);
         }
       }
       [_add](element) {
+        dart.as(element, E);
         let rest = this[_rest];
         if (rest == null)
           this[_rest] = rest = _LinkedHashSet._newHashTable();
         let hash = this[_computeHashCode](element);
         let bucket = rest[hash];
         if (bucket == null) {
           let cell = this[_newLinkedCell](element);
           _LinkedHashSet._setTableEntry(rest, hash, [cell]);
         } else {
           let index = this[_findBucketIndex](bucket, element);
@@ skipping 47 matching lines @@
         }
       }
       clear() {
         if (dart.notNull(this[_length]) > 0) {
           this[_strings] = this[_nums] = this[_rest] = this[_first] = this[_last] = null;
           this[_length] = 0;
           this[_modified]();
         }
       }
       [_addHashTableEntry](table, element) {
+        dart.as(element, E);
         let cell = dart.as(_LinkedHashSet._getTableEntry(table, element), LinkedHashSetCell);
         if (cell != null)
           return false;
         _LinkedHashSet._setTableEntry(table, element, this[_newLinkedCell](element));
         return true;
       }
       [_removeHashTableEntry](table, element) {
         if (table == null)
           return false;
         let cell = dart.as(_LinkedHashSet._getTableEntry(table, element), LinkedHashSetCell);
         if (cell == null)
           return false;
         this[_unlinkCell](cell);
         _LinkedHashSet._deleteTableEntry(table, element);
         return true;
       }
       [_modified]() {
         this[_modifications] = dart.notNull(this[_modifications]) + 1 & 67108863;
       }
       [_newLinkedCell](element) {
+        dart.as(element, E);
         let cell = new LinkedHashSetCell(element);
         if (this[_first] == null) {
           this[_first] = this[_last] = cell;
         } else {
           let last = this[_last];
           cell[_previous] = last;
           this[_last] = last[_next] = cell;
         }
         this[_length] = dart.notNull(this[_length]) + 1;
         this[_modified]();
@@ skipping 105 matching lines @@
           let cell = dart.as(bucket[i], LinkedHashSetCell);
           if (this[_equality](dart.as(cell[_element], E), dart.as(element, E)))
             return i;
         }
         return -1;
       }
       [_computeHashCode](element) {
         return this[_hasher](dart.as(element, E)) & 0x3ffffff;
       }
       add(element) {
+        dart.as(element, E);
         return super[_add](element);
       }
       [core.$contains](object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_contains](object);
       }
       lookup(object) {
         if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return null;
@@ skipping 117 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 = {}));