fixes private named constructors

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 38 matching lines @@
         } else {
           if (hashCode === null) {
             hashCode = dart.closureWrap(_defaultHashCode, "(K) → int");
           }
           if (equals === null) {
             equals = dart.closureWrap(_defaultEquals, "(K, K) → bool");
           }
         }
         return new _CustomHashMap(equals, hashCode, isValidKey);
       }
-      HashMap$identity() {
+      identity() {
         return new _IdentityHashMap();
       }
-      HashMap$from(other) {
+      from(other) {
         let result = new HashMap();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
-      HashMap$fromIterable(iterable, opts) {
+      fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let map = new HashMap();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
-      HashMap$fromIterables(keys, values) {
+      fromIterables(keys, values) {
         let map = new HashMap();
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
     }
     dart.defineNamedConstructor(HashMap, 'identity');
     dart.defineNamedConstructor(HashMap, 'from');
     dart.defineNamedConstructor(HashMap, 'fromIterable');
     dart.defineNamedConstructor(HashMap, 'fromIterables');
     return HashMap;
@@ skipping 306 matching lines @@
         } else {
           if (hashCode === null) {
             hashCode = dart.closureWrap(_defaultHashCode, "(E) → int");
           }
           if (equals === null) {
             equals = dart.closureWrap(_defaultEquals, "(E, E) → bool");
           }
         }
         return new _CustomHashSet(equals, hashCode, isValidKey);
       }
-      HashSet$identity() {
+      identity() {
         return new _IdentityHashSet();
       }
-      HashSet$from(elements) {
+      from(elements) {
         let result = new HashSet();
         for (let e of elements)
           result.add(e);
         return result;
       }
     }
     dart.defineNamedConstructor(HashSet, 'identity');
     dart.defineNamedConstructor(HashSet, 'from');
     return HashSet;
   });
@@ skipping 591 matching lines @@
         } else {
           if (hashCode === null) {
             hashCode = dart.closureWrap(_defaultHashCode, "(K) → int");
           }
           if (equals === null) {
             equals = dart.closureWrap(_defaultEquals, "(K, K) → bool");
           }
         }
         return new _LinkedCustomHashMap(equals, hashCode, isValidKey);
       }
