Version 0.8.10.4

dart/runtime/lib/collection_patch.dart

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 patch class HashMap<K, V> {
   /* patch */ factory HashMap({ bool equals(K key1, K key2),
                                 int hashCode(K key),
                                 bool isValidKey(potentialKey) }) {
     if (isValidKey == null) {
       if (hashCode == null) {
@@ skipping 544 matching lines @@
   Iterator<E> get iterator => new _HashSetIterator<E>(this);
 
   int get length => _elementCount;
 
   bool get isEmpty => _elementCount == 0;
 
   bool get isNotEmpty => _elementCount != 0;
 
   bool contains(Object object) {
     int index = _hashCode(object) & (_buckets.length - 1);
-    HashSetEntry entry = _buckets[index];
+    _HashSetEntry entry = _buckets[index];
     while (entry != null) {
       if (_equals(entry.key, object)) return true;
       entry = entry.next;
     }
     return false;
   }
 
   E lookup(Object object) {
     int index = _hashCode(object) & (_buckets.length - 1);
-    HashSetEntry entry = _buckets[index];
+    _HashSetEntry entry = _buckets[index];
     while (entry != null) {
       var key = entry.key;
       if (_equals(key, object)) return key;
       entry = entry.next;
     }
     return null;
   }
 
   // Set.
 
   bool add(E element) {
     int hashCode = _hashCode(element);
     int index = hashCode & (_buckets.length - 1);
-    HashSetEntry entry = _buckets[index];
+    _HashSetEntry entry = _buckets[index];
     while (entry != null) {
       if (_equals(entry.key, element)) return false;
       entry = entry.next;
     }
     _addEntry(element, hashCode, index);
     return true;
   }
 
   void addAll(Iterable<E> objects) {
     int ctr = 0;
@@ skipping 34 matching lines @@
     }
   }
 
   void retainAll(Iterable<Object> objectsToRetain) {
     super._retainAll(objectsToRetain, (o) => o is E);
   }
 
   void _filterWhere(bool test(E element), bool removeMatching) {
     int length = _buckets.length;
     for (int index =  0; index < length; index++) {
-      HashSetEntry entry = _buckets[index];
-      HashSetEntry previous = null;
+      _HashSetEntry entry = _buckets[index];
+      _HashSetEntry previous = null;
       while (entry != null) {
         int modificationCount = _modificationCount;
         bool testResult = test(entry.key);
         if (modificationCount != _modificationCount) {
           throw new ConcurrentModificationError(this);
         }
         if (testResult == removeMatching) {
-          HashSetEntry next = entry.remove();
+          _HashSetEntry next = entry.remove();
           if (previous == null) {
             _buckets[index] = next;
           } else {
             previous.next = next;
           }
           _elementCount--;
           _modificationCount =
               (_modificationCount + 1) & _MODIFICATION_COUNT_MASK;
           entry = next;
         } else {
@@ skipping 589 matching lines @@
       return false;
     }
     _LinkedHashSetEntry entry = _next;
     _current = entry.key;
     _next = entry._nextEntry;
     return true;
   }
 
   E get current => _current;
 }