29     SkTDArray() : fArray(nullptr), fReserve(0), fCount(0) {}  in SkTDArray()
34         fArray = nullptr;  in SkTDArray()
36             fArray = (T*)sk_malloc_throw(SkToSizeT(count) * sizeof(T));  in SkTDArray()
37             memcpy(fArray, src, sizeof(T) * SkToSizeT(count));  in SkTDArray()
42     SkTDArray(const SkTDArray<T>& src) : fArray(nullptr), fReserve(0), fCount(0) {  in SkTDArray()
43         SkTDArray<T> tmp(src.fArray, src.fCount);  in SkTDArray()
46     SkTDArray(SkTDArray<T>&& src) : fArray(nullptr), fReserve(0), fCount(0) {  in SkTDArray()
50         sk_free(fArray);  in ~SkTDArray()
56                 SkTDArray<T> tmp(src.fArray, src.fCount);
59                 sk_careful_memcpy(fArray, src.fArray, sizeof(T) * SkToSizeT(src.fCount));
76                  !memcmp(a.fArray, b.fArray, SkToSizeT(a.fCount) * sizeof(T)));
84         swap(fArray, that.fArray);  in swap()
110     T*        begin() { return fArray; }  in begin()
111     const T*  begin() const { return fArray; }  in begin()
112     T*        end() { return fArray ? fArray + fCount : nullptr; }  in end()
113     const T*  end() const { return fArray ? fArray + fCount : nullptr; }  in end()
117         return fArray[index];
121         return fArray[index];
128     const T& back() const { SkASSERT(fCount > 0); return fArray[fCount-1]; }  in back()
129           T& back()       { SkASSERT(fCount > 0); return fArray[fCount-1]; }  in back()
132         if (fArray) {  in reset()
133             sk_free(fArray);  in reset()
134             fArray = nullptr;  in reset()
173         memmove(fArray + 1, fArray, (fCount - 1) * sizeof(T));  in prepend()
174         return fArray;  in prepend()
183             SkASSERT(src == nullptr || fArray == nullptr ||
184                     src + count <= fArray || fArray + oldCount <= src);
188                 memcpy(fArray + oldCount, src, sizeof(T) * count);
191         return fArray + oldCount;
202         T* dst = fArray + index;
213         memmove(fArray + index, fArray + index + count, sizeof(T) * (fCount - index));
221             memcpy(fArray + index, fArray + newCount, sizeof(T));  in removeShuffle()
226         const T* iter = fArray;  in find()
227         const T* stop = fArray + fCount;  in find()
231                 return SkToInt(iter - fArray);  in find()
238         const T* iter = fArray + fCount;  in rfind()
239         const T* stop = fArray;  in rfind()
267         memcpy(dst, fArray + index, sizeof(T) * count);  in copyRange()
284         T*  iter = fArray;  in deleteAll()
285         T*  stop = fArray + fCount;  in deleteAll()
294         T*  iter = fArray;  in freeAll()
295         T*  stop = fArray + fCount;  in freeAll()
304         T*  iter = fArray;  in unrefAll()
305         T*  stop = fArray + fCount;  in unrefAll()
314         T*  iter = fArray;  in safeUnrefAll()
315         T*  stop = fArray + fCount;  in safeUnrefAll()
325         SkASSERT((fReserve == 0 && fArray == nullptr) ||  in validate()
326                  (fReserve > 0 && fArray != nullptr));  in validate()
335             fArray = (T*)sk_realloc_throw(fArray, fReserve * sizeof(T));  in shrinkToFit()
340     T*      fArray;
377         fArray = (T*)sk_realloc_throw(fArray, (size_t)fReserve * sizeof(T));  in resizeStorageToAtLeast()