Lines Matching refs:fOrderedArray
30 fOrderedArray = SkNEW(SkTDArray<T>);
36 SkASSERT(fOrderedArray);
37 SkDELETE(fOrderedArray);
42 this->fOrderedArray = SkNEW_ARGS(SkTDArray<T>, (*src.fOrderedArray));
50 *this->fOrderedArray = *src.fOrderedArray;
62 * The first stage goes through src.fOrderedArray, checking if
63 * this->contains() is false before adding to this.fOrderedArray.
68 SkASSERT(fOrderedArray);
70 // Do fOrderedArray merge.
72 if (!contains((*src.fOrderedArray)[i])) {
73 fOrderedArray->push((*src.fOrderedArray)[i]);
81 fArrayNew->setReserve(fOrderedArray->count());
122 SkASSERT(fOrderedArray);
130 fOrderedArray->push(elem);
140 SkASSERT(fOrderedArray);
142 SkASSERT(fSetArray->isEmpty() == fOrderedArray->isEmpty());
143 return fOrderedArray->isEmpty();
149 SkASSERT(fOrderedArray);
151 SkASSERT(fSetArray->count() == fOrderedArray->count());
152 return fOrderedArray->count();
158 SkASSERT(fOrderedArray);
159 return fOrderedArray->bytes();
166 SkASSERT(fOrderedArray);
167 return fOrderedArray->begin();
173 SkASSERT(fOrderedArray);
174 return fOrderedArray->end();
178 SkASSERT(fOrderedArray);
179 return (*fOrderedArray)[index];
186 SkASSERT(fOrderedArray);
188 fOrderedArray->reset();
195 SkASSERT(fOrderedArray);
197 fOrderedArray->rewind();
204 SkASSERT(fOrderedArray);
206 fOrderedArray->setReserve(reserve);
219 SkASSERT(fOrderedArray);
220 fOrderedArray->copyRange(dst, 0, fOrderedArray->count());
226 SkASSERT(fOrderedArray);
227 return *fOrderedArray;
234 SkASSERT(fOrderedArray);
235 fOrderedArray->unrefAll();
245 SkASSERT(fOrderedArray);
246 fOrderedArray->safeUnrefAll();
255 SkASSERT(fOrderedArray);
257 fOrderedArray->validate();
280 /** Checks if fSetArray is consistent with fOrderedArray
283 if (fSetArray->count() != fOrderedArray->count()) {
286 if (fOrderedArray->count() == 0) {
290 // Copy and sort fOrderedArray, then compare to fSetArray.
292 SkAutoMalloc sortedArray(fOrderedArray->bytes());
294 int count = fOrderedArray->count();
295 fOrderedArray->copyRange(sortedBase, 0, count);
312 SkTDArray<T>* fOrderedArray; // Sorted by insertion order for
