Lines Matching full:bucket
61 // Allocate one extra bucket, set it to look filled so the iterators stop at
67 /// LookupBucketFor - Look up the bucket that the specified string should end
69 /// specified bucket will be non-null. Otherwise, it will be null. In either
70 /// case, the FullHashValue field of the bucket will be set to the hash value
86 // If we found an empty bucket, this key isn't in the table yet, return it.
89 // empty bucket. This reduces probing.
117 // Okay, we didn't find the item. Probe to the next bucket.
127 /// FindKey - Look up the bucket that contains the specified key. If it exists
128 /// in the map, return the bucket number of the key. Otherwise return -1.
140 // If we found an empty bucket, this key isn't in the table yet, return.
161 // Okay, we didn't find the item. Probe to the next bucket.
182 int Bucket = FindKey(Key);
183 if (Bucket == -1) return nullptr;
185 StringMapEntryBase *Result = TheTable[Bucket];
186 TheTable[Bucket] = getTombstoneVal();
215 // Allocate one extra bucket which will always be non-empty. This allows the
226 StringMapEntryBase *Bucket = TheTable[I];
227 if (Bucket && Bucket != getTombstoneVal()) {
228 // Fast case, bucket available.
232 NewTableArray[FullHash & (NewSize-1)] = Bucket;
246 NewTableArray[NewBucket] = Bucket;
