Lines Matching defs:TheBucket

227     BucketT *TheBucket;
228     if (LookupBucketFor(Key, TheBucket))
229       return std::make_pair(makeIterator(TheBucket,
237     TheBucket =
238         InsertIntoBucket(TheBucket, std::move(Key), std::forward<Ts>(Args)...);
239     return std::make_pair(makeIterator(TheBucket,
252     BucketT *TheBucket;
253     if (LookupBucketFor(Key, TheBucket))
254       return std::make_pair(makeIterator(TheBucket,
262     TheBucket = InsertIntoBucket(TheBucket, Key, std::forward<Ts>(Args)...);
263     return std::make_pair(makeIterator(TheBucket,
279     BucketT *TheBucket;
280     if (LookupBucketFor(Val, TheBucket))
281       return std::make_pair(makeIterator(TheBucket,
289     TheBucket = InsertIntoBucketWithLookup(TheBucket, std::move(KV.first),
291     return std::make_pair(makeIterator(TheBucket,
322     BucketT *TheBucket = doFind(Val);
323     if (!TheBucket)
326     TheBucket->getSecond().~ValueT();
327     TheBucket->getFirst() = getTombstoneKey();
333     BucketT *TheBucket = &*I;
334     TheBucket->getSecond().~ValueT();
335     TheBucket->getFirst() = getTombstoneKey();
341     BucketT *TheBucket;
342     if (LookupBucketFor(Key, TheBucket))
343       return TheBucket->second;
345     return InsertIntoBucket(TheBucket, Key)->second;
349     BucketT *TheBucket;
350     if (LookupBucketFor(Key, TheBucket))
351       return TheBucket->second;
353     return InsertIntoBucket(TheBucket, std::move(Key))->second;
541   BucketT *InsertIntoBucket(BucketT *TheBucket, KeyArg &&Key,
543     TheBucket = InsertIntoBucketImpl(Key, TheBucket);
545     TheBucket->getFirst() = std::forward<KeyArg>(Key);
546     ::new (&TheBucket->getSecond()) ValueT(std::forward<ValueArgs>(Values)...);
547     return TheBucket;
551   BucketT *InsertIntoBucketWithLookup(BucketT *TheBucket, KeyT &&Key,
553     TheBucket = InsertIntoBucketImpl(Lookup, TheBucket);
555     TheBucket->getFirst() = std::move(Key);
556     ::new (&TheBucket->getSecond()) ValueT(std::move(Value));
557     return TheBucket;
561   BucketT *InsertIntoBucketImpl(const LookupKeyT &Lookup, BucketT *TheBucket) {
577       LookupBucketFor(Lookup, TheBucket);
583       LookupBucketFor(Lookup, TheBucket);
585     assert(TheBucket);
593     if (!KeyInfoT::isEqual(TheBucket->getFirst(), EmptyKey))
596     return TheBucket;