33     SkTDPQueue(int reserve) { fArray.setReserve(reserve); }  in SkTDPQueue()
42     int count() const { return fArray.count(); }  in count()
45     const T& peek() const { return fArray[0]; }  in peek()
46     T& peek() { return fArray[0]; }  in peek()
51         SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })  in pop()
52         if (1 == fArray.count()) {  in pop()
53             fArray.pop();  in pop()
57         fArray[0] = fArray[fArray.count() - 1];  in pop()
59         fArray.pop();  in pop()
68         int index = fArray.count();  in insert()
69         *fArray.append() = entry;  in insert()
70         this->setIndex(fArray.count() - 1);  in insert()
79         SkASSERT(index >= 0 && index < fArray.count());  in remove()
81         SkDEBUGCODE(*INDEX(fArray[index]) = -1;)  in remove()
82         if (index == fArray.count() - 1) {  in remove()
83             fArray.pop();  in remove()
86         fArray[index] = fArray[fArray.count() - 1];  in remove()
87         fArray.pop();  in remove()
99         SkASSERT(index >= 0 && index < fArray.count());  in priorityDidChange()
107     T at(int i) const { return fArray[i]; }  in at()
113         if (fArray.count() > 1) {  in sort()
114             SkTQSort<T>(fArray.begin(), fArray.end() - 1, LESS);  in sort()
115             for (int i = 0; i < fArray.count(); i++) {  in sort()
143             if (LESS(fArray[index], fArray[p])) {  in percolateUpIfNecessary()
145                 swap(fArray[index], fArray[p]);  in percolateUpIfNecessary()
162             if (child >= fArray.count()) {  in percolateDownIfNecessary()
168             if (child + 1 >= fArray.count()) {  in percolateDownIfNecessary()
170                 if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
172                     swap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
177             } else if (LESS(fArray[child + 1], fArray[child])) {  in percolateDownIfNecessary()
183             if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
185                 swap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
198         SkASSERT(index < fArray.count());  in setIndex()
200             *INDEX(fArray[index]) = index;  in setIndex()
206         for (int i = 1; i < fArray.count(); ++i) {
209                 SkASSERT(!(LESS(fArray[i], fArray[p])));
210                 SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
216     SkTDArray<T> fArray;  variable