40         this->init(that.fCount);  in SkTArray()
46         this->init(that.fCount);  in SkTArray()
48         that.fCount = 0;  in SkTArray()
65         for (int i = 0; i < fCount; ++i) {
68         fCount = 0;
70         fCount = that.count();
78         for (int i = 0; i < fCount; ++i) {
81         fCount = 0;
83         fCount = that.count();
85         that.fCount = 0;
90         for (int i = 0; i < fCount; ++i) {  in ~SkTArray()
102         this->pop_back_n(fCount);  in reset()
111         for (int i = 0; i < fCount; ++i) {  in reset()
115         fCount = 0;  in reset()
117         fCount = n;  in reset()
118         for (int i = 0; i < fCount; ++i) {  in reset()
128         for (int i = 0; i < fCount; ++i) {  in reset()
131         fCount = 0;  in reset()
133         fCount = count;  in reset()
154         SkASSERT(n < fCount);  in removeShuffle()
155         int newCount = fCount - 1;  in removeShuffle()
156         fCount = newCount;  in removeShuffle()
166     int count() const { return fCount; }  in count()
171     bool empty() const { return !fCount; }  in empty()
242             new (fItemArray + fCount + i) T(t[i]);  in push_back_n()
244         fCount += n;  in push_back_n()
245         return fItemArray + fCount - n;  in push_back_n()
255             new (fItemArray + fCount + i) T(std::move(t[i]));  in move_back_n()
257         fCount += n;  in move_back_n()
258         return fItemArray + fCount - n;  in move_back_n()
265         SkASSERT(fCount > 0);  in pop_back()
266         --fCount;  in pop_back()
267         fItemArray[fCount].~T();  in pop_back()
276         SkASSERT(fCount >= n);  in pop_back_n()
277         fCount -= n;  in pop_back_n()
279             fItemArray[fCount + i].~T();  in pop_back_n()
291         if (newCount > fCount) {  in resize_back()
292             this->push_back_n(newCount - fCount);  in resize_back()
293         } else if (newCount < fCount) {  in resize_back()
294             this->pop_back_n(fCount - newCount);  in resize_back()
306             SkTSwap(fCount, that->fCount);  in swap()
323         return fItemArray ? fItemArray + fCount : NULL;  in end()
326         return fItemArray ? fItemArray + fCount : NULL;  in end()
333         SkASSERT(i < fCount);
339         SkASSERT(i < fCount);
347     T& front() { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
349     const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
354     T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}  in back()
356     const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}  in back()
363         SkASSERT(i < fCount);  in fromBack()
364         return fItemArray[fCount - i - 1];  in fromBack()
369         SkASSERT(i < fCount);  in fromBack()
370         return fItemArray[fCount - i - 1];  in fromBack()
409         this->initWithPreallocatedStorage(array.fCount, storage->get(), N);  in SkTArray()
420         this->initWithPreallocatedStorage(array.fCount, storage->get(), N);  in SkTArray()
422         array.fCount = 0;  in SkTArray()
440         fCount = count;
458         fCount = count;  in initWithPreallocatedStorage()
480         for (int i = 0; i < fCount; ++i) {  in copy()
489         sk_careful_memcpy(dst, fMemArray, fCount * sizeof(T));  in SK_WHEN()
497         for (int i = 0; i < fCount; ++i) {  in move()
509         void* ptr = fItemArray + fCount;  in push_back_raw()
510         fCount += n;  in push_back_raw()
515         SkASSERT(fCount >= 0);  in checkRealloc()
517         SkASSERT(-delta <= fCount);  in checkRealloc()
519         int newCount = fCount + delta;  in checkRealloc()
555     int fCount;  variable