| Index: runtime/platform/hashmap.cc
|
| diff --git a/runtime/platform/hashmap.cc b/runtime/platform/hashmap.cc
|
| index 4d4b4774dd362a8e3c866f00c49c9abb6de84678..4a18cb211ca7ded120828c462c3bacf7019b6d88 100644
|
| --- a/runtime/platform/hashmap.cc
|
| +++ b/runtime/platform/hashmap.cc
|
| @@ -110,23 +110,6 @@ void HashMap::Remove(void* key, uint32_t hash) {
|
| }
|
|
|
|
|
| -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();
|
|
|