Reifier hookup

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;
         super.UnmodifiableListBase();
       }
@@ skipping 31 matching lines @@
     class HashMap extends core.Object {
       HashMap(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_HashMap$(K, V))();
             }
-            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
+            hashCode = dart.as(_defaultHashCode, __t0);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_IdentityHashMap$(K, V))();
             }
             if (equals == null) {
-              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
+              equals = dart.as(_defaultEquals, __t2);
             }
           }
         } else {
           if (hashCode == null) {
             hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           }
           if (equals == null) {
             equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
           }
         }
@@ skipping 23 matching lines @@
       }
     }
     HashMap[dart.implements] = () => [core.Map$(K, V)];
     dart.defineNamedConstructor(HashMap, 'identity');
     dart.defineNamedConstructor(HashMap, 'from');
     dart.defineNamedConstructor(HashMap, 'fromIterable');
     dart.defineNamedConstructor(HashMap, 'fromIterables');
     return HashMap;
   });
   let HashMap = HashMap$();
+  let __t0$ = dart.generic(function(K) {
+    let __t0 = dart.typedef('__t0', () => dart.functionType(core.int, [K]));
+    return __t0;
+  });
+  let __t0 = __t0$();
+  let __t2$ = dart.generic(function(K) {
+    let __t2 = dart.typedef('__t2', () => dart.functionType(core.bool, [K, K]));
+    return __t2;
+  });
+  let __t2 = __t2$();
   let _newSet = Symbol('_newSet');
   let SetMixin$ = dart.generic(function(E) {
     class SetMixin extends core.Object {
       get [core.$isEmpty]() {
         return this[core.$length] == 0;
       }
       get [core.$isNotEmpty]() {
         return this[core.$length] != 0;
       }
       clear() {
@@ skipping 281 matching lines @@
     class HashSet extends core.Object {
       HashSet(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_HashSet$(E))();
             }
-            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
+            hashCode = dart.as(_defaultHashCode, __t5);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_IdentityHashSet$(E))();
             }
             if (equals == null) {
-              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
+              equals = dart.as(_defaultEquals, __t7);
             }
           }
         } else {
           if (hashCode == null) {
             hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           }
           if (equals == null) {
             equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
           }
         }
         return new (_CustomHashSet$(E))(equals, hashCode, isValidKey);
       }
       identity() {
         return new (_IdentityHashSet$(E))();
       }
       from(elements) {
         let result = new (HashSet$(E))();
         for (let e of dart.as(elements, core.Iterable$(E)))
           result.add(e);
         return result;
       }
     }
     HashSet[dart.implements] = () => [core.Set$(E)];
     dart.defineNamedConstructor(HashSet, 'identity');
     dart.defineNamedConstructor(HashSet, 'from');
     return HashSet;
   });
   let HashSet = HashSet$();
+  let __t5$ = dart.generic(function(E) {
+    let __t5 = dart.typedef('__t5', () => dart.functionType(core.int, [E]));
+    return __t5;
+  });
+  let __t5 = __t5$();
+  let __t7$ = dart.generic(function(E) {
+    let __t7 = dart.typedef('__t7', () => dart.functionType(core.bool, [E, E]));
+    return __t7;
+  });
+  let __t7 = __t7$();
   let IterableMixin$ = dart.generic(function(E) {
     class IterableMixin extends core.Object {
       [core.$map](f) {
         return new (_internal.MappedIterable$(E, dart.dynamic))(this, f);
       }
       [core.$where](f) {
         return new (_internal.WhereIterable$(E))(this, f);
       }
       [core.$expand](f) {
         return new (_internal.ExpandIterable$(E, dart.dynamic))(this, f);
@@ skipping 564 matching lines @@
     class LinkedHashMap extends core.Object {
       LinkedHashMap(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_LinkedHashMap$(K, V))();
             }
-            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
+            hashCode = dart.as(_defaultHashCode, __t10);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_LinkedIdentityHashMap$(K, V))();
             }
             if (equals == null) {
-              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
+              equals = dart.as(_defaultEquals, __t12);
             }
           }
         } else {
           if (hashCode == null) {
             hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           }
           if (equals == null) {
             equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
           }
         }
