Searched refs:contourCount (Results 1 – 6 of 6) sorted by relevance
66 int contourCount = 0; in SubsetContours() local78 ++contourCount; in SubsetContours()86 contourCount += foundCurve; in SubsetContours()87 for (int index = 0; index < contourCount; ++index) { in SubsetContours()90 fTries = contourCount; in SubsetContours()99 int contourCount = 0; in getSubsetPath() local134 if (++contourCount >= fSelected.count()) { in getSubsetPath()137 enabled = fSelected[contourCount]; in getSubsetPath()
17 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsLines() local18 for (int cIndex = 0; cIndex < contourCount; ++cIndex) { in testTightBoundsLines()62 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsQuads() local63 for (int cIndex = 0; cIndex < contourCount; ++cIndex) { in testTightBoundsQuads()
68 int contourCount = 0; in SubsetContours() local80 ++contourCount; in SubsetContours()88 contourCount += foundCurve; in SubsetContours()89 for (int index = 0; index < contourCount; ++index) { in SubsetContours()92 fTries = contourCount; in SubsetContours()104 int contourCount = 0; in getSubsetPath() local139 if (++contourCount >= fSelected.count()) { in getSubsetPath()142 enabled = fSelected[contourCount]; in getSubsetPath()
18 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsLines() local19 for (int cIndex = 0; cIndex < contourCount; ++cIndex) { in testTightBoundsLines()63 int contourCount = ran.nextRangeU(1, 10); in testTightBoundsQuads() local64 for (int cIndex = 0; cIndex < contourCount; ++cIndex) { in testTightBoundsQuads()
2239 int contourCount = 0; in computeConvexity() local2245 if (contourCount == 0) { in computeConvexity()2250 contourCount++; in computeConvexity()2255 if (contourCount == 1) { in computeConvexity()2261 contourCount++; in computeConvexity()
2514 int contourCount = 0; in internalGetConvexity() local2524 if (++contourCount > 1) { in internalGetConvexity()2830 int contourCount = 0; in internalGetConvexity() local2843 if (++contourCount > 1) { in internalGetConvexity()