rename dart_runtime.js helpers

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 207 matching lines @@
         }
         let value = iterator.current;
         while (iterator.moveNext()) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       [core.$fold](initialValue, combine) {
         let value = initialValue;
         for (let element of this)
-          value = dart.dinvokef(combine, value, element);
+          value = dart.dcall(combine, value, element);
         return value;
       }
       [core.$every](f) {
         for (let element of this) {
           if (!dart.notNull(f(element)))
             return false;
         }
         return true;
       }
       [core.$join](separator) {
@@ skipping 225 matching lines @@
         }
         let value = iterator.current;
         while (iterator.moveNext()) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       [core.$fold](initialValue, combine) {
         let value = initialValue;
         for (let element of this)
-          value = dart.dinvokef(combine, value, element);
+          value = dart.dcall(combine, value, element);
         return value;
       }
       [core.$every](f) {
         for (let element of this) {
           if (!dart.notNull(f(element)))
             return false;
         }
         return true;
       }
       [core.$join](separator) {
@@ skipping 180 matching lines @@
         }
         let value = iterator.current;
         while (iterator.moveNext()) {
           value = combine(value, iterator.current);
         }
         return value;
       }
       [core.$fold](initialValue, combine) {
         let value = initialValue;
         for (let element of this)
-          value = dart.dinvokef(combine, value, element);
+          value = dart.dcall(combine, value, element);
         return value;
       }
       [core.$every](f) {
         for (let element of this) {
           if (!dart.notNull(f(element)))
             return false;
         }
         return true;
       }
       [core.$join](separator) {
@@ skipping 234 matching lines @@
           } else {
             ultimate = it.current;
             count = dart.notNull(count) + 1;
             dart.assert(dart.notNull(count) < dart.notNull(MAX_COUNT));
             while (it.moveNext()) {
               penultimate = ultimate;
               ultimate = it.current;
               count = dart.notNull(count) + 1;
               if (dart.notNull(count) > dart.notNull(MAX_COUNT)) {
                 while (dart.notNull(length) > dart.notNull(LENGTH_LIMIT) - dart.notNull(ELLIPSIS_SIZE) - dart.notNull(OVERHEAD) && dart.notNull(count) > dart.notNull(HEAD_COUNT)) {
-                  length = dart.notNull(length) - dart.notNull(dart.as(dart.dbinary(dart.dload(parts[core.$removeLast](), 'length'), '+', OVERHEAD), core.int));
+                  length = dart.notNull(length) - dart.notNull(dart.as(dart.dsend(dart.dload(parts[core.$removeLast](), 'length'), '+', OVERHEAD), core.int));
                   count = dart.notNull(count) - 1;
                 }
                 parts[core.$add]("...");
                 return;
               }
             }
             penultimateString = `${penultimate}`;
             ultimateString = `${ultimate}`;
             length = dart.notNull(length) + (dart.notNull(ultimateString.length) + dart.notNull(penultimateString.length) + 2 * dart.notNull(OVERHEAD));
           }
         }
         let elision = null;
         if (dart.notNull(count) > dart.notNull(parts[core.$length]) + dart.notNull(TAIL_COUNT)) {
           elision = "...";
           length = dart.notNull(length) + (dart.notNull(ELLIPSIS_SIZE) + dart.notNull(OVERHEAD));
         }
         while (dart.notNull(length) > dart.notNull(LENGTH_LIMIT) && dart.notNull(parts[core.$length]) > dart.notNull(HEAD_COUNT)) {
-          length = dart.notNull(length) - dart.notNull(dart.as(dart.dbinary(dart.dload(parts[core.$removeLast](), 'length'), '+', OVERHEAD), core.int));
+          length = dart.notNull(length) - dart.notNull(dart.as(dart.dsend(dart.dload(parts[core.$removeLast](), 'length'), '+', OVERHEAD), core.int));
           if (elision == null) {
             elision = "...";
             length = dart.notNull(length) + (dart.notNull(ELLIPSIS_SIZE) + dart.notNull(OVERHEAD));
           }
         }
         if (elision != null) {
           parts[core.$add](elision);
         }
         parts[core.$add](penultimateString);
         parts[core.$add](ultimateString);
