38             fCapacity  = that.fCapacity;
39             fSlots.reset(that.fCapacity);
40             for (int i = 0; i < fCapacity; i++) {
50             fCapacity = that.fCapacity;
53             that.fCount = that.fCapacity = 0;
66     int capacity() const { return fCapacity; }  in capacity()
69     size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); }  in approxBytesUsed()
84         if (4 * fCount >= 3 * fCapacity) {  in set()
85             this->resize(fCapacity > 0 ? fCapacity * 2 : 4);  in set()
93         int index = hash & (fCapacity-1);  in find()
94         for (int n = 0; n < fCapacity; n++) {  in find()
104         SkASSERT(fCapacity == 0);  in find()
122         int index = hash & (fCapacity-1);  in remove()
123         for (int n = 0; n < fCapacity; n++) {  in remove()
128                if (4 * fCount <= fCapacity && fCapacity > 4) {  in remove()
129                    this->resize(fCapacity / 2);  in remove()
140         for (int i = 0; i < fCapacity; i++) {  in foreach()
150         for (int i = 0; i < fCapacity; i++) {  in foreach()
212         for (int i = 0; i < fCapacity; i++) {  in firstPopulatedSlot()
217         return fCapacity;  in firstPopulatedSlot()
222         for (int i = currentSlot + 1; i < fCapacity; i++) {  in nextPopulatedSlot()
227         return fCapacity;  in nextPopulatedSlot()
240         int index = hash & (fCapacity-1);  in uncheckedSet()
241         for (int n = 0; n < fCapacity; n++) {  in uncheckedSet()
264         int oldCapacity = fCapacity;  in resize()
268         fCapacity = capacity;  in resize()
303                 originalIndex = s.hash & (fCapacity - 1);  in removeSlot()
315         if (index < 0) { index += fCapacity; }  in next()
335         fCapacity = 0;  variable