Initial support for runtime function types and type checking

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();
       }
       get [core.$length]() {
         return this[_source][core.$length];
       }
       [core.$get](index) {
         return this[_source][core.$elementAt](index);
       }
     }
     return UnmodifiableListView;
   });
   dart.defineLazyClassGeneric(exports, 'UnmodifiableListView', {get: UnmodifiableListView$});
   // Function _defaultEquals: (dynamic, dynamic) → bool
   function _defaultEquals(a, b) {
     return dart.equals(a, b);
   }
   // Function _defaultHashCode: (dynamic) → int
   function _defaultHashCode(a) {
     return a.hashCode;
   }
   let _Equality$ = dart.generic(function(K) {
-    class _Equality extends core.Function {}
+    let _Equality = dart.typedef('_Equality', () => dart.functionType(core.bool, [K, K]));
     return _Equality;
   });
   let _Equality = _Equality$();
   let _Hasher$ = dart.generic(function(K) {
-    class _Hasher extends core.Function {}
+    let _Hasher = dart.typedef('_Hasher', () => dart.functionType(core.int, [K]));
     return _Hasher;
   });
   let _Hasher = _Hasher$();
   let _fillMapWithMappedIterable = Symbol('_fillMapWithMappedIterable');
   let _fillMapWithIterables = Symbol('_fillMapWithIterables');
   let HashMap$ = dart.generic(function(K, V) {
     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.throw_("Unimplemented type (K) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           } 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.throw_("Unimplemented type (K, K) → bool"));
+              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           }
           if (equals == null) {
-            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
+            equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
           }
         }
         return new (_CustomHashMap$(K, V))(equals, hashCode, isValidKey);
       }
       identity() {
         return new (_IdentityHashMap$(K, V))();
       }
       from(other) {
         let result = new (HashMap$(K, V))();
         other.forEach((k, v) => {
@@ skipping 311 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.throw_("Unimplemented type (E) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           } 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.throw_("Unimplemented type (E, E) → bool"));
+              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           }
           if (equals == null) {
-            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
+            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)))
@@ skipping 583 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.throw_("Unimplemented type (K) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           } 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.throw_("Unimplemented type (K, K) → bool"));
+              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [K]));
           }
           if (equals == null) {
-            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
+            equals = dart.as(_defaultEquals, dart.functionType(core.bool, [K, K]));
           }
         }
         return new (_LinkedCustomHashMap$(K, V))(equals, hashCode, isValidKey);
       }
       identity() {
         return new (_LinkedIdentityHashMap$(K, V))();
       }
       from(other) {
         let result = new (LinkedHashMap$(K, V))();
         other.forEach((k, v) => {
@@ skipping 34 matching lines @@
     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.throw_("Unimplemented type (E) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           } 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.throw_("Unimplemented type (E, E) → bool"));
+              equals = dart.as(_defaultEquals, dart.functionType(core.bool, [E, E]));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
+            hashCode = dart.as(_defaultHashCode, dart.functionType(core.int, [E]));
           }
           if (equals == null) {
-            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
+            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) {
@@ skipping 25 matching lines @@
         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.throw_("Unimplemented type (E) → void")));
+        entries[core.$forEach](dart.as(((entry) => this[_insertAfter](this[_previous], dart.as(entry, E))).bind(this), dart.functionType(dart.void, [E])));
       }
       remove(entry) {
         if (!dart.equals(entry[_list], this))
           return false;
         this[_unlink](entry);
         return true;
       }
       get [core.$iterator]() {
         return new (_LinkedListIterator$(E))(this);
       }
@@ skipping 1452 matching lines @@
         this[_current] = dart.as(this[_queue][_table][core.$get](this[_position]), E);
         this[_position] = dart.notNull(this[_position]) + 1 & dart.notNull(this[_queue][_table][core.$length]) - 1;
         return true;
       }
     }
     _ListQueueIterator[dart.implements] = () => [core.Iterator$(E)];
     return _ListQueueIterator;
   });
   let _ListQueueIterator = _ListQueueIterator$();
   let _Predicate$ = dart.generic(function(T) {
-    class _Predicate extends core.Function {}
+    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) {
         this.key = key;
         this.left = null;
         this.right = null;
       }
@@ skipping 468 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.throw_("Unimplemented type (K, K) → int")), dart.as(setOrMap[_validKey], dart.throw_("Unimplemented type (dynamic) → bool")));
+        let set = new (SplayTreeSet$(K))(dart.as(setOrMap[_comparator], dart.functionType(core.int, [K, K])), dart.as(setOrMap[_validKey], dart.functionType(core.bool, [dynamic])));
         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 134 matching lines @@
           }
         }
       }
       removeAll(elements) {
         for (let element of elements) {
           if (dart.dinvokef(this[_validKey], element))
             this[_remove](dart.as(element, E));
         }
       }
       retainAll(elements) {
-        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
+        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         let modificationCount = this[_modificationCount];
         for (let object of elements) {
           if (modificationCount != this[_modificationCount]) {
             throw new core.ConcurrentModificationError(this);
           }
           if (dart.notNull(dart.dinvokef(this[_validKey], object)) && this[_splay](dart.as(object, E)) == 0)
             retainSet.add(this[_root].key);
         }
         if (retainSet[_count] != this[_count]) {
           this[_root] = retainSet[_root];
           this[_count] = retainSet[_count];
           this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
         }
       }
       lookup(object) {
         if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
           return null;
         let comp = this[_splay](dart.as(object, E));
         if (comp != 0)
           return null;
         return this[_root].key;
       }
       intersection(other) {
-        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
+        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         for (let element of this) {
           if (other[core.$contains](element))
             result.add(element);
         }
         return result;
       }
       difference(other) {
-        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
+        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         for (let element of this) {
           if (!dart.notNull(other[core.$contains](element)))
             result.add(element);
         }
         return result;
       }
       union(other) {
         return ((_) => {
           _.addAll(other);
           return _;
         })(this[_clone]());
       }
       [_clone]() {
-        let set = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
+        let set = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.functionType(core.int, [E, E])), this[_validKey]);
         set[_count] = this[_count];
         set[_root] = this[_copyNode](this[_root]);
         return set;
       }
       [_copyNode](node) {
         if (node == null)
           return null;
         return ((_) => {
           _.left = this[_copyNode](node.left);
           _.right = this[_copyNode](node.right);
@@ skipping 48 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.throw_("Unimplemented type (K) → V")));
+        return new (_internal.MappedIterable$(K, V))(this.keys, dart.as(((each) => this.get(each)).bind(this), dart.functionType(V, [K])));
       }
       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.throw_("Unimplemented type (K) → V")));
+        return new (_internal.MappedIterable$(K, V))(this.keys, dart.as(((each) => this.get(each)).bind(this), dart.functionType(V, [K])));
       }
       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.throw_("Unimplemented type (K) → bool")));
+        return this.keys[core.$any](dart.as(((each) => dart.equals(this.get(each), value)).bind(this), dart.functionType(core.bool, [K])));
       }
       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 1127 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 = {}));