Lines Matching refs:fCapacity
27 SkTHashTable() : fCount(0), fRemoved(0), fCapacity(0) {}
39 size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); }
54 if (4 * (fCount+fRemoved) >= 3 * fCapacity) {
55 this->resize(fCapacity > 0 ? fCapacity * 2 : 4);
63 int index = hash & (fCapacity-1);
64 for (int n = 0; n < fCapacity; n++) {
74 SkASSERT(fCapacity == 0);
83 int index = hash & (fCapacity-1);
84 for (int n = 0; n < fCapacity; n++) {
95 SkASSERT(fCapacity == 0);
101 for (int i = 0; i < fCapacity; i++) {
111 for (int i = 0; i < fCapacity; i++) {
122 int index = hash & (fCapacity-1);
123 for (int n = 0; n < fCapacity; n++) {
148 int oldCapacity = fCapacity;
152 fCapacity = capacity;
166 // A valid strategy explores all slots in [0, fCapacity) as n walks from 0 to fCapacity-1.
168 //return (index + 0 + 1) & (fCapacity-1); // Linear probing.
169 return (index + n + 1) & (fCapacity-1); // Quadratic probing.
188 int fCount, fRemoved, fCapacity;