27     SkTHashTable() : fCount(0), fRemoved(0), fCapacity(0) {}  in SkTHashTable()
51         if (4 * (fCount+fRemoved) >= 3 * fCapacity) {  in set()
52             this->resize(fCapacity > 0 ? fCapacity * 2 : 4);  in set()
60         int index = hash & (fCapacity-1);  in find()
61         for (int n = 0; n < fCapacity; n++) {  in find()
71         SkASSERT(fCapacity == 0);  in find()
80         int index = hash & (fCapacity-1);  in remove()
81         for (int n = 0; n < fCapacity; n++) {  in remove()
92         SkASSERT(fCapacity == 0);  in remove()
98         for (int i = 0; i < fCapacity; i++) {  in foreach()
108         for (int i = 0; i < fCapacity; i++) {  in foreach()
119         int index = hash & (fCapacity-1);  in uncheckedSet()
120         for (int n = 0; n < fCapacity; n++) {  in uncheckedSet()
145         int oldCapacity = fCapacity;  in resize()
149         fCapacity = capacity;  in resize()
166         return (index + n + 1) & (fCapacity-1);        // Quadratic probing.  in next()
185     int fCount, fRemoved, fCapacity;  variable