29     SkTDArray() : fArray(nullptr), fReserve(0), fCount(0) {}  in SkTDArray()
33         fReserve = fCount = 0;  in SkTDArray()
38             fReserve = fCount = 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()
55             if (src.fCount > fReserve) {
56                 SkTDArray<T> tmp(src.fArray, src.fCount);
59                 sk_careful_memcpy(fArray, src.fArray, sizeof(T) * SkToSizeT(src.fCount));
60                 fCount = src.fCount;
74         return  a.fCount == b.fCount &&
75                 (a.fCount == 0 ||
76                  !memcmp(a.fArray, b.fArray, SkToSizeT(a.fCount) * sizeof(T)));
86         swap(fCount, that.fCount);  in swap()
89     bool isEmpty() const { return fCount == 0; }  in isEmpty()
95     int count() const { return fCount; }  in count()
96     size_t size() const { return fCount; }  in size()
108     size_t bytes() const { return fCount * sizeof(T); }  in bytes()
112     T*        end() { return fArray ? fArray + fCount : nullptr; }  in end()
113     const T*  end() const { return fArray ? fArray + fCount : nullptr; }  in end()
116         SkASSERT(index < fCount);
120         SkASSERT(index < fCount);
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()
135             fReserve = fCount = 0;  in reset()
137             SkASSERT(fReserve == 0 && fCount == 0);  in reset()
143         fCount = 0;  in rewind()
157         fCount = count;  in setCount()
173         memmove(fArray + 1, fArray, (fCount - 1) * sizeof(T));  in prepend()
181         int oldCount = fCount;
199         SkASSERT(index <= fCount);
200         size_t oldCount = fCount;
211         SkASSERT(index + count <= fCount);
212         fCount = fCount - count;
213         memmove(fArray + index, fArray + index + count, sizeof(T) * (fCount - index));
217         SkASSERT(index < fCount);  in removeShuffle()
218         int newCount = fCount - 1;  in removeShuffle()
219         fCount = newCount;  in removeShuffle()
227         const T* stop = fArray + fCount;  in find()
238         const T* iter = fArray + fCount;  in rfind()
263         if (index >= fCount) {  in copyRange()
266         int count = std::min(max, fCount - index);  in copyRange()
272         this->copyRange(dst, 0, fCount);  in copy()
278     const T& top() const { return (*this)[fCount - 1]; }  in top()
279     T&       top() { return (*this)[fCount - 1]; }  in top()
280     void     pop(T* elem) { SkASSERT(fCount > 0); if (elem) *elem = (*this)[fCount - 1]; --fCount; }  in pop()
281     void     pop() { SkASSERT(fCount > 0); --fCount; }  in pop()
285         T*  stop = fArray + fCount;  in deleteAll()
295         T*  stop = fArray + fCount;  in freeAll()
305         T*  stop = fArray + fCount;  in unrefAll()
315         T*  stop = fArray + fCount;  in safeUnrefAll()
327         SkASSERT(fCount <= fReserve);  in validate()
332         if (fReserve != fCount) {  in shrinkToFit()
333             SkASSERT(fReserve > fCount);  in shrinkToFit()
334             fReserve = fCount;  in shrinkToFit()
342     int     fCount;     // logical number of elements (fCount <= fReserve)  variable
353         uint32_t count = (uint32_t)fCount + (uint32_t)delta;  in adjustCount()