31         new (self->fItemArray + i) T(array[i]);  in copy()
37         new (newMemArray + sizeof(T) * i) T(self->fItemArray[i]);  in copyAndDelete()
38         self->fItemArray[i].~T();  in copyAndDelete()
74         this->init(array.fItemArray, array.fCount, NULL, 0);  in SkTArray()
91             fItemArray[i].~T();
102             fItemArray[i].~T();  in ~SkTArray()
133         return fItemArray[fCount-1];  in push_back()
143         return fItemArray[fCount-1];  in push_back()
155             new (fItemArray + fCount + i) T;  in push_back_n()
158         return fItemArray + fCount - n;  in push_back_n()
169             new (fItemArray + fCount + i) T(t);  in push_back_n()
172         return fItemArray + fCount - n;  in push_back_n()
183             new (fItemArray + fCount + i) T(t[i]);  in push_back_n()
186         return fItemArray + fCount - n;  in push_back_n()
195         fItemArray[fCount].~T();  in pop_back()
207             fItemArray[i].~T();  in pop_back_n()
232         return fItemArray[i];
238         return fItemArray[i];
244     T& front() { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
246     const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
251     T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}  in back()
253     const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}  in back()
261         return fItemArray[fCount - i - 1];  in fromBack()
267         return fItemArray[fCount - i - 1];  in fromBack()
287         this->init(array.fItemArray, array.fCount, storage->get(), N);  in SkTArray()
370         T*       fItemArray;  member