30         fCount = 0;  in GrTArray()
39         fCount = 0;  in GrTArray()
50         fCount              = 0;  in GrTArray()
64         fCount              = 0;  in GrTArray()
73         fCount              = array.count();  in GrTArray()
75         fAllocCount         = GrMax(fReserveCount, fCount);  in GrTArray()
80             memcpy(fMemArray, array.fMemArray, sizeof(T) * fCount);  in GrTArray()
82             for (int i = 0; i < fCount; ++i) {  in GrTArray()
90         fCount              = count;  in GrTArray()
92         fAllocCount         = GrMax(fReserveCount, fCount);  in GrTArray()
96             memcpy(fMemArray, array, sizeof(T) * fCount);  in GrTArray()
98             for (int i = 0; i < fCount; ++i) {  in GrTArray()
112         fCount              = array.count();  in GrTArray()
117         if (fReserveCount >= fCount && preAllocCount) {  in GrTArray()
121             fAllocCount = GrMax(fCount, fReserveCount);  in GrTArray()
126             memcpy(fMemArray, array.fMemArray, sizeof(T) * fCount);  in GrTArray()
128             for (int i = 0; i < fCount; ++i) {  in GrTArray()
143         fCount              = count;  in GrTArray()
148         if (fReserveCount >= fCount && preAllocCount) {  in GrTArray()
152             fAllocCount = GrMax(fCount, fReserveCount);  in GrTArray()
157             memcpy(fMemArray, array, sizeof(T) * fCount);  in GrTArray()
159             for (int i = 0; i < fCount; ++i) {  in GrTArray()
166         for (int i = 0; i < fCount; ++i) {
169         fCount = 0;
171         fCount = array.count();
173             memcpy(fMemArray, array.fMemArray, sizeof(T) * fCount);
175             for (int i = 0; i < fCount; ++i) {
183         for (int i = 0; i < fCount; ++i) {  in ~GrTArray()
191     void reset() { this->pop_back_n(fCount); }  in reset()
193     int count() const { return fCount; }  in count()
195     bool empty() const { return !fCount; }  in empty()
199         new ((char*)fMemArray+sizeof(T)*fCount) T;  in push_back()
200         ++fCount;  in push_back()
201         return fItemArray[fCount-1];  in push_back()
208             new (fItemArray + fCount + i) T;  in push_back_n()
210         fCount += n;  in push_back_n()
214         GrAssert(fCount > 0);  in pop_back()
215         --fCount;  in pop_back()
216         fItemArray[fCount].~T();  in pop_back()
222         GrAssert(fCount >= n);  in pop_back_n()
223         fCount -= n;  in pop_back_n()
234         if (newCount > fCount) {  in resize_back()
235             push_back_n(newCount - fCount);  in resize_back()
236         } else if (newCount < fCount) {  in resize_back()
237             pop_back_n(fCount - newCount);  in resize_back()
242         GrAssert(i < fCount);
248         GrAssert(i < fCount);
253     T& front() { GrAssert(fCount > 0); return fItemArray[0];}  in front()
255     const T& front() const { GrAssert(fCount > 0); return fItemArray[0];}  in front()
257     T& back() { GrAssert(fCount); return fItemArray[fCount - 1];}  in back()
259     const T& back() const { GrAssert(fCount > 0); return fItemArray[fCount - 1];}  in back()
263         GrAssert(i < fCount);  in fromBack()
264         return fItemArray[fCount - i - 1];  in fromBack()
269         GrAssert(i < fCount);  in fromBack()
270         return fItemArray[fCount - i - 1];  in fromBack()
278         GrAssert(fCount >= 0);  in checkRealloc()
281         GrAssert(-delta <= fCount);  in checkRealloc()
283         int newCount = fCount + delta;  in checkRealloc()
305                 memcpy(fNewMemArray, fMemArray, fCount * sizeof(T));  in checkRealloc()
307                 for (int i = 0; i < fCount; ++i) {  in checkRealloc()
321     int fCount;  variable