72 template <typename KEY, typename VAL>
74     unordered_map<KEY, unordered_set<VAL>> mMap;
80     bool trimOrRemove(typename unordered_map<KEY, unordered_set<VAL>>::iterator iter,  in trimOrRemove()
81                       const unordered_set<VAL>& rVals, unordered_set<VAL>* goneVals) {  in trimOrRemove()
82         trimSet<VAL>(iter->second, rVals, goneVals);  in trimOrRemove()
98     inline unordered_set<VAL>* getValSetPtr(const KEY& key) {  in getValSetPtr()
105     inline unordered_set<VAL> getValSet(const KEY& key) {  in getValSet()
107         return (entry != mMap.end()) ? entry->second : unordered_set<VAL>(0);  in getValSet()
127     inline void trimOrRemove(unordered_set<KEY>&& keys, const unordered_set<VAL>& rVals,  in trimOrRemove()
128                              unordered_set<KEY>* goneKeys, unordered_set<VAL>* goneVals) {  in trimOrRemove()
131     inline void trimOrRemove(unordered_set<KEY>& keys, const unordered_set<VAL>& rVals,  in trimOrRemove()
132                              unordered_set<KEY>* goneKeys, unordered_set<VAL>* goneVals) {  in trimOrRemove()
143     bool add(const KEY& key, const unordered_set<VAL>& newVals) {  in add()
160     inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>&& newVals,  in add()
164     inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>& newVals,  in add()
176     inline unordered_set<VAL> update(const KEY& key, unordered_set<VAL>& newVals) {  in update()
177         unordered_set<VAL> goneVals(0);  in update()