27     SkTHashTable() : fCount(0), fRemoved(0), fCapacity(0) {}  in SkTHashTable()
39     size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); }  in approxBytesUsed()
54         if (4 * (fCount+fRemoved) >= 3 * fCapacity) {  in set()
55             this->resize(fCapacity > 0 ? fCapacity * 2 : 4);  in set()
63         int index = hash & (fCapacity-1);  in find()
64         for (int n = 0; n < fCapacity; n++) {  in find()
74         SkASSERT(fCapacity == 0);  in find()
83         int index = hash & (fCapacity-1);  in remove()
84         for (int n = 0; n < fCapacity; n++) {  in remove()
95         SkASSERT(fCapacity == 0);  in remove()
101         for (int i = 0; i < fCapacity; i++) {  in foreach()
111         for (int i = 0; i < fCapacity; i++) {  in foreach()
122         int index = hash & (fCapacity-1);  in uncheckedSet()
123         for (int n = 0; n < fCapacity; n++) {  in uncheckedSet()
148         int oldCapacity = fCapacity;  in resize()
152         fCapacity = capacity;  in resize()
169         return (index + n + 1) & (fCapacity-1);        // Quadratic probing.  in next()
188     int fCount, fRemoved, fCapacity;  variable