83     capacity_ = 0;  in Invalidate()
92   uint32_t capacity() const { return capacity_; }  in capacity()
106     Initialize(capacity_, allocator);  in Reset()
115   uint32_t capacity_;  variable
121   Entry* map_end() const { return map_ + capacity_; }  in map_end()
145     : capacity_(original->capacity_),  in TemplateHashMapImpl()
148   map_ = reinterpret_cast<Entry*>(allocator.New(capacity_ * sizeof(Entry)));  in TemplateHashMapImpl()
149   memcpy(map_, original->map_, capacity_ * sizeof(Entry));  in TemplateHashMapImpl()
227   DCHECK(occupancy_ < capacity_);  in Remove()
246     Entry* r = map_ + (q->hash & (capacity_ - 1));  in Remove()
267   for (size_t i = 0; i < capacity_; ++i) {  in Clear()
300   DCHECK(base::bits::IsPowerOfTwo32(capacity_));  in Probe()
301   size_t i = hash & (capacity_ - 1);  in Probe()
302   DCHECK(i < capacity_);  in Probe()
304   DCHECK(occupancy_ < capacity_);  // Guarantees loop termination.  in Probe()
306     i = (i + 1) & (capacity_ - 1);  in Probe()
324   if (occupancy_ + occupancy_ / 4 >= capacity_) {  in FillEmptyEntry()
342   capacity_ = capacity;  in Initialize()
354   Initialize(capacity_ * 2, allocator);  in Resize()