Lines Matching full:farray
32 int count() const { return fArray.count(); }
35 const T& peek() const { return fArray[0]; }
36 T& peek() { return fArray[0]; }
41 SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
42 if (1 == fArray.count()) {
43 fArray.pop();
47 fArray[0] = fArray[fArray.count() - 1];
49 fArray.pop();
58 int index = fArray.count();
59 *fArray.append() = entry;
60 this->setIndex(fArray.count() - 1);
69 SkASSERT(index >= 0 && index < fArray.count());
71 SkDEBUGCODE(*INDEX(fArray[index]) = -1;)
72 if (index == fArray.count() - 1) {
73 fArray.pop();
76 fArray[index] = fArray[fArray.count() - 1];
77 fArray.pop();
89 SkASSERT(index >= 0 && index < fArray.count());
97 T at(int i) const { return fArray[i]; }
120 if (LESS(fArray[index], fArray[p])) {
121 SkTSwap(fArray[index], fArray[p]);
138 if (child >= fArray.count()) {
144 if (child + 1 >= fArray.count()) {
146 if (LESS(fArray[child], fArray[index])) {
147 SkTSwap(fArray[child], fArray[index]);
152 } else if (LESS(fArray[child + 1], fArray[child])) {
158 if (LESS(fArray[child], fArray[index])) {
159 SkTSwap(fArray[child], fArray[index]);
172 SkASSERT(index < fArray.count());
174 *INDEX(fArray[index]) = index;
180 for (int i = 1; i < fArray.count(); ++i) {
183 SkASSERT(!(LESS(fArray[i], fArray[p])));
184 SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
190 SkTDArray<T> fArray;
