| 202 | } |
| 203 | |
| 204 | inline void HashTable::NextFilledBucket(int64_t* bucket_idx, DuplicateNode** node) { |
| 205 | ++*bucket_idx; |
| 206 | for (; *bucket_idx < num_buckets_; ++*bucket_idx) { |
| 207 | if (buckets_[*bucket_idx].IsFilled()) { |
| 208 | *node = stores_duplicates() ? buckets_[*bucket_idx].GetDuplicate() : NULL; |
| 209 | return; |
| 210 | } |
| 211 | } |
| 212 | // Reached the end of the hash table. |
| 213 | *bucket_idx = Iterator::BUCKET_NOT_FOUND; |
| 214 | *node = NULL; |
| 215 | } |
| 216 | |
| 217 | inline void HashTable::PrepareBucketForInsert(int64_t bucket_idx, uint32_t hash) { |
| 218 | DCHECK_GE(bucket_idx, 0); |
no test coverage detected