Lines Matching refs:triangles
16 static void PrintTriangles(const SkTDArray<SkPoint> &triangles,
20 SkPoint *p = triangles.begin();
21 int n = triangles.count();
24 printf("%d Triangles:\n{\n", n);
41 const SkTDArray<SkPoint> &triangles) {
42 if (triangles.count() != numTriangles * 3) {
43 printf("Expected %d triangles, not %d\n",
44 numTriangles, triangles.count() / 3);
50 const SkScalar *t = &triangles[i * 3].fX;
61 printf("%d triangles differ\n", numErrors);
173 SkTDArray<SkPoint> triangles;
174 bool success = SkConcaveToTriangles(kNumStarVertices, star, &triangles);
175 PrintTriangles(triangles, kNumStarVertices, star, reporter);
176 success = CompareTriangleList(numRefTriangles, refTriangles, triangles)
204 SkTDArray<SkPoint> triangles;
205 bool success = SkConcaveToTriangles(kNumStarHoleVertices, star, &triangles);
206 PrintTriangles(triangles, kNumStarHoleVertices, star, reporter);
207 success = CompareTriangleList(numRefTriangles, refTriangles, triangles)
230 SkTDArray<SkPoint> triangles;
232 bool success = SkConcaveToTriangles(numVertices, plus, &triangles);
233 PrintTriangles(triangles, numVertices, plus, reporter);
234 success = CompareTriangleList(numRefTriangles, refTriangles, triangles)
273 SkTDArray<SkPoint> triangles;
275 bool success = SkConcaveToTriangles(numVertices, zipper, &triangles);
276 PrintTriangles(triangles, numVertices, zipper, reporter);
277 success = CompareTriangleList(numRefTriangles, refTriangles, triangles)
