reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
24 struct DeclMapInfo;
69 using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>; 71 DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>; 336 if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) && 337 !KeyInfoT::isEqual(P->getFirst(), TombstoneKey)) 372 if (!KeyInfoT::isEqual(B->getFirst(), EmptyKey) && 373 !KeyInfoT::isEqual(B->getFirst(), TombstoneKey)) { 392 const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) { 415 return KeyInfoT::getHashValue(Val); 420 return KeyInfoT::getHashValue(Val); 426 return KeyInfoT::getEmptyKey(); 430 return KeyInfoT::getTombstoneKey(); 567 if (!KeyInfoT::isEqual(TheBucket->getFirst(), EmptyKey)) 617 if (KeyInfoT::isEqual(ThisBucket->getFirst(), TombstoneKey) && 684 class DenseMap : public DenseMapBase<DenseMap<KeyT, ValueT, KeyInfoT, BucketT>, 685 KeyT, ValueT, KeyInfoT, BucketT> { 690 using BaseT = DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT, BucketT>; 1163 using ConstIterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>; 1199 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) 1249 const KeyT Empty = KeyInfoT::getEmptyKey(); 1250 const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 1252 while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) || 1253 KeyInfoT::isEqual(Ptr->getFirst(), Tombstone))) 1259 const KeyT Empty = KeyInfoT::getEmptyKey(); 1260 const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 1262 while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) || 1263 KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))include/llvm/ADT/DenseSet.h
250 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 252 ValueInfoT> { 255 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 257 ValueInfoT>;tools/dsymutil/DeclContext.h
76 using Map = DenseSet<DeclContext *, DeclMapInfo>;