Lines Matching full:farray
25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {
30 sk_free(fArray);
54 T* current() const { return fHash->fArray[fCurrentIndex]; }
81 const T* current() const { return fHash->fArray[fCurrentIndex]; }
94 T* candidate = fArray[index];
123 if (fArray) {
124 sk_bzero(fArray, sizeof(T*)* fCapacity);
134 sk_free(fArray);
135 fArray = NULL;
148 const T* candidate = fArray[index];
176 if (Deleted() == fArray[i]) {
178 } else if (Empty() != fArray[i]) {
180 SKTDYNAMICHASH_CHECK(this->find(GetKey(*fArray[i])));
191 if (Empty() == fArray[i] || Deleted() == fArray[i]) {
195 if (Empty() == fArray[j] || Deleted() == fArray[j]) {
198 SKTDYNAMICHASH_CHECK(fArray[i] != fArray[j]);
199 SKTDYNAMICHASH_CHECK(!(GetKey(*fArray[i]) == GetKey(*fArray[j])));
212 const T* candidate = fArray[index];
218 fArray[index] = newEntry;
231 const T* candidate = fArray[index];
235 fArray[index] = Deleted();
252 SkAutoTMalloc<T*> oldArray(fArray);
256 fArray = (T**)sk_calloc_throw(sizeof(T*) * fCapacity);
283 int fCount; // Number of non Empty(), non Deleted() entries in fArray.
284 int fDeleted; // Number of Deleted() entries in fArray.
285 int fCapacity; // Number of entries in fArray. Always a power of 2.
286 T** fArray;
