Lines Matching refs:VAL
79 template <typename KEY, typename VAL>
81 unordered_map<KEY, unordered_set<VAL>> mMap;
86 bool trimOrRemove(typename unordered_map<KEY, unordered_set<VAL>>::iterator iter, in trimOrRemove()
87 const unordered_set<VAL>& rVals, unordered_set<VAL>* goneVals) { in trimOrRemove()
88 trimSet<VAL>(iter->second, rVals, goneVals); in trimOrRemove()
106 inline unordered_set<VAL>* getValSetPtr(const KEY& key) { in getValSetPtr()
113 inline unordered_set<VAL> getValSet(const KEY& key) { in getValSet()
115 return (entry != mMap.end()) ? entry->second : unordered_set<VAL>{}; in getValSet()
135 inline void trimOrRemove(unordered_set<KEY>&& keys, const unordered_set<VAL>& rVals, in trimOrRemove()
136 unordered_set<KEY>* goneKeys, unordered_set<VAL>* goneVals) { in trimOrRemove()
140 inline void trimOrRemove(unordered_set<KEY>& keys, const unordered_set<VAL>& rVals, in trimOrRemove()
141 unordered_set<KEY>* goneKeys, unordered_set<VAL>* goneVals) { in trimOrRemove()
152 bool add(const KEY& key, const unordered_set<VAL>& newVals) { in add()
169 inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>&& newVals, in add()
174 inline void add(const unordered_set<KEY>& keys, const unordered_set<VAL>& newVals, in add()
186 inline unordered_set<VAL> update(const KEY& key, unordered_set<VAL>& newVals) { in update()
187 unordered_set<VAL> goneVals = {}; in update()