36     SkTDPQueue(int reserve) { fArray.reserve(reserve); }  in SkTDPQueue()
45     int count() const { return fArray.size(); }  in count()
48     const T& peek() const { return fArray[0]; }  in peek()
49     T& peek() { return fArray[0]; }  in peek()
54         SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })  in pop()
55         if (1 == fArray.size()) {  in pop()
56             fArray.pop_back();  in pop()
60         fArray[0] = fArray[fArray.size() - 1];  in pop()
62         fArray.pop_back();  in pop()
71         int index = fArray.size();  in insert()
72         *fArray.append() = entry;  in insert()
73         this->setIndex(fArray.size() - 1);  in insert()
82         SkASSERT(index >= 0 && index < fArray.size());  in remove()
84         SkDEBUGCODE(*INDEX(fArray[index]) = -1;)  in remove()
85         if (index == fArray.size() - 1) {  in remove()
86             fArray.pop_back();  in remove()
89         fArray[index] = fArray[fArray.size() - 1];  in remove()
90         fArray.pop_back();  in remove()
102         SkASSERT(index >= 0 && index < fArray.size());  in priorityDidChange()
110     T at(int i) const { return fArray[i]; }  in at()
116         if (fArray.size() > 1) {  in sort()
117             SkTQSort<T>(fArray.begin(), fArray.end(), LESS);  in sort()
118             for (int i = 0; i < fArray.size(); i++) {  in sort()
146             if (LESS(fArray[index], fArray[p])) {  in percolateUpIfNecessary()
148                 swap(fArray[index], fArray[p]);  in percolateUpIfNecessary()
165             if (child >= fArray.size()) {  in percolateDownIfNecessary()
171             if (child + 1 >= fArray.size()) {  in percolateDownIfNecessary()
173                 if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
175                     swap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
180             } else if (LESS(fArray[child + 1], fArray[child])) {  in percolateDownIfNecessary()
186             if (LESS(fArray[child], fArray[index])) {  in percolateDownIfNecessary()
188                 swap(fArray[child], fArray[index]);  in percolateDownIfNecessary()
201         SkASSERT(index < fArray.size());  in setIndex()
203             *INDEX(fArray[index]) = index;  in setIndex()
209         for (int i = 1; i < fArray.size(); ++i) {
212                 SkASSERT(!(LESS(fArray[i], fArray[p])));
213                 SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
219     SkTDArray<T> fArray;  variable