28     SkTHashTable() : fCount(0), fCapacity(0) {}  in SkTHashTable()
31         , fCapacity(other.fCapacity)  in SkTHashTable()
32         , fSlots(std::move(other.fSlots)) { other.fCount = other.fCapacity = 0; }  in SkTHashTable()
49     size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); }  in approxBytesUsed()
64         if (4 * fCount >= 3 * fCapacity) {  in set()
65             this->resize(fCapacity > 0 ? fCapacity * 2 : 4);  in set()
73         int index = hash & (fCapacity-1);  in find()
74         for (int n = 0; n < fCapacity; n++) {  in find()
84         SkASSERT(fCapacity == 0);  in find()
102         int index = hash & (fCapacity-1);  in remove()
103         for (int n = 0; n < fCapacity; n++) {  in remove()
132                 originalIndex = s.hash & (fCapacity - 1);  in remove()
145         for (int i = 0; i < fCapacity; i++) {  in foreach()
155         for (int i = 0; i < fCapacity; i++) {  in foreach()
166         int index = hash & (fCapacity-1);  in uncheckedSet()
167         for (int n = 0; n < fCapacity; n++) {  in uncheckedSet()
190         int oldCapacity = fCapacity;  in resize()
194         fCapacity = capacity;  in resize()
209         if (index < 0) { index += fCapacity; }  in next()
234     int fCount, fCapacity;  variable