Lines Matching defs:count
42 int count() const { return fArray.count(); }
52 if (1 == fArray.count()) {
57 fArray[0] = fArray[fArray.count() - 1];
68 int index = fArray.count();
70 this->setIndex(fArray.count() - 1);
79 SkASSERT(index >= 0 && index < fArray.count());
82 if (index == fArray.count() - 1) {
86 fArray[index] = fArray[fArray.count() - 1];
99 SkASSERT(index >= 0 && index < fArray.count());
105 /** Gets the item at index i in the priority queue (for i < this->count()). at(0) is equivalent
113 if (fArray.count() > 1) {
115 for (int i = 0; i < fArray.count(); i++) {
162 if (child >= fArray.count()) {
168 if (child + 1 >= fArray.count()) {
198 SkASSERT(index < fArray.count());
206 for (int i = 1; i < fArray.count(); ++i) {