251     void reset() { fTable.reset(); }  in reset()
254     int count() const { return fTable.count(); }  in count()
257     size_t approxBytesUsed() const { return fTable.approxBytesUsed(); }  in approxBytesUsed()
264         Pair* out = fTable.set({std::move(key), std::move(val)});  in set()
271         if (Pair* p = fTable.find(key)) {  in find()
280         fTable.remove(key);  in remove()
286         fTable.foreach([&fn](Pair* p){ fn(p->key, &p->val); });  in foreach()
292         fTable.foreach([&fn](const Pair& p){ fn(p.key, p.val); });  in foreach()
303     SkTHashTable<Pair, K> fTable;  variable
318     void reset() { fTable.reset(); }  in reset()
321     int count() const { return fTable.count(); }  in count()
324     size_t approxBytesUsed() const { return fTable.approxBytesUsed(); }  in approxBytesUsed()
327     void add(T item) { fTable.set(std::move(item)); }  in add()
334     const T* find(const T& item) const { return fTable.find(item); }  in find()
339         fTable.remove(item);  in remove()
345         fTable.foreach(fn);  in foreach()
353     SkTHashTable<T, T, Traits> fTable;  variable