Lines Matching full:farray
19 fArray = NULL;
25 fArray = NULL;
27 fArray = (T*)sk_malloc_throw(count * sizeof(T));
28 memcpy(fArray, src, sizeof(T) * count);
34 fArray = NULL;
35 SkTDArray<T> tmp(src.fArray, src.fCount);
39 sk_free(fArray);
45 SkTDArray<T> tmp(src.fArray, src.fCount);
48 memcpy(fArray, src.fArray, sizeof(T) * src.fCount);
58 !memcmp(a.fArray, b.fArray, a.fCount * sizeof(T)));
65 SkTSwap(fArray, other.fArray);
74 T* array = fArray;
75 fArray = NULL;
99 T* begin() { return fArray; }
100 const T* begin() const { return fArray; }
101 T* end() { return fArray ? fArray + fCount : NULL; }
102 const T* end() const { return fArray ? fArray + fCount : NULL; }
106 return fArray[index];
110 return fArray[index];
121 if (fArray) {
122 sk_free(fArray);
123 fArray = NULL;
157 memmove(fArray + 1, fArray, (fCount - 1) * sizeof(T));
158 return fArray;
167 SkASSERT(src == NULL || fArray == NULL ||
168 src + count <= fArray || fArray + oldCount <= src);
172 memcpy(fArray + oldCount, src, sizeof(T) * count);
175 return fArray + oldCount;
192 T* dst = fArray + index;
203 memmove(fArray + index, fArray + index + count, sizeof(T) * (fCount - index));
211 memcpy(fArray + index, fArray + newCount, sizeof(T));
216 const T* iter = fArray;
217 const T* stop = fArray + fCount;
221 return SkToInt(iter - fArray);
228 const T* iter = fArray + fCount;
229 const T* stop = fArray;
257 memcpy(dst, fArray + index, sizeof(T) * count);
274 T* iter = fArray;
275 T* stop = fArray + fCount;
284 T* iter = fArray;
285 T* stop = fArray + fCount;
294 T* iter = fArray;
295 T* stop = fArray + fCount;
304 T* iter = fArray;
305 T* stop = fArray + fCount;
324 SkASSERT((fReserve == 0 && fArray == NULL) ||
325 (fReserve > 0 && fArray != NULL));
332 fArray = (T*)sk_realloc_throw(fArray, fReserve * sizeof(T));
336 T* fArray;
360 fArray = (T*)sk_realloc_throw(fArray, fReserve * sizeof(T));
