Lines Matching refs:fCount
21 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
25 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
30 for (int i = 0; i < self->fCount; ++i) {
36 for (int i = 0; i < self->fCount; ++i) {
57 fCount = 0;
76 this->init(array.fItemArray, array.fCount, NULL, 0);
92 for (int i = 0; i < fCount; ++i) {
95 fCount = 0;
97 fCount = array.count();
103 for (int i = 0; i < fCount; ++i) {
114 void reset() { this->pop_back_n(fCount); }
121 for (int i = 0; i < fCount; ++i) {
124 // set fCount to 0 before calling checkRealloc so that no copy cons. are called.
125 fCount = 0;
127 fCount = n;
128 for (int i = 0; i < fCount; ++i) {
137 for (int i = 0; i < fCount; ++i) {
140 int delta = count - fCount;
142 fCount = count;
151 int count() const { return fCount; }
156 bool empty() const { return !fCount; }
213 SkNEW_PLACEMENT_ARGS(fItemArray + fCount + i, T, (t[i]));
215 fCount += n;
216 return fItemArray + fCount - n;
223 SkASSERT(fCount > 0);
224 --fCount;
225 fItemArray[fCount].~T();
234 SkASSERT(fCount >= n);
235 fCount -= n;
237 fItemArray[fCount + i].~T();
249 if (newCount > fCount) {
250 this->push_back_n(newCount - fCount);
251 } else if (newCount < fCount) {
252 this->pop_back_n(fCount - newCount);
263 return fItemArray ? fItemArray + fCount : NULL;
266 return fItemArray ? fItemArray + fCount : NULL;;
273 SkASSERT(i < fCount);
279 SkASSERT(i < fCount);
287 T& front() { SkASSERT(fCount > 0); return fItemArray[0];}
289 const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}
294 T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}
296 const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}
303 SkASSERT(i < fCount);
304 return fItemArray[fCount - i - 1];
309 SkASSERT(i < fCount);
310 return fItemArray[fCount - i - 1];
347 this->init(array.fItemArray, array.fCount, storage->get(), N);
364 fCount = count;
369 if (fReserveCount >= fCount &&
374 fAllocCount = SkMax32(fCount, fReserveCount);
389 void* ptr = fItemArray + fCount;
390 fCount += n;
395 SkASSERT(fCount >= 0);
398 SkASSERT(-delta <= fCount);
400 int newCount = fCount + delta;
437 int fCount;
