Lines Matching defs:numPoints
2016 int numPoints = 0;
2025 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
2026 p.moveTo(expectedPts[numPoints]);
2027 lastMoveToPt = expectedPts[numPoints];
2028 numPoints += 1;
2034 expectedPts[numPoints++] = lastMoveToPt;
2038 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
2039 p.lineTo(expectedPts[numPoints]);
2040 numPoints += 1;
2045 expectedPts[numPoints++] = lastMoveToPt;
2049 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
2050 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
2051 p.quadTo(expectedPts[numPoints], expectedPts[numPoints + 1]);
2052 numPoints += 2;
2057 expectedPts[numPoints++] = lastMoveToPt;
2061 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
2062 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
2063 p.conicTo(expectedPts[numPoints], expectedPts[numPoints + 1],
2065 numPoints += 2;
2070 expectedPts[numPoints++] = lastMoveToPt;
2074 expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];
2075 expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];
2076 expectedPts[numPoints + 2] = randomPts[(rand.nextU() >> 16) % 25];
2077 p.cubicTo(expectedPts[numPoints], expectedPts[numPoints + 1],
2078 expectedPts[numPoints + 2]);
2079 numPoints += 3;
2106 REPORTER_ASSERT(reporter, numIterPts < numPoints);
2112 REPORTER_ASSERT(reporter, numIterPts < numPoints + 1);
2120 REPORTER_ASSERT(reporter, numIterPts < numPoints + 2);
2128 REPORTER_ASSERT(reporter, numIterPts < numPoints + 3);
2144 REPORTER_ASSERT(reporter, numIterPts == numPoints);
