81     unordered_map<KEY, unordered_set<VAL>> mMap;  variable
91             mMap.erase(iter);  in trimOrRemove()
99         mMap.get_allocator().allocate(size);  in LocUnorderedSetMap()
102     inline bool empty() { return mMap.empty(); }  in empty()
107         auto entry = mMap.find(key);  in getValSetPtr()
108         return (entry != mMap.end()) ? &(entry->second) : nullptr;  in getValSetPtr()
114         auto entry = mMap.find(key);  in getValSet()
115         return (entry != mMap.end()) ? entry->second : unordered_set<VAL>{};  in getValSet()
121         for (auto entry : mMap) {  in getKeys()
128         return mMap.erase(key) > 0;  in remove()
143             auto iter = mMap.find(key);  in trimOrRemove()
144             if (iter != mMap.end() && trimOrRemove(iter, rVals, goneVals) && nullptr != goneKeys) {  in trimOrRemove()
155             auto iter = mMap.find(key);  in add()
156             if (iter != mMap.end()) {  in add()
159                 mMap[key] = newVals;  in add()
189             mMap.erase(key);  in update()
191             auto curVals = mMap[key];  in update()
192             mMap[key] = newVals;  in update()