61     bool isEmpty() const { return fCount == 0; }  in isEmpty()
62     int count() const { return fCount; }  in count()
66         SkASSERT(index + count <= fCount);
67         fCount = SkToU16(fCount - count);
68         memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
80             fReserve = fCount = 0;  in reset()
84             SkASSERT(fReserve == 0 && fCount == 0);  in reset()
91             this->growBy(count - fCount);  in setCount()
93             fCount = SkToU16(count);  in setCount()
103     uint16_t    fReserve, fCount;  variable
118 …T&  operator[](int index) const { SYNC(); SkASSERT((unsigned)index < fCount); return ((T*) fArray)…
127     T*  end() const { return (T*) (fArray ? fArray + fCount : NULL); }  in end()
135     const T&    top() const { return (*this)[fCount - 1]; }  in top()
136     T&          top() { return (*this)[fCount - 1]; }  in top()
137     void        pop(T* elem) { if (elem) *elem = (*this)[fCount - 1]; --fCount; }  in pop()
138     void        pop() { --fCount; }  in pop()