Lines Matching refs:fArray
25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {
30 sk_free(fArray);
54 T* current() const { return fHash->fArray[fCurrentIndex]; }
66 T* candidate = fArray[index];
103 const T* candidate = fArray[index];
131 if (Deleted() == fArray[i]) {
133 } else if (Empty() != fArray[i]) {
135 SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));
146 if (Empty() == fArray[i] || Deleted() == fArray[i]) {
150 if (Empty() == fArray[j] || Deleted() == fArray[j]) {
153 SKTDYNAMICHASH_CHECK(fArray[i] != fArray[j]);
154 SKTDYNAMICHASH_CHECK(!(GetKey(*fArray[i]) == GetKey(*fArray[j])));
166 const T* candidate = fArray[index];
172 fArray[index] = newEntry;
184 const T* candidate = fArray[index];
188 fArray[index] = Deleted();
205 SkAutoTMalloc<T*> oldArray(fArray);
209 fArray = (T**)sk_calloc_throw(sizeof(T*) * fCapacity);
236 int fCount; // Number of non Empty(), non Deleted() entries in fArray.
237 int fDeleted; // Number of Deleted() entries in fArray.
238 int fCapacity; // Number of entries in fArray. Always a power of 2.
239 T** fArray;
