Inference through conditional expressions

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 2982 matching lines @@
   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));
-        this[_validKey] = dart.as(isValidKey != null ? isValidKey : v => dart.is(v, K), _Predicate);
+        this[_validKey] = isValidKey != null ? isValidKey : v => dart.is(v, K);
         super._SplayTree();
       }
       from(other, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
         if (isValidKey === void 0)
           isValidKey = null;
         let result = new (SplayTreeMap$(K, V))();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
@@ skipping 362 matching lines @@
   });
   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;
         if (isValidKey === void 0)
           isValidKey = null;
-        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);
+        this[_comparator] = compare == null ? dart.bind(core.Comparable, 'compare') : compare;
+        this[_validKey] = isValidKey != null ? isValidKey : v => dart.is(v, E);
         super._SplayTree();
       }
       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);
@@ skipping 214 matching lines @@
         dart.as(other, core.Map$(K, V));
         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);
+          return strings == null ? null : dart.as(_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);
+          return nums == null ? null : dart.as(_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);
+        return dart.notNull(index) < 0 ? null : dart.as(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)) {
@@ skipping 213 matching lines @@
     return _IdentityHashMap;
   });
   let _IdentityHashMap = _IdentityHashMap$();
   let _equals = Symbol('_equals');
   let _hashCode = Symbol('_hashCode');
   let _CustomHashMap$ = dart.generic(function(K, V) {
     class _CustomHashMap extends _HashMap$(K, V) {
       _CustomHashMap(equals, hashCode, validKey) {
         this[_equals] = equals;
         this[_hashCode] = hashCode;
-        this[_validKey] = dart.as(validKey != null ? validKey : v => dart.is(v, K), _Predicate);
+        this[_validKey] = validKey != null ? validKey : v => dart.is(v, K);
         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);
@@ skipping 159 matching lines @@
           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);
+          return cell == null ? null : dart.as(cell[_value], V);
         } else if (_LinkedHashMap._isNumericKey(key)) {
           let nums = this[_nums];
           if (nums == null)
             return null;
           let cell = dart.as(_LinkedHashMap._getTableEntry(nums, key), LinkedHashMapCell);
-          return dart.as(cell == null ? null : cell[_value], V);
+          return cell == null ? null : dart.as(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);
@@ skipping 216 matching lines @@
       }
     }
     return _LinkedIdentityHashMap;
   });
   let _LinkedIdentityHashMap = _LinkedIdentityHashMap$();
   let _LinkedCustomHashMap$ = dart.generic(function(K, V) {
     class _LinkedCustomHashMap extends _LinkedHashMap$(K, V) {
       _LinkedCustomHashMap(equals, hashCode, validKey) {
         this[_equals] = equals;
         this[_hashCode] = hashCode;
-        this[_validKey] = dart.as(validKey != null ? validKey : v => dart.is(v, K), _Predicate);
+        this[_validKey] = validKey != null ? validKey : v => dart.is(v, K);
         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);
@@ skipping 363 matching lines @@
     return _IdentityHashSet;
   });
   let _IdentityHashSet = _IdentityHashSet$();
   let _equality = Symbol('_equality');
   let _hasher = Symbol('_hasher');
   let _CustomHashSet$ = dart.generic(function(E) {
     class _CustomHashSet extends _HashSet$(E) {
       _CustomHashSet(equality, hasher, validKey) {
         this[_equality] = equality;
         this[_hasher] = hasher;
-        this[_validKey] = dart.as(validKey != null ? validKey : x => dart.is(x, E), _Predicate);
+        this[_validKey] = validKey != null ? validKey : x => dart.is(x, E);
         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) {
@@ skipping 361 matching lines @@
       }
     }
     return _LinkedIdentityHashSet;
   });
   let _LinkedIdentityHashSet = _LinkedIdentityHashSet$();
   let _LinkedCustomHashSet$ = dart.generic(function(E) {
     class _LinkedCustomHashSet extends _LinkedHashSet$(E) {
       _LinkedCustomHashSet(equality, hasher, validKey) {
         this[_equality] = equality;
         this[_hasher] = hasher;
-        this[_validKey] = dart.as(validKey != null ? validKey : x => dart.is(x, E), _Predicate);
+        this[_validKey] = validKey != null ? validKey : x => dart.is(x, E);
         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) {
@@ skipping 138 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 = {}));