VM: Remove unused (and incomplete) HashMap::Remove() function

runtime/platform/hashmap.cc

 // Copyright (c) 2012, 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.
 
 #include "platform/hashmap.h"
 
 #include "platform/utils.h"
 
 namespace dart {
 
@@ skipping 92 matching lines @@
       candidate = next;
     }
   }
 
   // Clear the candidate which will not break searching the hash table.
   candidate->key = NULL;
   occupancy_--;
 }
 
 
-HashMap::Entry* HashMap::Remove(Entry* entry) {
-  Remove(entry->key, entry->hash);
-
-  // A key can only exist once in the map and we just removed `key`. This means
-  // that either a left-rotation has happened (in which case `entry` points
-  // already to the next element (in terms of iteration order)) or alternatively
-  // we can use the normal `Next()` call to move in iteration order.
-  if (entry->key != NULL) {
-    // A left-rotation happened. `entry` points already to the next element in
-    // iteration order.
-    return entry;
-  } else {
-    return Next(entry);
-  }
-}
-
-
 void HashMap::Clear(ClearFun clear) {
   // Mark all entries as empty.
   const Entry* end = map_end();
   for (Entry* p = map_; p < end; p++) {
     if ((clear != NULL) && (p->key != NULL)) {
       clear(p->value);
     }
     p->key = NULL;
   }
   occupancy_ = 0;
@@ skipping 61 matching lines @@
       Lookup(p->key, p->hash, true)->value = p->value;
       n--;
     }
   }
 
   // Delete old map.
   delete[] map;
 }
 
 }  // namespace dart