Lines Matching defs:endCount
209 int endCount = fEndPtTs.count(); // all starts and ends
210 SkASSERT(endCount > 0);
211 SkASSERT(endCount == fPartials.count() * 2);
213 for (int index = 0; index < endCount; index += 2) {
223 for (int pIndex = 0; pIndex < endCount; pIndex++) {
266 int linkCount = endCount / 2; // number of partial contours
273 const int entries = endCount * (endCount - 1) / 2; // folded triangle
279 for (rIndex = 0; rIndex < endCount - 1; ++rIndex) {
281 for (iIndex = rIndex + 1; iIndex < endCount; ++iIndex) {
290 rRow += endCount;
298 int row = pair / endCount;
299 int col = pair - row * endCount;