@@ skipping 498 matching lines @@
           if (length != this[core.$length]) {
             throw new core.ConcurrentModificationError(this);
           }
         }
         return value;
       }
       [core.$fold](initialValue, combine) {
         let value = initialValue;
         let length = this[core.$length];
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
-          value = dart.dinvokef(combine, value, this[core.$get](i));
+          value = dart.dcall(combine, value, this[core.$get](i));
           if (length != this[core.$length]) {
             throw new core.ConcurrentModificationError(this);
           }
         }
         return value;
       }
       [core.$skip](count) {
         return new (_internal.SubListIterable$(E))(this, count, null);
       }
       [core.$skipWhile](test) {
@@ skipping 57 matching lines @@
         ListMixin[_filter](this, test, false);
       }
       [core.$retainWhere](test) {
         ListMixin[_filter](this, test, true);
       }
       static [_filter](source, test, retainMatching) {
         let retained = new core.List.from([]);
         let length = source[core.$length];
         for (let i = 0; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           let element = source[core.$get](i);
-          if (dart.dinvokef(test, element) == retainMatching) {
+          if (dart.dcall(test, element) == retainMatching) {
             retained[core.$add](element);
           }
           if (length != source[core.$length]) {
             throw new core.ConcurrentModificationError(source);
           }
         }
         if (retained[core.$length] != source[core.$length]) {
           source[core.$setRange](0, retained[core.$length], retained);
           source[core.$length] = retained[core.$length];
         }
@@ skipping 446 matching lines @@
       map.set(key, v);
       return v;
     }
     static clear(map) {
       for (let k of map.keys[core.$toList]()) {
         map.remove(k);
       }
     }
     static forEach(map, f) {
       for (let k of map.keys) {
-        dart.dinvokef(f, k, map.get(k));
+        dart.dcall(f, k, map.get(k));
       }
     }
     static getValues(map) {
       return map.keys[core.$map](key => map.get(key));
     }
     static length(map) {
       return map.keys[core.$length];
     }
     static isEmpty(map) {
       return map.keys[core.$isEmpty];
@@ skipping 28 matching lines @@
     }
     static [_id](x) {
       return x;
     }
     static [_fillMapWithMappedIterable](map, iterable, key, value) {
       if (key == null)
         key = Maps[_id];
       if (value == null)
         value = Maps[_id];
       for (let element of iterable) {
-        map.set(dart.dinvokef(key, element), dart.dinvokef(value, element));
+        map.set(dart.dcall(key, element), dart.dcall(value, element));
       }
     }
     static [_fillMapWithIterables](map, keys, values) {
       let keyIterator = keys[core.$iterator];
       let valueIterator = values[core.$iterator];
       let hasNextKey = keyIterator.moveNext();
       let hasNextValue = valueIterator.moveNext();
       while (dart.notNull(hasNextKey) && dart.notNull(hasNextValue)) {
         map.set(keyIterator.current, valueIterator.current);
         hasNextKey = keyIterator.moveNext();
@@ skipping 793 matching lines @@
         return this[_comparator](key1, key2);
       }
       [_internal$]() {
         this[_comparator] = null;
         this[_validKey] = null;
         super._SplayTree();
       }
       get(key) {
         if (key == null)
           throw new core.ArgumentError(key);
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         if (this[_root] != null) {
           let comp = this[_splay](dart.as(key, K));
           if (comp == 0) {
             let mapRoot = dart.as(this[_root], _SplayTreeMapNode);
             return dart.as(mapRoot.value, V);
           }
         }
         return null;
       }
       remove(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], 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) {
         if (key == null)
           throw new core.ArgumentError(key);
         let comp = this[_splay](key);
@@ skipping 43 matching lines @@
           f(node.key, node.value);
         }
       }
       get length() {
         return this[_count];
       }
       clear() {
         this[_clear]();
       }
       containsKey(key) {
-        return dart.notNull(dart.dinvokef(this[_validKey], key)) && this[_splay](dart.as(key, K)) == 0;
+        return dart.notNull(dart.dcall(this[_validKey], key)) && this[_splay](dart.as(key, K)) == 0;
       }
       containsValue(value) {
         let found = false;
         let initialSplayCount = this[_splayCount];
         // Function visit: (_SplayTreeMapNode<dynamic, dynamic>) → bool
         function visit(node) {
           while (node != null) {
             if (dart.equals(node.value, value))
               return true;
             if (initialSplayCount != this[_splayCount]) {
@@ skipping 247 matching lines @@
           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);
         }
         return result;
       }
       [_compare](e1, e2) {
-        return dart.dinvokef(this[_comparator], e1, e2);
+        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 11 matching lines @@
         return dart.as(this[_last].key, E);
       }
       get [core.$single]() {
         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.dinvokef(this[_validKey], object)) && this[_splay](dart.as(object, E)) == 0;
+        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);
         return true;
       }
       remove(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], 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);
           }
         }
       }
       removeAll(elements) {
         for (let element of elements) {
-          if (dart.dinvokef(this[_validKey], element))
+          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 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)
+          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];
           this[_count] = retainSet[_count];
           this[_modificationCount] = dart.notNull(this[_modificationCount]) + 1;
         }
       }
       lookup(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(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.functionType(core.int, [E, E])), this[_validKey]);
         for (let element of this) {
           if (other[core.$contains](element))
@@ skipping 347 matching lines @@
   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);
         super._HashMap();
       }
       get(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_get](key);
       }
       set(key, value) {
         super[_set](key, value);
       }
       containsKey(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return false;
         return super[_containsKey](key);
       }
       remove(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_remove](key);
       }
       [_computeHashCode](key) {
         return this[_hashCode](dart.as(key, K)) & 0x3ffffff;
       }
       [_findBucketIndex](bucket, key) {
         if (bucket == null)
           return -1;
         let length = bucket.length;
@@ skipping 16 matching lines @@
         this[_map] = map$;
         super.IterableBase();
       }
       get [core.$length]() {
         return dart.as(dart.dload(this[_map], '_length'), core.int);
       }
       get [core.$isEmpty]() {
         return dart.equals(dart.dload(this[_map], '_length'), 0);
       }
       get [core.$iterator]() {
-        return new (HashMapKeyIterator$(E))(this[_map], dart.as(dart.dinvoke(this[_map], '_computeKeys'), core.List));
+        return new (HashMapKeyIterator$(E))(this[_map], dart.as(dart.dsend(this[_map], '_computeKeys'), core.List));
       }
       [core.$contains](element) {
-        return dart.as(dart.dinvoke(this[_map], 'containsKey', element), core.bool);
+        return dart.as(dart.dsend(this[_map], 'containsKey', element), core.bool);
       }
       [core.$forEach](f) {
-        let keys = dart.as(dart.dinvoke(this[_map], '_computeKeys'), core.List);
+        let keys = dart.as(dart.dsend(this[_map], '_computeKeys'), core.List);
         for (let i = 0, length = keys.length; dart.notNull(i) < dart.notNull(length); i = dart.notNull(i) + 1) {
           f(dart.as(keys[i], E));
           if (keys !== dart.dload(this[_map], '_keys')) {
             throw new core.ConcurrentModificationError(this[_map]);
           }
         }
       }
     }
     HashMapKeyIterable[dart.implements] = () => [_internal.EfficientLength];
     return HashMapKeyIterable;
