| Index: runtime/platform/hashmap.h
|
| diff --git a/runtime/platform/hashmap.h b/runtime/platform/hashmap.h
|
| index 240e94d1a0f523a4c7eb17f2537507295bf588c5..be8278e909d61aa90928a9733f027c2f2907dd1e 100644
|
| --- a/runtime/platform/hashmap.h
|
| +++ b/runtime/platform/hashmap.h
|
| @@ -66,23 +66,6 @@ class HashMap {
|
| // otherwise the iteration might step over elements!
|
| void Remove(void* key, uint32_t hash);
|
|
|
| - // Removes the entry and returns the next entry (in iteration order) after
|
| - // this one.
|
| - //
|
| - // Usage instructions for removing elements during iteration:
|
| - //
|
| - // HashMap::Entry* current = map.Start();
|
| - // while (current != NULL) {
|
| - // ...
|
| - // if (condition) {
|
| - // current = map.Remove(current);
|
| - // } else {
|
| - // current = map.Next(current);
|
| - // }
|
| - // }
|
| - //
|
| - Entry* Remove(Entry* entry);
|
| -
|
| // Empties the hash map (occupancy() == 0), and calls the function 'clear' on
|
| // each of the values if given.
|
| void Clear(ClearFun clear = NULL);
|
|
|