33     void set(K &&k, V &&v) {  in set()  argument
35         mMap[std::forward<K>(k)] = std::forward<V>(v);  in set()
39     const V &get(const K &k, const V &def) const {  in get()  argument
41         const_iterator iter = mMap.find(k);  in get()
48     size_type erase(const K &k) {  in erase()  argument
50         return mMap.erase(k);  in erase()
53     size_type eraseIfEqual(const K& k, const V& v) {  in eraseIfEqual()  argument
55         const_iterator iter = mMap.find(k);  in eraseIfEqual()
69     void setLocked(const K& k, V&& v) { mMap[k] = std::forward<V>(v); }  in setLocked()  argument
70     void setLocked(const K& k, const V& v) { mMap[k] = v; }  in setLocked()  argument
72     const V& getLocked(const K& k, const V& def) const {  in getLocked()  argument
73         const_iterator iter = mMap.find(k);  in getLocked()
80     size_type eraseLocked(const K& k) { return mMap.erase(k); }  in eraseLocked()  argument