Update status

sdk/lib/_internal/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, NoInline;
 
 patch class HashMap<K, V> {
   patch factory HashMap({ bool equals(K key1, K key2),
@@ skipping 594 matching lines @@
     } else if (_isNumericKey(key)) {
       var nums = _nums;
       if (nums == null) return null;
       LinkedHashMapCell cell = _getTableEntry(nums, key);
       return (cell == null) ? null : cell._value;
     } else {
       return _get(key);
     }
   }
 
-  V _get(K key) {
+  V _get(Object key) {
     var rest = _rest;
     if (rest == null) return null;
     var bucket = _getBucket(rest, key);
     int index = _findBucketIndex(bucket, key);
     if (index < 0) return null;
     LinkedHashMapCell cell = JS('var', '#[#]', bucket, index);
     return cell._value;
   }
 
   void operator[]=(K key, V value) {
@@ skipping 477 matching lines @@
   bool remove(Object object) {
     if (_isStringElement(object)) {
       return _removeHashTableEntry(_strings, object);
     } else if (_isNumericElement(object)) {
       return _removeHashTableEntry(_nums, object);
     } else {
       return _remove(object);
     }
   }
 
-  bool _remove(object) {
+  bool _remove(Object object) {
     var rest = _rest;
     if (rest == null) return false;
     var bucket = _getBucket(rest, object);
     int index = _findBucketIndex(bucket, object);
     if (index < 0) return false;
     // TODO(kasperl): Consider getting rid of the bucket list when
     // the length reaches zero.
     _length--;
     _elements = null;
     // TODO(kasperl): It would probably be faster to move the
@@ skipping 749 matching lines @@
     } else if (_cell == null) {
       _current = null;
       return false;
     } else {
       _current = _cell._element;
       _cell = _cell._next;
       return true;
     }
   }
 }