Searched refs:indexInSort (Results 1 – 2 of 2) sorted by relevance
| /external/skqp/tests/ |
| D | IncrTopoSortTest.cpp | 18 int indexInSort() const { SkASSERT(fIndexInSort >= 0); return fIndexInSort; } in indexInSort() function in Node
42 REPORTER_ASSERT(reporter, dependedOn->indexInSort() < this->indexInSort()); in validate()
45 REPORTER_ASSERT(reporter, this->indexInSort() < dependent->indexInSort()); in validate()
51 return a->indexInSort() > b->indexInSort(); in CompareIndicesGT()
65 void setIndexInSort(int indexInSort) { fIndexInSort = indexInSort; } in setIndexInSort() argument
130 if ((*dependedOn)[i]->indexInSort() < dependent->indexInSort()) { in addEdges()
154 if ((*dependedOn)[i]->indexInSort() < lowerBound) { in addEdges()
159 this->dfs(dependent, (*dependedOn)[i]->indexInSort()); in addEdges()
162 lowerBound = SkTMin(dependent->indexInSort(), lowerBound); in addEdges()
213 REPORTER_ASSERT(fReporter, fNodes[i]->indexInSort() == i); in validate()
[all …]
|
| /external/skia/tests/ |
| D | IncrTopoSortTest.cpp | 18 int indexInSort() const { SkASSERT(fIndexInSort >= 0); return fIndexInSort; } in indexInSort() function in Node
42 REPORTER_ASSERT(reporter, dependedOn->indexInSort() < this->indexInSort()); in validate()
45 REPORTER_ASSERT(reporter, this->indexInSort() < dependent->indexInSort()); in validate()
51 return a->indexInSort() > b->indexInSort(); in CompareIndicesGT()
65 void setIndexInSort(int indexInSort) { fIndexInSort = indexInSort; } in setIndexInSort() argument
130 if ((*dependedOn)[i]->indexInSort() < dependent->indexInSort()) { in addEdges()
154 if ((*dependedOn)[i]->indexInSort() < lowerBound) { in addEdges()
159 this->dfs(dependent, (*dependedOn)[i]->indexInSort()); in addEdges()
162 lowerBound = SkTMin(dependent->indexInSort(), lowerBound); in addEdges()
213 REPORTER_ASSERT(fReporter, fNodes[i]->indexInSort() == i); in validate()
[all …]
|