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()
101     void reset() { this->pop_back_n(fCount); }  in reset()
108         for (int i = 0; i < fCount; ++i) {  in reset()
112         fCount = 0;  in reset()
114         fCount = n;  in reset()
115         for (int i = 0; i < fCount; ++i) {  in reset()
124         if (fCount < n) {  in reserve()
125             this->checkRealloc(n - fCount);  in reserve()
133         for (int i = 0; i < fCount; ++i) {  in reset()
136         fCount = 0;  in reset()
138         fCount = count;  in reset()
143         SkASSERT(n < fCount);  in removeShuffle()
144         int newCount = fCount - 1;  in removeShuffle()
145         fCount = newCount;  in removeShuffle()
155     int count() const { return fCount; }  in count()
160     bool empty() const { return !fCount; }  in empty()
231             new (fItemArray + fCount + i) T(t[i]);  in push_back_n()
233         fCount += n;  in push_back_n()
234         return fItemArray + fCount - n;  in push_back_n()
244             new (fItemArray + fCount + i) T(std::move(t[i]));  in move_back_n()
246         fCount += n;  in move_back_n()
247         return fItemArray + fCount - n;  in move_back_n()
254         SkASSERT(fCount > 0);  in pop_back()
255         --fCount;  in pop_back()
256         fItemArray[fCount].~T();  in pop_back()
265         SkASSERT(fCount >= n);  in pop_back_n()
266         fCount -= n;  in pop_back_n()
268             fItemArray[fCount + i].~T();  in pop_back_n()
280         if (newCount > fCount) {  in resize_back()
281             this->push_back_n(newCount - fCount);  in resize_back()
282         } else if (newCount < fCount) {  in resize_back()
283             this->pop_back_n(fCount - newCount);  in resize_back()
295             SkTSwap(fCount, that->fCount);  in swap()
312         return fItemArray ? fItemArray + fCount : NULL;  in end()
315         return fItemArray ? fItemArray + fCount : NULL;  in end()
322         SkASSERT(i < fCount);
328         SkASSERT(i < fCount);
336     T& front() { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
338     const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
343     T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}  in back()
345     const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}  in back()
352         SkASSERT(i < fCount);  in fromBack()
353         return fItemArray[fCount - i - 1];  in fromBack()
358         SkASSERT(i < fCount);  in fromBack()
359         return fItemArray[fCount - i - 1];  in fromBack()
398         this->initWithPreallocatedStorage(array.fCount, storage->get(), N);  in SkTArray()
409         this->initWithPreallocatedStorage(array.fCount, storage->get(), N);  in SkTArray()
411         array.fCount = 0;  in SkTArray()
429         fCount = count;
445         fCount = count;  in initWithPreallocatedStorage()
466         for (int i = 0; i < fCount; ++i) {  in copy()
475         sk_careful_memcpy(dst, fMemArray, fCount * sizeof(T));  in SK_WHEN()
483         for (int i = 0; i < fCount; ++i) {  in move()
495         void* ptr = fItemArray + fCount;  in push_back_raw()
496         fCount += n;  in push_back_raw()
501         SkASSERT(fCount >= 0);  in checkRealloc()
503         SkASSERT(-delta <= fCount);  in checkRealloc()
505         int newCount = fCount + delta;  in checkRealloc()
536     int fCount;  variable