Home | History | Annotate | Download | only in private

Lines Matching defs:fCapacity

27     SkTHashTable() : fCount(0), fCapacity(0) {}
39 size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); }
54 if (4 * fCount >= 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++) {
113 originalIndex = s.hash & (fCapacity - 1);
126 for (int i = 0; i < fCapacity; i++) {
136 for (int i = 0; i < fCapacity; i++) {
147 int index = hash & (fCapacity-1);
148 for (int n = 0; n < fCapacity; n++) {
171 int oldCapacity = fCapacity;
175 fCapacity = capacity;
190 if (index < 0) { index += fCapacity; }
215 int fCount, fCapacity;