98     inline unordered_set<VAL>* getValSetPtr(const KEY& key) {  in getValSetPtr()  argument
99         auto entry = mMap.find(key);  in getValSetPtr()
105     inline unordered_set<VAL> getValSet(const KEY& key) {  in getValSet()  argument
106         auto entry = mMap.find(key);  in getValSet()
119     inline bool remove(const KEY& key) {  in remove()  argument
120         return mMap.erase(key) > 0;  in remove()
133         for (auto key : keys) {  in trimOrRemove()  local
134             auto iter = mMap.find(key);  in trimOrRemove()
143     bool add(const KEY& key, const unordered_set<VAL>& newVals) {  in add()  argument
146             auto iter = mMap.find(key);  in add()
150                 mMap[key] = newVals;  in add()
166         for (auto key : keys) {  in add()  local
167             if (add(key, newVals) && nullptr != newKeys) {  in add()
168                 newKeys->insert(key);  in add()
176     inline unordered_set<VAL> update(const KEY& key, unordered_set<VAL>& newVals) {  in update()  argument
180             mMap.erase(key);  in update()
182             auto curVals = mMap[key];  in update()
183             mMap[key] = newVals;  in update()