Lines Matching refs:Bucket
44 // Allocate one extra bucket, set it to look filled so the iterators stop at
50 /// LookupBucketFor - Look up the bucket that the specified string should end
52 /// specified bucket will be non-null. Otherwise, it will be null. In either
53 /// case, the FullHashValue field of the bucket will be set to the hash value
67 ItemBucket &Bucket = TheTable[BucketNo];
68 StringMapEntryBase *BucketItem = Bucket.Item;
69 // If we found an empty bucket, this key isn't in the table yet, return it.
72 // empty bucket. This reduces probing.
78 Bucket.FullHashValue = FullHashValue;
85 } else if (Bucket.FullHashValue == FullHashValue) {
100 // Okay, we didn't find the item. Probe to the next bucket.
110 /// FindKey - Look up the bucket that contains the specified key. If it exists
111 /// in the map, return the bucket number of the key. Otherwise return -1.
121 ItemBucket &Bucket = TheTable[BucketNo];
122 StringMapEntryBase *BucketItem = Bucket.Item;
123 // If we found an empty bucket, this key isn't in the table yet, return.
129 } else if (Bucket.FullHashValue == FullHashValue) {
144 // Okay, we didn't find the item. Probe to the next bucket.
165 int Bucket = FindKey(Key);
166 if (Bucket == -1) return 0;
168 StringMapEntryBase *Result = TheTable[Bucket].Item;
169 TheTable[Bucket].Item = getTombstoneVal();
195 // Allocate one extra bucket which will always be non-empty. This allows the
204 // Fast case, bucket available.
