88             : fNodes(numNodesToReserve)  in Graph()
96         fNodes.push_back(tmp);       // The graph gets the creation ref  in addNode()
97         tmp->setIndexInSort(fNodes.count()-1);  in addNode()
152         int lowerBound = fNodes.count();  // 'lowerBound' tracks the left of the affected region  in addEdges()
174         for (int i = 0; i < fNodes.count(); ++i) {  in getActual()
175             (*actual) += fNodes[i]->id();  in getActual()
176             if (i < fNodes.count()-1) {  in getActual()
185         for (int i = 0; i < fNodes.count(); ++i) {  in print()
186             if (fNodes[i]) {  in print()
187                 SkDebugf("%c ", fNodes[i]->id());  in print()
194         for (int i = 0; i < fNodes.count(); ++i) {  in print()
195             if (fNodes[i]) {  in print()
196                 fNodes[i]->print();  in print()
212         for (int i = 0; i < fNodes.count(); ++i) {  in validate()
213             REPORTER_ASSERT(fReporter, fNodes[i]->indexInSort() == i);  in validate()
215             fNodes[i]->validate(fReporter);  in validate()
239         fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });  in dfs()
245         SkASSERT(!fNodes[index]);  in moveNodeInSort()
246         fNodes[index] = node;  in moveNodeInSort()
270             sk_sp<Node> node = fNodes[index];  in shift()
278                 fNodes[index] = nullptr;  in shift()
287                 fNodes[index] = nullptr;  in shift()
306     SkTArray<sk_sp<Node>> fNodes;  member in Graph