LLVM: llvm::ScopedHashTable< K, V, KInfo, AllocatorTy (original) (raw)
#include "[llvm/ADT/ScopedHashTable.h](ScopedHashTable%5F8h%5Fsource.html)"
| Public Member Functions | |
|---|---|
| ScopedHashTable ()=default | |
| ScopedHashTable (AllocatorTy A) | |
| ScopedHashTable (const ScopedHashTable &)=delete | |
| ScopedHashTable & | operator= (const ScopedHashTable &)=delete |
| ~ScopedHashTable () | |
| size_type | count (const K &Key) const |
| Return 1 if the specified key is in the table, 0 otherwise. | |
| V | lookup (const K &Key) const |
| void | insert (const K &Key, const V &Val) |
| iterator | end () |
| iterator | begin (const K &Key) |
| ScopeTy * | getCurScope () |
| const ScopeTy * | getCurScope () const |
| void | insertIntoScope (ScopeTy *S, const K &Key, const V &Val) |
| insertIntoScope - This inserts the specified key/value at the specified (possibly not the current) scope. | |
| AllocatorTy & | getAllocator () |
| Access to the allocator. | |
| const AllocatorTy & | getAllocator () const |
| Access to the allocator. |
template<typename K, typename V, typename KInfo, typename AllocatorTy>
class llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >
Definition at line 150 of file ScopedHashTable.h.
◆ iterator
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ ScopeTy
template<typename K, typename V, typename KInfo, typename AllocatorTy>
ScopeTy - A type alias for easy access to the name of the scope for this hash table.
Definition at line 156 of file ScopedHashTable.h.
◆ size_type
template<typename K, typename V, typename KInfo, typename AllocatorTy>
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ ScopedHashTable() [2/3]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ ScopedHashTable() [3/3]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ ~ScopedHashTable()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ begin()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ count()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
Return 1 if the specified key is in the table, 0 otherwise.
Definition at line 181 of file ScopedHashTable.h.
◆ end()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ getAllocator() [1/2]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ getAllocator() [2/2]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ getCurScope() [1/2]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ getCurScope() [2/2]
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ insert()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ insertIntoScope()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ lookup()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ operator=()
template<typename K, typename V, typename KInfo, typename AllocatorTy>
◆ ScopedHashTableScope< K, V, KInfo, AllocatorTy >
template<typename K, typename V, typename KInfo, typename AllocatorTy>
The documentation for this class was generated from the following file:
- include/llvm/ADT/ScopedHashTable.h