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) {
55 fCount = 0;
74 this->init(array.fItemArray, array.fCount, NULL, 0);
90 for (int i = 0; i < fCount; ++i) {
93 fCount = 0;
95 fCount = array.count();
101 for (int i = 0; i < fCount; ++i) {
112 void reset() { this->pop_back_n(fCount); }
117 int count() const { return fCount; }
122 bool empty() const { return !fCount; }
131 new ((char*)fMemArray+sizeof(T)*fCount) T;
132 ++fCount;
133 return fItemArray[fCount-1];
141 new ((char*)fMemArray+sizeof(T)*fCount) T(t);
142 ++fCount;
143 return fItemArray[fCount-1];
155 new (fItemArray + fCount + i) T;
157 fCount += n;
158 return fItemArray + fCount - n;
169 new (fItemArray + fCount + i) T(t);
171 fCount += n;
172 return fItemArray + fCount - n;
183 new (fItemArray + fCount + i) T(t[i]);
185 fCount += n;
186 return fItemArray + fCount - n;
193 SkASSERT(fCount > 0);
194 --fCount;
195 fItemArray[fCount].~T();
204 SkASSERT(fCount >= n);
205 fCount -= n;
219 if (newCount > fCount) {
220 push_back_n(newCount - fCount);
221 } else if (newCount < fCount) {
222 pop_back_n(fCount - newCount);
230 SkASSERT(i < fCount);
236 SkASSERT(i < fCount);
244 T& front() { SkASSERT(fCount > 0); return fItemArray[0];}
246 const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}
251 T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}
253 const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}
260 SkASSERT(i < fCount);
261 return fItemArray[fCount - i - 1];
266 SkASSERT(i < fCount);
267 return fItemArray[fCount - i - 1];
287 this->init(array.fItemArray, array.fCount, storage->get(), N);
304 fCount = count;
309 if (fReserveCount >= fCount &&
314 fAllocCount = SkMax32(fCount, fReserveCount);
326 SkASSERT(fCount >= 0);
329 SkASSERT(-delta <= fCount);
331 int newCount = fCount + delta;
366 int fCount;