@@ skipping 31 matching lines @@
     LinkedHashMap[dart.implements] = () => [HashMap$(K, V)];
     dart.defineNamedConstructor(LinkedHashMap, 'identity');
     dart.defineNamedConstructor(LinkedHashMap, 'from');
     dart.defineNamedConstructor(LinkedHashMap, 'fromIterable');
     dart.defineNamedConstructor(LinkedHashMap, 'fromIterables');
     dart.defineNamedConstructor(LinkedHashMap, _literal);
     dart.defineNamedConstructor(LinkedHashMap, _empty);
     return LinkedHashMap;
   });
   let LinkedHashMap = LinkedHashMap$();
+  let __t10$ = dart.generic(function(K) {
+    let __t10 = dart.typedef('__t10', () => dart.functionType(core.int, [K]));
+    return __t10;
+  });
+  let __t10 = __t10$();
+  let __t12$ = dart.generic(function(K) {
+    let __t12 = dart.typedef('__t12', () => dart.functionType(core.bool, [K, K]));
+    return __t12;
+  });
+  let __t12 = __t12$();
   let LinkedHashSet$ = dart.generic(function(E) {
     class LinkedHashSet extends core.Object {
       LinkedHashSet(opts) {
         let equals = opts && 'equals' in opts ? opts.equals : null;
         let hashCode = opts && 'hashCode' in opts ? opts.hashCode : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         if (isValidKey == null) {
           if (hashCode == null) {
             if (equals == null) {
               return new (_LinkedHashSet$(E))();
             }
-            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
+            hashCode = dart.as(_defaultHashCode, __t15);
           } else {
             if (dart.notNull(core.identical(core.identityHashCode, hashCode)) && dart.notNull(core.identical(core.identical, equals))) {
               return new (_LinkedIdentityHashSet$(E))();
             }
             if (equals == null) {
-              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
+              equals = dart.as(_defaultEquals, __t17);
             }
           }
         } else {
           if (hashCode == null) {
             hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           }
           if (equals == null) {
             equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
           }
         }
         return new (_LinkedCustomHashSet$(E))(equals, hashCode, isValidKey);
       }
       identity() {
         return new (_LinkedIdentityHashSet$(E))();
       }
       from(elements) {
         let result = new (LinkedHashSet$(E))();
         for (let element of elements) {
           result.add(element);
         }
         return result;
       }
     }
     LinkedHashSet[dart.implements] = () => [HashSet$(E)];
     dart.defineNamedConstructor(LinkedHashSet, 'identity');
     dart.defineNamedConstructor(LinkedHashSet, 'from');
     return LinkedHashSet;
   });
   let LinkedHashSet = LinkedHashSet$();
