Lines Matching refs:fCount
25 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
29 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
38 for (int i = 0; i < self->fCount; ++i) {
44 for (int i = 0; i < self->fCount; ++i) {
65 fCount = 0;
84 this->init(array.fItemArray, array.fCount, NULL, 0);
100 for (int i = 0; i < fCount; ++i) {
103 fCount = 0;
105 fCount = array.count();
111 for (int i = 0; i < fCount; ++i) {
122 void reset() { this->pop_back_n(fCount); }
129 for (int i = 0; i < fCount; ++i) {
132 // set fCount to 0 before calling checkRealloc so that no copy cons. are called.
133 fCount = 0;
135 fCount = n;
136 for (int i = 0; i < fCount; ++i) {
145 for (int i = 0; i < fCount; ++i) {
148 int delta = count - fCount;
150 fCount = count;
155 SkASSERT(n < fCount);
156 int newCount = fCount - 1;
157 fCount = newCount;
168 int count() const { return fCount; }
173 bool empty() const { return !fCount; }
230 SkNEW_PLACEMENT_ARGS(fItemArray + fCount + i, T, (t[i]));
232 fCount += n;
233 return fItemArray + fCount - n;
240 SkASSERT(fCount > 0);
241 --fCount;
242 fItemArray[fCount].~T();
251 SkASSERT(fCount >= n);
252 fCount -= n;
254 fItemArray[fCount + i].~T();
266 if (newCount > fCount) {
267 this->push_back_n(newCount - fCount);
268 } else if (newCount < fCount) {
269 this->pop_back_n(fCount - newCount);
280 return fItemArray ? fItemArray + fCount : NULL;
283 return fItemArray ? fItemArray + fCount : NULL;;
290 SkASSERT(i < fCount);
296 SkASSERT(i < fCount);
304 T& front() { SkASSERT(fCount > 0); return fItemArray[0];}
306 const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}
311 T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}
313 const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}
320 SkASSERT(i < fCount);
321 return fItemArray[fCount - i - 1];
326 SkASSERT(i < fCount);
327 return fItemArray[fCount - i - 1];
364 this->init(array.fItemArray, array.fCount, storage->get(), N);
381 fCount = count;
386 if (fReserveCount >= fCount &&
391 fAllocCount = SkMax32(fCount, fReserveCount);
406 void* ptr = fItemArray + fCount;
407 fCount += n;
412 SkASSERT(fCount >= 0);
415 SkASSERT(-delta <= fCount);
417 int newCount = fCount + delta;
456 int fCount;