Rename Cell properties to avoid name clashes in type inference.

sdk/lib/_internal/compiler/js_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 file for dart:collection classes.
 import 'dart:_foreign_helper' show JS;
 import 'dart:_js_helper' show
     fillLiteralMap, InternalMap, NoInline, NoThrows, patch, JsLinkedHashMap,
     LinkedHashMapCell, LinkedHashMapKeyIterable, LinkedHashMapKeyIterator;
 
@@ skipping 526 matching lines @@
     // issues with problematic keys like '__proto__'. Another option
     // would be to throw an exception if the hash code isn't a number.
     return JS('int', '# & 0x3ffffff', identityHashCode(key));
   }
 
   int internalFindBucketIndex(var bucket, var key) {
     if (bucket == null) return -1;
     int length = JS('int', '#.length', bucket);
     for (int i = 0; i < length; i++) {
       LinkedHashMapCell cell = JS('var', '#[#]', bucket, i);
-      if (identical(cell.key, key)) return i;
+      if (identical(cell.hashMapCellKey, key)) return i;
     }
     return -1;
   }
 }
 
 class _LinkedCustomHashMap<K, V> extends JsLinkedHashMap<K, V> {
   final _Equality<K> _equals;
   final _Hasher<K> _hashCode;
   final _Predicate _validKey;
   _LinkedCustomHashMap(this._equals, this._hashCode,
@@ skipping 24 matching lines @@
     // issues with problematic keys like '__proto__'. Another option
     // would be to throw an exception if the hash code isn't a number.
     return JS('int', '# & 0x3ffffff', _hashCode(key));
   }
 
   int internalFindBucketIndex(var bucket, var key) {
     if (bucket == null) return -1;
     int length = JS('int', '#.length', bucket);
     for (int i = 0; i < length; i++) {
       LinkedHashMapCell cell = JS('var', '#[#]', bucket, i);
-      if (_equals(cell.key, key)) return i;
+      if (_equals(cell.hashMapCellKey, key)) return i;
     }
     return -1;
   }
 }
 
 @patch
 class HashSet<E> {
   @patch
   factory HashSet({ bool equals(E e1, E e2),
                     int hashCode(E e),
@@ skipping 855 matching lines @@
     } else if (_cell == null) {
       _current = null;
       return false;
     } else {
       _current = _cell._element;
       _cell = _cell._next;
       return true;
     }
   }
 }