79   uint32_t capacity() const { return capacity_; }  in capacity()
94   uint32_t capacity_;  variable
100   Entry* map_end() const { return map_ + capacity_; }  in map_end()
192   DCHECK(occupancy_ < capacity_);  in Remove()
211     Entry* r = map_ + (q->hash & (capacity_ - 1));  in Remove()
232   for (size_t i = 0; i < capacity_; ++i) {  in Clear()
265   DCHECK(base::bits::IsPowerOfTwo32(capacity_));  in Probe()
266   size_t i = hash & (capacity_ - 1);  in Probe()
267   DCHECK(i < capacity_);  in Probe()
269   DCHECK(occupancy_ < capacity_);  // Guarantees loop termination.  in Probe()
271     i = (i + 1) & (capacity_ - 1);  in Probe()
289   if (occupancy_ + occupancy_ / 4 >= capacity_) {  in FillEmptyEntry()
307   capacity_ = capacity;  in Initialize()
319   Initialize(capacity_ * 2, allocator);  in Resize()