25     SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {  in SkTDynamicHash()
30         sk_free(fArray);  in ~SkTDynamicHash()
54         T* current() const { return fHash->fArray[fCurrentIndex]; }  in current()
66             T* candidate = fArray[index];  in find()
103             const T* candidate = fArray[index];  in countCollisions()
131                 if (Deleted() == fArray[i]) {  in validate()
133                 } else if (Empty() != fArray[i]) {  in validate()
135                     SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));  in validate()
146                 if (Empty() == fArray[i] || Deleted() == fArray[i]) {  in validate()
150                     if (Empty() == fArray[j] || Deleted() == fArray[j]) {  in validate()
153                     SKTDYNAMICHASH_CHECK(fArray[i] != fArray[j]);  in validate()
154                     SKTDYNAMICHASH_CHECK(!(GetKey(*fArray[i]) == GetKey(*fArray[j])));  in validate()
166             const T* candidate = fArray[index];  in innerAdd()
172                 fArray[index] = newEntry;  in innerAdd()
184             const T* candidate = fArray[index];  in innerRemove()
188                 fArray[index] = Deleted();  in innerRemove()
205         SkAutoTMalloc<T*> oldArray(fArray);  in resize()
209         fArray = (T**)sk_calloc_throw(sizeof(T*) * fCapacity);  in resize()
239     T** fArray;  variable