Lines Matching refs:fNodes
88 : fNodes(numNodesToReserve)
96 fNodes.push_back(tmp); // The graph gets the creation ref
97 tmp->setIndexInSort(fNodes.count()-1);
119 // invalid nodes from 'fNodes' and shifting valid nodes left to fill in the gaps. In this
122 // they are reintroduced to the 'fNodes' array but now in the appropriate position. The
152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region
174 for (int i = 0; i < fNodes.count(); ++i) {
175 (*actual) += fNodes[i]->id();
176 if (i < fNodes.count()-1) {
185 for (int i = 0; i < fNodes.count(); ++i) {
186 if (fNodes[i]) {
187 SkDebugf("%c ", fNodes[i]->id());
194 for (int i = 0; i < fNodes.count(); ++i) {
195 if (fNodes[i]) {
196 fNodes[i]->print();
212 for (int i = 0; i < fNodes.count(); ++i) {
213 REPORTER_ASSERT(fReporter, fNodes[i]->indexInSort() == i);
215 fNodes[i]->validate(fReporter);
239 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });
245 SkASSERT(!fNodes[index]);
246 fNodes[index] = node;
270 sk_sp<Node> node = fNodes[index];
274 // constraints. Remove it from 'fNodes' so non-violating nodes can be shifted
278 fNodes[index] = nullptr;
287 fNodes[index] = nullptr;
293 // that because the violating nodes were already removed from 'fNodes' there
306 SkTArray<sk_sp<Node>> fNodes;
309 sk_sp<Node> fNode; // This gets a ref bc, in 'shift' it will be pulled out of 'fNodes'
