Home
last modified time | relevance | path

Searched refs:fNodesThatDependOnMe (Results 1 – 2 of 2) sorted by relevance

/external/skqp/tests/
DIncrTopoSortTest.cpp30 if (fNodesThatDependOnMe.count()) { in print()
31 SkDebugf(" (%d) depend on me: ", fNodesThatDependOnMe.count()); in print()
32 for (Node* tmp : fNodesThatDependOnMe) { in print()
44 for (Node* dependent : fNodesThatDependOnMe) { in validate()
54 int numDependents() const { return fNodesThatDependOnMe.count(); } in numDependents()
56 SkASSERT(0 <= index && index < fNodesThatDependOnMe.count()); in dependent()
57 return fNodesThatDependOnMe[index]; in dependent()
73 fNodesThatDependOnMe.push_back(dependent); in addDependent()
78 SkTDArray<Node*> fNodesThatDependOnMe; // These ones must appear after this one member in Node
/external/skia/tests/
DIncrTopoSortTest.cpp30 if (fNodesThatDependOnMe.count()) { in print()
31 SkDebugf(" (%d) depend on me: ", fNodesThatDependOnMe.count()); in print()
32 for (Node* tmp : fNodesThatDependOnMe) { in print()
44 for (Node* dependent : fNodesThatDependOnMe) { in validate()
54 int numDependents() const { return fNodesThatDependOnMe.count(); } in numDependents()
56 SkASSERT(0 <= index && index < fNodesThatDependOnMe.count()); in dependent()
57 return fNodesThatDependOnMe[index]; in dependent()
73 fNodesThatDependOnMe.push_back(dependent); in addDependent()
78 SkTDArray<Node*> fNodesThatDependOnMe; // These ones must appear after this one member in Node