@@ skipping 326 matching lines @@
   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);
         super._LinkedHashMap();
       }
       get(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_get](key);
       }
       set(key, value) {
         super[_set](key, value);
       }
       containsKey(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return false;
         return super[_containsKey](key);
       }
       remove(key) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], key)))
+        if (!dart.notNull(dart.dcall(this[_validKey], key)))
           return null;
         return super[_remove](key);
       }
       [_computeHashCode](key) {
         return this[_hashCode](dart.as(key, K)) & 0x3ffffff;
       }
       [_findBucketIndex](bucket, key) {
         if (bucket == null)
           return -1;
         let length = bucket.length;
@@ skipping 25 matching lines @@
       get [core.$length]() {
         return dart.as(dart.dload(this[_map], '_length'), core.int);
       }
       get [core.$isEmpty]() {
         return dart.equals(dart.dload(this[_map], '_length'), 0);
       }
       get [core.$iterator]() {
         return new (LinkedHashMapKeyIterator$(E))(this[_map], dart.as(dart.dload(this[_map], '_modifications'), core.int));
       }
       [core.$contains](element) {
-        return dart.as(dart.dinvoke(this[_map], 'containsKey', element), core.bool);
+        return dart.as(dart.dsend(this[_map], 'containsKey', element), core.bool);
       }
       [core.$forEach](f) {
         let cell = dart.as(dart.dload(this[_map], '_first'), LinkedHashMapCell);
         let modifications = dart.as(dart.dload(this[_map], '_modifications'), core.int);
         while (cell != null) {
           f(dart.as(cell[_key], E));
           if (!dart.equals(modifications, dart.dload(this[_map], '_modifications'))) {
             throw new core.ConcurrentModificationError(this[_map]);
           }
           cell = cell[_next];
@@ skipping 316 matching lines @@
         }
         return -1;
       }
       [_computeHashCode](element) {
         return this[_hasher](dart.as(element, E)) & 0x3ffffff;
       }
       add(object) {
         return super[_add](object);
       }
       [core.$contains](object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_contains](object);
       }
       lookup(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return null;
         return super[_lookup](object);
       }
       remove(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_remove](object);
       }
     }
     return _CustomHashSet;
   });
   let _CustomHashSet = _CustomHashSet$();
   let HashSetIterator$ = dart.generic(function(E) {
     class HashSetIterator extends core.Object {
       HashSetIterator(set$, elements$) {
@@ skipping 341 matching lines @@
         }
         return -1;
       }
       [_computeHashCode](element) {
         return this[_hasher](dart.as(element, E)) & 0x3ffffff;
       }
       add(element) {
         return super[_add](element);
       }
       [core.$contains](object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_contains](object);
       }
       lookup(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return null;
         return super[_lookup](object);
       }
       remove(object) {
-        if (!dart.notNull(dart.dinvokef(this[_validKey], object)))
+        if (!dart.notNull(dart.dcall(this[_validKey], object)))
           return false;
         return super[_remove](object);
       }
       containsAll(elements) {
         for (let element of elements) {
-          if (!dart.notNull(dart.dinvokef(this[_validKey], element)) || !dart.notNull(this[core.$contains](element)))
+          if (!dart.notNull(dart.dcall(this[_validKey], element)) || !dart.notNull(this[core.$contains](element)))
             return false;
         }
         return true;
       }
       removeAll(elements) {
         for (let element of elements) {
-          if (dart.dinvokef(this[_validKey], element)) {
+          if (dart.dcall(this[_validKey], element)) {
             super[_remove](element);
           }
         }
       }
     }
     return _LinkedCustomHashSet;
   });
   let _LinkedCustomHashSet = _LinkedCustomHashSet$();
   class LinkedHashSetCell extends core.Object {
     LinkedHashSetCell(element$) {
@@ skipping 90 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 = {}));