Allow Object when doing lookups.

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> {
   final _HashMapTable<K, V> _hashTable = new _HashMapTable<K, V>();
 
   /* patch */ HashMap() {
     _hashTable._container = this;
   }
 
-  /* patch */ bool containsKey(K key) {
+  /* patch */ bool containsKey(Object key) {
     return _hashTable._get(key) >= 0;
   }
 
-  /* patch */ bool containsValue(V value) {
+  /* patch */ bool containsValue(Object value) {
     List table = _hashTable._table;
     int entrySize = _hashTable._entrySize;
     for (int offset = 0; offset < table.length; offset += entrySize) {
       if (!_hashTable._isFree(table[offset]) &&
           _hashTable._value(offset) == value) {
         return true;
       }
     }
     return false;
   }
 
   /* patch */ void addAll(Map<K, V> other) {
     other.forEach((K key, V value) {
       int offset = _hashTable._put(key);
       _hashTable._setValue(offset, value);
       _hashTable._checkCapacity();
     });
   }
 
-  /* patch */ V operator [](K key) {
+  /* patch */ V operator [](Object key) {
     int offset = _hashTable._get(key);
     if (offset >= 0) return _hashTable._value(offset);
     return null;
   }
 
   /* patch */ void operator []=(K key, V value) {
     int offset = _hashTable._put(key);
     _hashTable._setValue(offset, value);
     _hashTable._checkCapacity();
   }
@@ skipping 20 matching lines @@
     } else {
       // The table might have changed, so we can't trust [offset] any more.
       // Do another lookup before setting the value.
       offset = _hashTable._put(key);
       _hashTable._setValue(offset, value);
       _hashTable._checkCapacity();
     }
     return value;
   }
 
-  /* patch */ V remove(K key) {
+  /* patch */ V remove(Object key) {
     int offset = _hashTable._remove(key);
     if (offset < 0) return null;
     V oldValue = _hashTable._value(offset);
     _hashTable._setValue(offset, null);
     _hashTable._checkCapacity();
     return oldValue;
   }
 
   /* patch */ void clear() {
     _hashTable._clear();
@@ skipping 108 matching lines @@
 /**
  * A hash-based map that iterates keys and values in key insertion order.
  */
 patch class LinkedHashMap<K, V> {
   final _LinkedHashMapTable _hashTable;
 
   /* patch */ LinkedHashMap() : _hashTable = new _LinkedHashMapTable<K, V>() {
     _hashTable._container = this;
   }
 
-  /* patch */ bool containsKey(K key) {
+  /* patch */ bool containsKey(Object key) {
     return _hashTable._get(key) >= 0;
   }
 
-  /* patch */ bool containsValue(V value) {
+  /* patch */ bool containsValue(Object value) {
     int modificationCount = _hashTable._modificationCount;
     for (int offset = _hashTable._next(_LinkedHashTable._HEAD_OFFSET);
          offset != _LinkedHashTable._HEAD_OFFSET;
          offset = _hashTable._next(offset)) {
       if (_hashTable._value(offset) == value) {
         return true;
       }
       // The == call may modify the table.
       _hashTable._checkModification(modificationCount);
     }
     return false;
   }
 
   /* patch */ void addAll(Map<K, V> other) {
     other.forEach((K key, V value) {
       int offset = _hashTable._put(key);
       _hashTable._setValue(offset, value);
       _hashTable._checkCapacity();
     });
   }
 
-  /* patch */ V operator [](K key) {
+  /* patch */ V operator [](Object key) {
     int offset = _hashTable._get(key);
     if (offset >= 0) return _hashTable._value(offset);
     return null;
   }
 
   /* patch */ void operator []=(K key, V value) {
     int offset = _hashTable._put(key);
     _hashTable._setValue(offset, value);
     _hashTable._checkCapacity();
   }
@@ skipping 21 matching lines @@
     } else {
       // The table might have changed, so we can't trust [offset] any more.
       // Do another lookup before setting the value.
       offset = _hashTable._put(key);
       _hashTable._setValue(offset, value);
       _hashTable._checkCapacity();
     }
     return value;
   }
 
-  /* patch */ V remove(K key) {
+  /* patch */ V remove(Object key) {
     int offset = _hashTable._remove(key);
     if (offset < 0) return null;
     Object oldValue = _hashTable._value(offset);
     _hashTable._setValue(offset, null);
     _hashTable._checkCapacity();
     return oldValue;
   }
 
   /* patch */ void clear() {
     _hashTable._clear();
@@ skipping 352 matching lines @@
    */
   void _copyEntry(List fromTable, int fromOffset, int toOffset) {}
 
   // The following three methods are for simple get/set/remove operations.
   // They only affect the key of an entry. The remaining fields must be
   // filled by the caller.
 
   /**
    * Returns the offset of a key in [_table], or negative if it's not there.
    */
-  int _get(K key) {
+  int _get(Object key) {
     return _probeForLookup(_hashCodeOf(key), key);
   }
 
   /**
    * Puts the key into the table and returns its offset into [_table].
    *
    * If [_entrySize] is greater than 1, the caller should fill the
    * remaining fields.
    *
    * Remember to call [_checkCapacity] after using this method.
@@ skipping 13 matching lines @@
     return offset;
   }
 
   /**
    * Removes a key from the table and returns its offset into [_table].
    *
    * Returns null if the key was not in the table.
    * If [_entrySize] is greater than 1, the caller should clean up the
    * remaining fields.
    */
-  int _remove(K key) {
+  int _remove(Object key) {
     int offset = _probeForLookup(_hashCodeOf(key), key);
     if (offset >= 0) {
       _deleteEntry(offset);
     }
     return offset;
   }
 
   /** Clears the table completely, leaving it empty. */
   void _clear() {
     if (_elementCount == 0) return;
@@ skipping 309 matching lines @@
 
   _LinkedHashMapTable() : super(_INITIAL_CAPACITY);
 
   V _value(int offset) => _table[offset + _VALUE_INDEX];
   void _setValue(int offset, V value) { _table[offset + _VALUE_INDEX] = value; }
 
   _copyEntry(List oldTable, int fromOffset, int toOffset) {
     _table[toOffset + _VALUE_INDEX] = oldTable[fromOffset + _VALUE_INDEX];
   }
 }