Lines Matching defs:capacity_
29 DeletePointerArray(reinterpret_cast<uintptr_t*>(keys_), capacity_);
30 DeletePointerArray(values_, capacity_);
35 capacity_ = 0;
53 for (int index = start; index < capacity_; index++) {
69 if (size_ + size_ / 4 >= capacity_) {
70 Resize(capacity_ * kResizeFactor);
76 // Guaranteed to terminate since size_ < capacity_, there must be at least
83 DCHECK_LE(size_, capacity_);
102 if (capacity_ > kInitialIdentityMapSize &&
103 size_ * kResizeFactor < capacity_ / kResizeFactor) {
104 Resize(capacity_ / kResizeFactor);
172 if (capacity_ == 0) {
196 if (capacity_ == 0) {
198 capacity_ = kInitialIdentityMapSize;
202 keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
204 for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
205 values_ = NewPointerArray(capacity_);
206 memset(values_, 0, sizeof(uintptr_t) * capacity_);
210 FullObjectSlot(keys_ + capacity_));
236 DCHECK_LT(index, capacity_);
244 DCHECK_LT(index, capacity_);
252 DCHECK_LE(index, capacity_);
255 for (++index; index < capacity_; ++index) {
260 return capacity_;
273 for (int i = 0; i < capacity_; i++) {
300 int old_capacity = capacity_;
304 capacity_ = new_capacity;
305 mask_ = capacity_ - 1;
309 keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
311 for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
312 values_ = NewPointerArray(capacity_);
313 memset(values_, 0, sizeof(uintptr_t) * capacity_);
325 FullObjectSlot(keys_ + capacity_));