llvm/ADT/ScopedHashTable.h

13 //  ScopedHashTable<int, int> HT;
15 //    ScopedHashTableScope<int, int> Scope1(HT);
16 //    HT.insert(0, 0);
17 //    HT.insert(1, 1);
19 //      ScopedHashTableScope<int, int> Scope2(HT);
20 //      HT.insert(0, 42);
86   /// HT - The hashtable that we are active for.
87   ScopedHashTable<K, V, KInfo, AllocatorTy> &HT;
89   /// PrevScope - This is the scope that we are shadowing in HT.
97   ScopedHashTableScope(ScopedHashTable<K, V, KInfo, AllocatorTy> &HT);
228   ScopedHashTableScope(ScopedHashTable<K, V, KInfo, Allocator> &ht) : HT(ht) {
229   PrevScope = HT.CurScope;
230   HT.CurScope = this;
236   assert(HT.CurScope == this && "Scope imbalance!");
237   HT.CurScope = PrevScope;
243       assert(HT.TopLevelMap[ThisEntry->getKey()] == ThisEntry &&
245       HT.TopLevelMap.erase(ThisEntry->getKey());
247       ScopedHashTableVal<K, V> *&KeyEntry = HT.TopLevelMap[ThisEntry->getKey()];
256     ThisEntry->Destroy(HT.getAllocator());