Lines Matching refs:fTable
165 Iter(const TTable* table, int slot) : fTable(table), fSlot(slot) {}
176 return *fTable->slot(fSlot);
180 return fTable->slot(fSlot);
185 SkASSERT(fTable == that.fTable);
194 fSlot = fTable->nextPopulatedSlot(fSlot);
205 const TTable* fTable;
417 void reset() { fTable.reset(); }
420 int count() const { return fTable.count(); }
423 size_t approxBytesUsed() const { return fTable.approxBytesUsed(); }
430 Pair* out = fTable.set({std::move(key), std::move(val)});
437 if (Pair* p = fTable.find(key)) {
453 fTable.remove(key);
459 fTable.foreach([&fn](Pair* p){ fn(p->first, &p->second); });
465 fTable.foreach([&fn](const Pair& p){ fn(p.first, p.second); });
478 return Iter::MakeBegin(&fTable);
482 return Iter::MakeEnd(&fTable);
486 SkTHashTable<Pair, K> fTable;
494 void reset() { fTable.reset(); }
497 int count() const { return fTable.count(); }
500 bool empty() const { return fTable.count() == 0; }
503 size_t approxBytesUsed() const { return fTable.approxBytesUsed(); }
506 void add(T item) { fTable.set(std::move(item)); }
513 const T* find(const T& item) const { return fTable.find(item); }
518 fTable.remove(item);
524 fTable.foreach(fn);
537 return Iter::MakeBegin(&fTable);
541 return Iter::MakeEnd(&fTable);
545 SkTHashTable<T, T, Traits> fTable;