Lines Matching refs:capacity
39 // The default capacity. This is used by the call sites which want
41 // default value of capacity specified by the implementation.
46 explicit TemplateHashMapImpl(uint32_t capacity = kDefaultHashMapCapacity,
106 impl_.allocator().DeleteArray(impl_.map_, capacity());
113 // The capacity of the table. The implementation
115 // the table capacity.
116 uint32_t capacity() const { return impl_.capacity_; }
132 void Initialize(uint32_t capacity);
198 impl_.capacity_ = original->capacity();
200 impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity());
201 memcpy(impl_.map_, original->impl_.map_, capacity() * sizeof(Entry));
208 if (impl_.map_) impl_.allocator().DeleteArray(impl_.map_, capacity());
289 DCHECK(occupancy() < capacity());
308 Entry* r = impl_.map_ + (q->hash & (capacity() - 1));
329 for (size_t i = 0; i < capacity(); ++i) {
363 DCHECK(base::bits::IsPowerOfTwo(capacity()));
364 size_t i = hash & (capacity() - 1);
365 DCHECK(i < capacity());
367 DCHECK(occupancy() < capacity()); // Guarantees loop termination.
371 i = (i + 1) & (capacity() - 1);
388 if (occupancy() + occupancy() / 4 >= capacity()) {
399 uint32_t capacity) {
400 DCHECK(base::bits::IsPowerOfTwo(capacity));
401 impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity);
406 impl_.capacity_ = capacity;
414 uint32_t old_capacity = capacity();
418 Initialize(capacity() * 2);
464 MatchFun match, uint32_t capacity = Base::kDefaultHashMapCapacity,
466 : Base(capacity, HashEqualityThenKeyMatcher<void*, MatchFun>(match),
502 uint32_t capacity = Base::kDefaultHashMapCapacity,
504 : Base(capacity, KeyEqualityMatcher<void*>(), allocator) {}