Disable closure wrapping by default

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 29 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.closureWrap(_defaultHashCode, "(K) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
           } 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.closureWrap(_defaultEquals, "(K, K) → bool");
+              equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.closureWrap(_defaultHashCode, "(K) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
           }
           if (equals == null) {
-            equals = dart.closureWrap(_defaultEquals, "(K, K) → bool");
+            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
           }
         }
         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.closureWrap(_defaultHashCode, "(E) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
           } 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.closureWrap(_defaultEquals, "(E, E) → bool");
+              equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.closureWrap(_defaultHashCode, "(E) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
           }
           if (equals == null) {
-            equals = dart.closureWrap(_defaultEquals, "(E, E) → bool");
+            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
           }
         }
         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.closureWrap(_defaultHashCode, "(K) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
           } 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.closureWrap(_defaultEquals, "(K, K) → bool");
+              equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.closureWrap(_defaultHashCode, "(K) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (K) → int"));
           }
           if (equals == null) {
-            equals = dart.closureWrap(_defaultEquals, "(K, K) → bool");
+            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (K, K) → bool"));
           }
         }
         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.closureWrap(_defaultHashCode, "(E) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
           } 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.closureWrap(_defaultEquals, "(E, E) → bool");
+              equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
             }
           }
         } else {
           if (hashCode == null) {
-            hashCode = dart.closureWrap(_defaultHashCode, "(E) → int");
+            hashCode = dart.as(_defaultHashCode, dart.throw_("Unimplemented type (E) → int"));
           }
           if (equals == null) {
-            equals = dart.closureWrap(_defaultEquals, "(E, E) → bool");
+            equals = dart.as(_defaultEquals, dart.throw_("Unimplemented type (E, E) → bool"));
           }
         }
         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 2144 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.closureWrap(this[_comparator], "(E, E) → int"), this[_validKey]);
+        let retainSet = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), 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.closureWrap(this[_comparator], "(E, E) → int"), this[_validKey]);
+        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
         for (let element of this) {
           if (other.contains(element))
             result.add(element);
         }
         return result;
       }
       difference(other) {
-        let result = new (SplayTreeSet$(E))(dart.closureWrap(this[_comparator], "(E, E) → int"), this[_validKey]);
+        let result = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), this[_validKey]);
         for (let element of this) {
           if (!dart.notNull(other.contains(element)))
             result.add(element);
         }
         return result;
       }
       union(other) {
         return ((_) => {
           _.addAll(other);
           return _;
         })(this[_clone]());
       }
       [_clone]() {
-        let set = new (SplayTreeSet$(E))(dart.closureWrap(this[_comparator], "(E, E) → int"), this[_validKey]);
+        let set = new (SplayTreeSet$(E))(dart.as(this[_comparator], dart.throw_("Unimplemented type (E, E) → int")), 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 1624 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 = {}));