25     SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(nullptr) {  in SkTDynamicHash()
30         sk_free(fArray);  in ~SkTDynamicHash()
54         T* current() const { return fHash->fArray[fCurrentIndex]; }  in current()
81         const T* current() const { return fHash->fArray[fCurrentIndex]; }  in current()
94             T* candidate = fArray[index];  in find()
123         if (fArray) {  in rewind()
124             sk_bzero(fArray, sizeof(T*)* fCapacity);  in rewind()
134         sk_free(fArray);  in reset()
135         fArray = nullptr;  in reset()
148             const T* candidate = fArray[index];  in countCollisions()
176                 if (Deleted() == fArray[i]) {  in validate()
178                 } else if (Empty() != fArray[i]) {  in validate()
180                     SKTDYNAMICHASH_CHECK(this->find(GetKey(*fArray[i])));  in validate()
191                 if (Empty() == fArray[i] || Deleted() == fArray[i]) {  in validate()
195                     if (Empty() == fArray[j] || Deleted() == fArray[j]) {  in validate()
198                     SKTDYNAMICHASH_CHECK(fArray[i] != fArray[j]);  in validate()
199                     SKTDYNAMICHASH_CHECK(!(GetKey(*fArray[i]) == GetKey(*fArray[j])));  in validate()
212             const T* candidate = fArray[index];  in innerAdd()
218                 fArray[index] = newEntry;  in innerAdd()
231             const T* candidate = fArray[index];  in innerRemove()
235                 fArray[index] = Deleted();  in innerRemove()
261         SkAutoTMalloc<T*> oldArray(fArray);  in resize()
265         fArray = (T**)sk_calloc_throw(sizeof(T*) * fCapacity);  in resize()
295     T** fArray;  variable