begin(const K &Key) | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
count(const K &Key) const | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
end() | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
getAllocator() | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
getAllocator() const | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
getCurScope() | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
getCurScope() const | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
insert(const K &Key, const V &Val) | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
insertIntoScope(ScopeTy *S, const K &Key, const V &Val) | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
iterator typedef | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
lookup(const K &Key) const | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
operator=(const ScopedHashTable &)=delete | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
ScopedHashTable()=default | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
ScopedHashTable(AllocatorTy A) | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |
ScopedHashTable(const ScopedHashTable &)=delete | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
ScopedHashTableScope< K, V, KInfo, AllocatorTy > class | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | friend |
ScopeTy typedef | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
size_type typedef | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | |
~ScopedHashTable() | llvm::ScopedHashTable< K, V, KInfo, AllocatorTy > | inline |