+  let __t15$ = dart.generic(function(E) {
+    let __t15 = dart.typedef('__t15', () => dart.functionType(core.int, [E]));
+    return __t15;
+  });
+  let __t15 = __t15$();
+  let __t17$ = dart.generic(function(E) {
+    let __t17 = dart.typedef('__t17', () => dart.functionType(core.bool, [E, E]));
+    return __t17;
+  });
+  let __t17 = __t17$();
   let _modificationCount = Symbol('_modificationCount');
   let _length = Symbol('_length');
   let _next = Symbol('_next');
   let _previous = Symbol('_previous');
   let _insertAfter = Symbol('_insertAfter');
   let _list = Symbol('_list');
   let _unlink = Symbol('_unlink');
   let LinkedList$ = dart.generic(function(E) {
     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) {
         this[_insertAfter](this, entry);
       }
       add(entry) {
         this[_insertAfter](this[_previous], entry);
       }
       addAll(entries) {
-        entries[core.$forEach](dart.as((entry => this[_insertAfter](this[_previous], dart.as(entry, E))).bind(this), dart.functionType(dart.void, [E])));
+        entries[core.$forEach]((entry => this[_insertAfter](this[_previous], dart.as(entry, E))).bind(this));
       }
       remove(entry) {
         if (!dart.equals(entry[_list], this))
           return false;
         this[_unlink](entry);
         return true;
       }
       get [core.$iterator]() {
         return new (_LinkedListIterator$(E))(this);
       }
@@ skipping 1002 matching lines @@
   let _elementCount = Symbol('_elementCount');
   let DoubleLinkedQueue$ = dart.generic(function(E) {
     class DoubleLinkedQueue extends IterableBase$(E) {
       DoubleLinkedQueue() {
         this[_sentinel] = null;
         this[_elementCount] = 0;
         super.IterableBase();
         this[_sentinel] = new (_DoubleLinkedQueueEntrySentinel$(E))();
       }
       from(elements) {
-        let list = dart.as(new DoubleLinkedQueue(), Queue$(E));
+        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) {
         this[_sentinel].prepend(value);
@@ skipping 151 matching lines @@
           initialCapacity = ListQueue[_INITIAL_CAPACITY];
         } else if (!dart.notNull(ListQueue[_isPowerOf2](initialCapacity))) {
           initialCapacity = ListQueue[_nextPowerOf2](initialCapacity);
         }
         dart.assert(ListQueue[_isPowerOf2](initialCapacity));
         this[_table] = new (core.List$(E))(initialCapacity);
       }
       from(elements) {
         if (dart.is(elements, core.List)) {
           let length = elements[core.$length];
-          let queue = dart.as(new ListQueue(dart.notNull(length) + 1), ListQueue$(E));
+          let queue = new (ListQueue$(E))(dart.notNull(length) + 1);
           dart.assert(dart.notNull(queue[_table][core.$length]) > dart.notNull(length));
           let sourceList = elements;
           queue[_table][core.$setRange](0, length, dart.as(sourceList, core.Iterable$(E)), 0);
           queue[_tail] = length;
           return queue;
         } else {
           let capacity = ListQueue[_INITIAL_CAPACITY];
           if (dart.is(elements, _internal.EfficientLength)) {
             capacity = elements[core.$length];
           }
@@ skipping 536 matching lines @@
       }
       set(key, value) {
         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](dart.as(new _SplayTreeMapNode(key, value), _SplayTreeNode$(K)), comp);
+        this[_addNewRoot](new (_SplayTreeMapNode$(K, dart.dynamic))(key, value), comp);
       }
       putIfAbsent(key, ifAbsent) {
         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](dart.as(new _SplayTreeMapNode(key, value), _SplayTreeNode$(K)), comp);
+        this[_addNewRoot](new (_SplayTreeMapNode$(K, dart.dynamic))(key, value), comp);
         return value;
       }
       addAll(other) {
         other.forEach(((key, value) => {
           this.set(key, value);
         }).bind(this));
       }
       get isEmpty() {
         return this[_root] == null;
       }
@@ skipping 181 matching lines @@
         return this[_tree][_count];
       }
       get [core.$isEmpty]() {
         return this[_tree][_count] == 0;
       }
       get [core.$iterator]() {
         return new (_SplayTreeKeyIterator$(K))(this[_tree]);
       }
       [core.$toSet]() {
         let setOrMap = this[_tree];
-        let set = new (SplayTreeSet$(K))(dart.as(setOrMap[_comparator], dart.functionType(core.int, [K, K])), dart.as(setOrMap[_validKey], dart.functionType(core.bool, [dart.dynamic])));
+        let set = new (SplayTreeSet$(K))(dart.as(setOrMap[_comparator], __t20), dart.as(setOrMap[_validKey], __t23));
         set[_count] = this[_tree][_count];
         set[_root] = set[_copyNode](this[_tree][_root]);
         return set;
       }
     }
     _SplayTreeKeyIterable[dart.implements] = () => [_internal.EfficientLength];
     return _SplayTreeKeyIterable;
   });
   let _SplayTreeKeyIterable = _SplayTreeKeyIterable$();
   let _SplayTreeValueIterable$ = dart.generic(function(K, V) {
@@ skipping 111 matching lines @@
           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) {
         let compare = this[_splay](element);
         if (compare == 0)
           return false;
-        this[_addNewRoot](dart.as(new _SplayTreeNode(element), _SplayTreeNode$(E)), compare);
+        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;
       }
       addAll(elements) {
         for (let element of elements) {
           let compare = this[_splay](element);
           if (compare != 0) {
-            this[_addNewRoot](dart.as(new _SplayTreeNode(element), _SplayTreeNode$(E)), compare);
+            this[_addNewRoot](new (_SplayTreeNode$(E))(element), compare);
           }
         }
       }
       removeAll(elements) {
         for (let element of elements) {
           if (dart.dcall(this[_validKey], element))
             this[_remove](dart.as(element, E));
         }
       }
       retainAll(elements) {
-        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
+        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], __t25), this[_validKey]);
         let modificationCount = this[_modificationCount];
         for (let object of elements) {
           if (modificationCount != this[_modificationCount]) {
             throw new core.ConcurrentModificationError(this);
           }
           if (dart.notNull(dart.dcall(this[_validKey], object)) && this[_splay](dart.as(object, E)) == 0)
             retainSet.add(this[_root].key);
         }
         if (retainSet[_count] != this[_count]) {
           this[_root] = retainSet[_root];
@@ skipping 51 matching lines @@
         return this[_clone]();
       }
       toString() {
         return IterableBase.iterableToFullString(this, '{', '}');
       }
     }
     dart.defineNamedConstructor(SplayTreeSet, 'from');
     return SplayTreeSet;
   });
   let SplayTreeSet = SplayTreeSet$();
