LLVM API Documentation
#include <ScopedHashTable.h>
Public Types | |
typedef ScopedHashTableScope < K, V, KInfo, AllocatorTy > | ScopeTy |
typedef unsigned | size_type |
typedef ScopedHashTableIterator< K, V, KInfo > | iterator |
Public Member Functions | |
ScopedHashTable () | |
ScopedHashTable (AllocatorTy A) | |
~ScopedHashTable () | |
AllocatorTy & | getAllocator () |
Access to the allocator. | |
const AllocatorTy & | getAllocator () const |
size_type | count (const K &Key) const |
Return 1 if the specified key is in the table, 0 otherwise. | |
V | lookup (const K &Key) |
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) |
Friends | |
class | ScopedHashTableScope< K, V, KInfo, AllocatorTy > |
Definition at line 146 of file ScopedHashTable.h.
typedef ScopedHashTableIterator<K, V, KInfo> llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::iterator |
Definition at line 191 of file ScopedHashTable.h.
typedef ScopedHashTableScope<K, V, KInfo, AllocatorTy> llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::ScopeTy |
ScopeTy - This is a helpful typedef that allows clients to get easy access to the name of the scope for this hash table.
Definition at line 150 of file ScopedHashTable.h.
typedef unsigned llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::size_type |
Definition at line 151 of file ScopedHashTable.h.
llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::ScopedHashTable | ( | ) | [inline] |
Definition at line 163 of file ScopedHashTable.h.
llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::ScopedHashTable | ( | AllocatorTy | A | ) | [inline] |
Definition at line 164 of file ScopedHashTable.h.
llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::~ScopedHashTable | ( | ) | [inline] |
Definition at line 165 of file ScopedHashTable.h.
References llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::empty().
iterator llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::begin | ( | const K & | Key | ) | [inline] |
Definition at line 195 of file ScopedHashTable.h.
References llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::end(), llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::end(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::find(), and I.
size_type llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::count | ( | const K & | Key | ) | const [inline] |
Return 1 if the specified key is in the table, 0 otherwise.
Definition at line 175 of file ScopedHashTable.h.
References llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::count().
iterator llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::end | ( | ) | [inline] |
Definition at line 193 of file ScopedHashTable.h.
Referenced by llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::begin().
AllocatorTy& llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::getAllocator | ( | ) | [inline] |
Access to the allocator.
Definition at line 171 of file ScopedHashTable.h.
const AllocatorTy& llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::getAllocator | ( | ) | const [inline] |
Definition at line 172 of file ScopedHashTable.h.
ScopeTy* llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::getCurScope | ( | ) | [inline] |
Definition at line 202 of file ScopedHashTable.h.
const ScopeTy* llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::getCurScope | ( | ) | const [inline] |
Definition at line 203 of file ScopedHashTable.h.
void llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::insert | ( | const K & | Key, |
const V & | Val | ||
) | [inline] |
Definition at line 187 of file ScopedHashTable.h.
References llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::insertIntoScope().
void llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::insertIntoScope | ( | ScopeTy * | S, |
const K & | Key, | ||
const V & | Val | ||
) | [inline] |
insertIntoScope - This inserts the specified key/value at the specified (possibly not the current) scope. While it is ok to insert into a scope that isn't the current one, it isn't ok to insert *underneath* an existing value of the specified key.
Definition at line 209 of file ScopedHashTable.h.
References llvm::ScopedHashTableVal< K, V >::Create().
Referenced by llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::insert().
V llvm::ScopedHashTable< K, V, KInfo, AllocatorTy >::lookup | ( | const K & | Key | ) | [inline] |
Definition at line 179 of file ScopedHashTable.h.
References llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::end(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::find(), and I.
friend class ScopedHashTableScope< K, V, KInfo, AllocatorTy > [friend] |
Definition at line 161 of file ScopedHashTable.h.