Lines Matching refs:Bucket
47 // Allocate one extra bucket, set it to look filled so the iterators stop at
53 /// LookupBucketFor - Look up the bucket that the specified string should end
55 /// specified bucket will be non-null. Otherwise, it will be null. In either
56 /// case, the FullHashValue field of the bucket will be set to the hash value
72 // If we found an empty bucket, this key isn't in the table yet, return it.
75 // empty bucket. This reduces probing.
103 // Okay, we didn't find the item. Probe to the next bucket.
113 /// FindKey - Look up the bucket that contains the specified key. If it exists
114 /// in the map, return the bucket number of the key. Otherwise return -1.
126 // If we found an empty bucket, this key isn't in the table yet, return.
147 // Okay, we didn't find the item. Probe to the next bucket.
168 int Bucket = FindKey(Key);
169 if (Bucket == -1) return nullptr;
171 StringMapEntryBase *Result = TheTable[Bucket];
172 TheTable[Bucket] = getTombstoneVal();
201 // Allocate one extra bucket which will always be non-empty. This allows the
212 StringMapEntryBase *Bucket = TheTable[I];
213 if (Bucket && Bucket != getTombstoneVal()) {
214 // Fast case, bucket available.
218 NewTableArray[FullHash & (NewSize-1)] = Bucket;
232 NewTableArray[NewBucket] = Bucket;
