| 215 | } |
| 216 | |
| 217 | inline void HashTable::PrepareBucketForInsert(int64_t bucket_idx, uint32_t hash) { |
| 218 | DCHECK_GE(bucket_idx, 0); |
| 219 | DCHECK_LT(bucket_idx, num_buckets_); |
| 220 | Bucket* bucket = &buckets_[bucket_idx]; |
| 221 | DCHECK(!bucket->IsFilled()); |
| 222 | ++num_filled_buckets_; |
| 223 | bucket->PrepareBucketForInsert(); |
| 224 | hash_array_[bucket_idx] = hash; |
| 225 | } |
| 226 | |
| 227 | inline HashTable::DuplicateNode* HashTable::AppendNextNode(Bucket* bucket) { |
| 228 | DCHECK_GT(node_remaining_current_page_, 0); |