Lines Matching refs:fArray
30 sk_free(fArray);
39 T* candidate = fArray[index];
79 const T* candidate = fArray[index];
102 fArray = AllocArray(fCapacity);
115 if (Empty() != fArray[i] && Deleted() != fArray[i]) {
124 if (Deleted() == fArray[i]) {
132 if (Empty() == fArray[i] || Deleted() == fArray[i]) {
135 SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));
140 if (Empty() == fArray[i] || Deleted() == fArray[i]) {
144 if (Empty() == fArray[j] || Deleted() == fArray[j]) {
147 SKTDYNAMICHASH_CHECK(fArray[i] != fArray[j]);
148 SKTDYNAMICHASH_CHECK(!Equal(*fArray[i], GetKey(*fArray[j])));
149 SKTDYNAMICHASH_CHECK(!Equal(*fArray[j], GetKey(*fArray[i])));
160 const T* candidate = fArray[index];
166 fArray[index] = newEntry;
178 const T* candidate = fArray[index];
182 fArray[index] = Deleted();
205 T** oldArray = fArray;
233 int fCount; // Number of non Empty(), non Deleted() entries in fArray.
234 int fDeleted; // Number of Deleted() entries in fArray.
235 int fCapacity; // Number of entries in fArray. Always a power of 2.
236 T** fArray;