-      LinkedHashMap$identity() {
+      identity() {
         return new _LinkedIdentityHashMap();
       }
-      LinkedHashMap$from(other) {
+      from(other) {
         let result = new LinkedHashMap();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
-      LinkedHashMap$fromIterable(iterable, opts) {
+      fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let map = new LinkedHashMap();
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
-      LinkedHashMap$fromIterables(keys, values) {
+      fromIterables(keys, values) {
         let map = new LinkedHashMap();
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
-      LinkedHashMap$_literal(keyValuePairs) {
+      [_literal](keyValuePairs) {
         return dart.as(_js_helper.fillLiteralMap(keyValuePairs, new _LinkedHashMap()), LinkedHashMap$(K, V));
       }
-      LinkedHashMap$_empty() {
+      [_empty]() {
         return new _LinkedHashMap();
       }
     }
     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;
@@ skipping 22 matching lines @@
         } else {
           if (hashCode === null) {
             hashCode = dart.closureWrap(_defaultHashCode, "(E) → int");
           }
           if (equals === null) {
             equals = dart.closureWrap(_defaultEquals, "(E, E) → bool");
           }
         }
         return new _LinkedCustomHashSet(equals, hashCode, isValidKey);
       }
-      LinkedHashSet$identity() {
+      identity() {
         return new _LinkedIdentityHashSet();
       }
-      LinkedHashSet$from(elements) {
+      from(elements) {
         let result = new LinkedHashSet();
         for (let element of elements) {
           result.add(element);
         }
         return result;
       }
     }
     dart.defineNamedConstructor(LinkedHashSet, 'identity');
     dart.defineNamedConstructor(LinkedHashSet, 'from');
     return LinkedHashSet;
@@ skipping 931 matching lines @@
       if (dart.notNull(hasNextKey) || dart.notNull(hasNextValue)) {
         throw new core.ArgumentError("Iterables do not have same length.");
       }
     }
   }
   let Queue$ = dart.generic(function(E) {
     class Queue extends core.Object {
       Queue() {
         return new ListQueue();
       }
-      Queue$from(elements) {
+      from(elements) {
         return new ListQueue.from(elements);
       }
     }
     dart.defineNamedConstructor(Queue, 'from');
     return Queue;
   });
   let Queue = Queue$(dart.dynamic);
   let _element = Symbol('_element');
   let _link = Symbol('_link');
   let _asNonSentinelEntry = Symbol('_asNonSentinelEntry');
@@ skipping 67 matching lines @@
   let _sentinel = Symbol('_sentinel');
   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();
       }
-      DoubleLinkedQueue$from(elements) {
+      from(elements) {
         let list = dart.as(new DoubleLinkedQueue(), Queue$(E));
         for (let e of elements) {
           list.addLast(e);
         }
         return dart.as(list, DoubleLinkedQueue$(E));
       }
       get length() {
         return this[_elementCount];
       }
       addLast(value) {
@@ skipping 147 matching lines @@
         this[_modificationCount] = 0;
         super.IterableBase();
         if (initialCapacity === null || dart.notNull(initialCapacity) < dart.notNull(ListQueue[_INITIAL_CAPACITY])) {
           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(initialCapacity);
       }
-      ListQueue$from(elements) {
+      from(elements) {
         if (dart.is(elements, core.List)) {
           let length = elements.length;
           let queue = dart.as(new ListQueue(dart.notNull(length) + 1), ListQueue$(E));
           dart.assert(dart.notNull(queue[_table].length) > dart.notNull(length));
           let sourceList = elements;
           queue[_table].setRange(0, length, dart.as(sourceList, core.Iterable$(E)), 0);
           queue[_tail] = length;
           return queue;
         } else {
           let capacity = ListQueue[_INITIAL_CAPACITY];
@@ skipping 466 matching lines @@
     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 ? core.Comparable.compare : compare, core.Comparator);
         this[_validKey] = dart.as(isValidKey !== null ? isValidKey : (v) => dart.is(v, K), _Predicate);
         super._SplayTree();
       }
-      SplayTreeMap$from(other, compare, isValidKey) {
+      from(other, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
         if (isValidKey === void 0)
           isValidKey = null;
         let result = new SplayTreeMap();
         other.forEach((k, v) => {
           result.set(k, dart.as(v, V));
         });
         return result;
       }
-      SplayTreeMap$fromIterable(iterable, opts) {
+      fromIterable(iterable, opts) {
         let key = opts && 'key' in opts ? opts.key : null;
         let value = opts && 'value' in opts ? opts.value : null;
         let compare = opts && 'compare' in opts ? opts.compare : null;
         let isValidKey = opts && 'isValidKey' in opts ? opts.isValidKey : null;
         let map = new SplayTreeMap(compare, isValidKey);
         Maps._fillMapWithMappedIterable(map, iterable, key, value);
         return map;
       }
-      SplayTreeMap$fromIterables(keys, values, compare, isValidKey) {
+      fromIterables(keys, values, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
         if (isValidKey === void 0)
           isValidKey = null;
         let map = new SplayTreeMap(compare, isValidKey);
         Maps._fillMapWithIterables(map, keys, values);
         return map;
       }
       [_compare](key1, key2) {
         return this[_comparator](key1, key2);
       }
-      SplayTreeMap$_internal() {
+      [_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)))
           return null;
         if (this[_root] !== null) {
@@ skipping 159 matching lines @@
   let _SplayTreeIterator$ = dart.generic(function(T) {
     class _SplayTreeIterator extends core.Object {
       _SplayTreeIterator(tree) {
         this[_workList] = new core.List$(_SplayTreeNode).from([]);
         this[_tree] = tree;
         this[_modificationCount] = tree[_modificationCount];
         this[_splayCount] = tree[_splayCount];
         this[_currentNode] = null;
         this[_findLeftMostDescendent](tree[_root]);
       }
-      _SplayTreeIterator$startAt(tree, startKey) {
+      startAt(tree, startKey) {
         this[_workList] = new core.List$(_SplayTreeNode).from([]);
         this[_tree] = tree;
         this[_modificationCount] = tree[_modificationCount];
         this[_splayCount] = null;
         this[_currentNode] = null;
         if (tree[_root] === null)
           return;
         let compare = tree._splay(startKey);
         this[_splayCount] = tree[_splayCount];
         if (dart.notNull(compare) < 0) {
@@ skipping 111 matching lines @@
       }
     }
     return _SplayTreeValueIterator;
   });
   let _SplayTreeValueIterator = _SplayTreeValueIterator$(dart.dynamic, dart.dynamic);
   let _SplayTreeNodeIterator$ = dart.generic(function(K) {
     class _SplayTreeNodeIterator extends _SplayTreeIterator$(_SplayTreeNode$(K)) {
       _SplayTreeNodeIterator(tree) {
         super._SplayTreeIterator(tree);
       }
-      _SplayTreeNodeIterator$startAt(tree, startKey) {
-        super._SplayTreeIterator$startAt(tree, startKey);
+      startAt(tree, startKey) {
+        super.startAt(tree, startKey);
       }
       [_getValue](node) {
         return dart.as(node, _SplayTreeNode$(K));
       }
     }
     dart.defineNamedConstructor(_SplayTreeNodeIterator, 'startAt');
     return _SplayTreeNodeIterator;
   });
   let _SplayTreeNodeIterator = _SplayTreeNodeIterator$(dart.dynamic);
   let _clone = Symbol('_clone');
   let _copyNode = Symbol('_copyNode');
   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 ? core.Comparable.compare : compare, core.Comparator);
         this[_validKey] = dart.as(isValidKey !== null ? isValidKey : (v) => dart.is(v, E), _Predicate);
         super._SplayTree();
       }
-      SplayTreeSet$from(elements, compare, isValidKey) {
+      from(elements, compare, isValidKey) {
         if (compare === void 0)
           compare = null;
         if (isValidKey === void 0)
           isValidKey = null;
         let result = new SplayTreeSet(compare, isValidKey);
         for (let element of elements) {
           result.add(element);
         }
         return result;
       }
@@ skipping 1732 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 = {}));