| Index: src/hashmap.h
|
| diff --git a/src/hashmap.h b/src/hashmap.h
|
| index b92c71573f8f7e9f2ebbbbf5483ad0079768caae..3b947beb5388673f9d2e7c6cfe6b226db807e351 100644
|
| --- a/src/hashmap.h
|
| +++ b/src/hashmap.h
|
| @@ -83,12 +83,12 @@ class HashMap {
|
| void Clear();
|
|
|
| // The number of (non-empty) entries in the table.
|
| - uint32_t occupancy() const { return occupancy_; }
|
| + uint32_t occupancy() const { return occupancy_; }
|
|
|
| // The capacity of the table. The implementation
|
| // makes sure that occupancy is at most 80% of
|
| // the table capacity.
|
| - uint32_t capacity() const { return capacity_; }
|
| + uint32_t capacity() const { return capacity_; }
|
|
|
| // Iteration
|
| //
|
| @@ -108,7 +108,7 @@ class HashMap {
|
| uint32_t capacity_;
|
| uint32_t occupancy_;
|
|
|
| - Entry* map_end() const { return map_ + capacity_; }
|
| + Entry* map_end() const { return map_ + capacity_; }
|
| Entry* Probe(void* key, uint32_t hash);
|
| void Initialize(uint32_t capacity);
|
| void Resize();
|
|
|