143     bool add(const KEY& key, const unordered_set<VAL>& newVals) {  in add()  argument
145         if (!newVals.empty()) {  in add()
148                 iter->second.insert(newVals.begin(), newVals.end());  in add()
150                 mMap[key] = newVals;  in add()
160     inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>&& newVals,  in add()  argument
162         add(keys, newVals, newKeys);  in add()
164     inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>& newVals,  in add()  argument
167             if (add(key, newVals) && nullptr != newKeys) {  in add()
176     inline unordered_set<VAL> update(const KEY& key, unordered_set<VAL>& newVals) {  in update()  argument
179         if (newVals.empty()) {  in update()
183             mMap[key] = newVals;  in update()
184             goneVals = removeAndReturnInterset(curVals, newVals);  in update()