53     bool isEmpty() const { return fCount == 0; }  in isEmpty()
54     int count() const { return fCount; }  in count()
58         SkASSERT(index + count <= fCount);
59         fCount = SkToU16(fCount - count);
60         memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
72             fReserve = fCount = 0;  in reset()
76             SkASSERT(fReserve == 0 && fCount == 0);  in reset()
83             this->growBy(count - fCount);  in setCount()
85             fCount = SkToU16(count);  in setCount()
95     uint16_t    fReserve, fCount;  variable
110 …T&  operator[](int index) const { SYNC(); SkASSERT((unsigned)index < fCount); return ((T*) fArray)…
119     T*  end() const { return (T*) (fArray ? fArray + fCount : nullptr); }  in end()
127     const T&    top() const { return (*this)[fCount - 1]; }  in top()
128     T&          top() { return (*this)[fCount - 1]; }  in top()
129     void        pop(T* elem) { if (elem) *elem = (*this)[fCount - 1]; --fCount; }  in pop()
130     void        pop() { --fCount; }  in pop()