Lines Matching refs:fCapacity
25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {
40 SkASSERT(fCurrentIndex <= fHash->fCapacity);
41 return fCurrentIndex == fHash->fCapacity;
65 for (int round = 0; round < fCapacity; round++) {
75 SkASSERT(fCapacity == 0);
97 int capacity() const { return fCapacity; }
102 for (int round = 0; round < fCapacity; round++) {
109 SkASSERT(fCapacity == 0);
124 SKTDYNAMICHASH_CHECK(SkIsPow2(fCapacity));
130 for (int i = 0; i < fCapacity; i++) {
145 for (int i = 0; i < fCapacity; i++) {
149 for (int j = i+1; j < fCapacity; j++) {
165 for (int round = 0; round < fCapacity; round++) {
177 SkASSERT(fCapacity == 0);
183 for (int round = 0; round < fCapacity; round++) {
193 SkASSERT(fCapacity == 0);
197 if (100 * (fCount + fDeleted + 1) > fCapacity * kGrowPercent) {
198 this->resize(fCapacity > 0 ? fCapacity * 2 : 4);
204 int oldCapacity = fCapacity;
208 fCapacity = newCapacity;
209 fArray = (T**)sk_calloc_throw(sizeof(T*) * fCapacity);
220 // fCapacity is always a power of 2, so this masks the correct low bits to index into our hash.
221 uint32_t hashMask() const { return fCapacity - 1; }
238 int fCapacity; // Number of entries in fArray. Always a power of 2.
