reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
67 using value_type = BucketT; 69 using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>; 71 DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>; 125 for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) 129 for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) { 146 const BucketT *TheBucket; 151 BucketT *TheBucket; 157 const BucketT *TheBucket; 170 BucketT *TheBucket; 177 const BucketT *TheBucket; 186 const BucketT *TheBucket; 211 BucketT *TheBucket; 230 BucketT *TheBucket; 251 BucketT *TheBucket; 273 BucketT *TheBucket; 284 BucketT *TheBucket = &*I; 292 BucketT *TheBucket; 304 BucketT *TheBucket; 335 for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) { 350 for (BucketT *B = getBuckets(), *E = getBucketsEnd(); B != E; ++B) 365 void moveFromOldBuckets(BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) { 365 void moveFromOldBuckets(BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) { 371 for (BucketT *B = OldBucketsBegin, *E = OldBucketsEnd; B != E; ++B) { 375 BucketT *DestBucket; 392 const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) { 402 getNumBuckets() * sizeof(BucketT)); 434 iterator makeIterator(BucketT *P, BucketT *E, 434 iterator makeIterator(BucketT *P, BucketT *E, 438 BucketT *B = P == getBucketsEnd() ? getBuckets() : P + 1; 444 const_iterator makeConstIterator(const BucketT *P, const BucketT *E, 444 const_iterator makeConstIterator(const BucketT *P, const BucketT *E, 448 const BucketT *B = P == getBucketsEnd() ? getBuckets() : P + 1; 486 const BucketT *getBuckets() const { 490 BucketT *getBuckets() { 498 BucketT *getBucketsEnd() { 502 const BucketT *getBucketsEnd() const { 515 BucketT *InsertIntoBucket(BucketT *TheBucket, KeyArg &&Key, 515 BucketT *InsertIntoBucket(BucketT *TheBucket, KeyArg &&Key, 525 BucketT *InsertIntoBucketWithLookup(BucketT *TheBucket, KeyT &&Key, 525 BucketT *InsertIntoBucketWithLookup(BucketT *TheBucket, KeyT &&Key, 535 BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup, 536 BucketT *TheBucket) { 579 const BucketT *&FoundBucket) const { 580 const BucketT *BucketsPtr = getBuckets(); 589 const BucketT *FoundTombstone = nullptr; 599 const BucketT *ThisBucket = BucketsPtr + BucketNo; 629 bool LookupBucketFor(const LookupKeyT &Val, BucketT *&FoundBucket) { 630 const BucketT *ConstFoundBucket; 643 return getNumBuckets() * sizeof(BucketT);