3161         int numPoints = 0;  in test_range_iter()  local
3170                     expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3171                     path.moveTo(expectedPts[numPoints]);  in test_range_iter()
3172                     lastMoveToPt = expectedPts[numPoints];  in test_range_iter()
3173                     numPoints += 1;  in test_range_iter()
3179                         expectedPts[numPoints++] = lastMoveToPt;  in test_range_iter()
3183                     expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3184                     path.lineTo(expectedPts[numPoints]);  in test_range_iter()
3185                     numPoints += 1;  in test_range_iter()
3190                         expectedPts[numPoints++] = lastMoveToPt;  in test_range_iter()
3194                     expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3195                     expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3196                     path.quadTo(expectedPts[numPoints], expectedPts[numPoints + 1]);  in test_range_iter()
3197                     numPoints += 2;  in test_range_iter()
3202                         expectedPts[numPoints++] = lastMoveToPt;  in test_range_iter()
3206                     expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3207                     expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3208                     path.conicTo(expectedPts[numPoints], expectedPts[numPoints + 1],  in test_range_iter()
3210                     numPoints += 2;  in test_range_iter()
3215                         expectedPts[numPoints++] = lastMoveToPt;  in test_range_iter()
3219                     expectedPts[numPoints] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3220                     expectedPts[numPoints + 1] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3221                     expectedPts[numPoints + 2] = randomPts[(rand.nextU() >> 16) % 25];  in test_range_iter()
3222                     path.cubicTo(expectedPts[numPoints], expectedPts[numPoints + 1],  in test_range_iter()
3223                                  expectedPts[numPoints + 2]);  in test_range_iter()
3224                     numPoints += 3;  in test_range_iter()
3250                     REPORTER_ASSERT(reporter, numIterPts < numPoints);  in test_range_iter()
3256                     REPORTER_ASSERT(reporter, numIterPts < numPoints + 1);  in test_range_iter()
3264                     REPORTER_ASSERT(reporter, numIterPts < numPoints + 2);  in test_range_iter()
3272                     REPORTER_ASSERT(reporter, numIterPts < numPoints + 3);  in test_range_iter()
3287         REPORTER_ASSERT(reporter, numIterPts == numPoints);  in test_range_iter()
5048     const size_t numPoints = numMoves + 2 * numConics;  in DEF_TEST()  local
5052     REPORTER_ASSERT(reporter, path.countPoints() == numPoints);  in DEF_TEST()