+  let __t20$ = dart.generic(function(K) {
+    let __t20 = dart.typedef('__t20', () => dart.functionType(core.int, [K, K]));
+    return __t20;
+  });
+  let __t20 = __t20$();
+  let __t23 = dart.typedef('__t23', () => dart.functionType(core.bool, [dart.dynamic]));
+  let __t25$ = dart.generic(function(E) {
+    let __t25 = dart.typedef('__t25', () => dart.functionType(core.int, [E, E]));
+    return __t25;
+  });
+  let __t25 = __t25$();
   let _strings = Symbol('_strings');
   let _nums = Symbol('_nums');
   let _rest = Symbol('_rest');
   let _isStringKey = Symbol('_isStringKey');
   let _hasTableEntry = Symbol('_hasTableEntry');
   let _isNumericKey = Symbol('_isNumericKey');
   let _containsKey = Symbol('_containsKey');
   let _getBucket = Symbol('_getBucket');
   let _findBucketIndex = Symbol('_findBucketIndex');
   let _computeKeys = Symbol('_computeKeys');
@@ skipping 21 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 new (_internal.MappedIterable$(K, V))(this.keys, dart.as((each => this.get(each)).bind(this), dart.functionType(V, [K])));
+        return new (_internal.MappedIterable$(K, V))(this.keys, (each => this.get(each)).bind(this));
       }
       containsKey(key) {
         if (_HashMap[_isStringKey](key)) {
           let strings = this[_strings];
           return strings == null ? false : _HashMap[_hasTableEntry](strings, key);
         } else if (_HashMap[_isNumericKey](key)) {
           let nums = this[_nums];
           return nums == null ? false : _HashMap[_hasTableEntry](nums, key);
         } else {
           return this[_containsKey](key);
@@ skipping 380 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 new (_internal.MappedIterable$(K, V))(this.keys, dart.as((each => this.get(each)).bind(this), dart.functionType(V, [K])));
+        return new (_internal.MappedIterable$(K, V))(this.keys, (each => this.get(each)).bind(this));
       }
       containsKey(key) {
         if (_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 (_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[core.$any](dart.as((each => dart.equals(this.get(each), value)).bind(this), dart.functionType(core.bool, [K])));
+        return this.keys[core.$any]((each => dart.equals(this.get(each), value)).bind(this));
       }
       addAll(other) {
         other.forEach(((key, value) => {
           this.set(key, value);
         }).bind(this));
       }
       get(key) {
         if (_LinkedHashMap[_isStringKey](key)) {
           let strings = this[_strings];
           if (strings == null)
@@ skipping 689 matching lines @@
         this[_modifications] = 0;
         super._HashSetBase();
       }
       [_newSet]() {
         return new (_LinkedHashSet$(E))();
       }
       [_unsupported](operation) {
         throw `LinkedHashSet: unsupported ${operation}`;
       }
       get [core.$iterator]() {
-        return dart.as(new LinkedHashSetIterator(this, this[_modifications]), core.Iterator$(E));
+        return new (LinkedHashSetIterator$(E))(this, this[_modifications]);
       }
       get [core.$length]() {
         return this[_length];
       }
       get [core.$isEmpty]() {
         return this[_length] == 0;
       }
       get [core.$isNotEmpty]() {
         return !dart.notNull(this[core.$isEmpty]);
       }
@@ skipping 417 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 = {}));