74     unordered_map<KEY, unordered_set<VAL>> mMap;  variable
85             mMap.erase(iter);  in trimOrRemove()
92     inline LocUnorderedSetMap(size_t size) : mMap(size) {}  in LocUnorderedSetMap()
94     inline bool empty() { return mMap.empty(); }  in empty()
99         auto entry = mMap.find(key);  in getValSetPtr()
100         return (entry != mMap.end()) ? &(entry->second) : nullptr;  in getValSetPtr()
106         auto entry = mMap.find(key);  in getValSet()
107         return (entry != mMap.end()) ? entry->second : unordered_set<VAL>(0);  in getValSet()
113         for (auto entry : mMap) {  in getKeys()
120         return mMap.erase(key) > 0;  in remove()
134             auto iter = mMap.find(key);  in trimOrRemove()
135             if (iter != mMap.end() && trimOrRemove(iter, rVals, goneVals) && nullptr != goneKeys) {  in trimOrRemove()
146             auto iter = mMap.find(key);  in add()
147             if (iter != mMap.end()) {  in add()
150                 mMap[key] = newVals;  in add()
180             mMap.erase(key);  in update()
182             auto curVals = mMap[key];  in update()
183             mMap[key] = newVals;  in update()