39     int count() const { return fArray.count(); }  in count()
42     const T& peek() const { return fArray[0]; }  in peek()
43     T& peek() { return fArray[0]; }  in peek()
48         SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })  in pop()
49         if (1 == fArray.count()) {  in pop()
50             fArray.pop();  in pop()
54         fArray[0] = fArray[fArray.count() - 1];  in pop()
56         fArray.pop();  in pop()
65         int index = fArray.count();  in insert()
66         *fArray.append() = entry;  in insert()
67         this->setIndex(fArray.count() - 1);  in insert()
76         SkASSERT(index >= 0 && index < fArray.count());  in remove()
78         SkDEBUGCODE(*INDEX(fArray[index]) = -1;)  in remove()
79         if (index == fArray.count() - 1) {  in remove()
80             fArray.pop();  in remove()
83         fArray[index] = fArray[fArray.count() - 1];  in remove()
84         fArray.pop();  in remove()
96         SkASSERT(index >= 0 && index < fArray.count());  in priorityDidChange()
104     T at(int i) const { return fArray[i]; }  in at()
110         if (fArray.count() > 1) {  in sort()
111             SkTQSort<T>(fArray.begin(), fArray.end() - 1, LESS);  in sort()
112             for (int i = 0; i < fArray.count(); i++) {  in sort()
140             if (LESS(fArray[index], fArray[p])) {  in percolateUpIfNecessary()
141                 SkTSwap(fArray[index], fArray[p]);  in percolateUpIfNecessary()
158             if (child >= fArray.count()) {  in percolateDownIfNecessary()
164             if (child + 1 >= fArray.count()) {  in percolateDownIfNecessary()
166                 if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
167                     SkTSwap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
172             } else if (LESS(fArray[child + 1], fArray[child])) {  in percolateDownIfNecessary()
178             if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
179                 SkTSwap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
192         SkASSERT(index < fArray.count());  in setIndex()
194             *INDEX(fArray[index]) = index;  in setIndex()
200         for (int i = 1; i < fArray.count(); ++i) {
203                 SkASSERT(!(LESS(fArray[i], fArray[p])));
204                 SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
210     SkTDArray<T> fArray;  variable