Lines Matching refs:contours
523 // Stage 1: convert the input path to a set of linear contours (linked list of Vertices).
526 VertexList* contours, bool* isLinear) const {
530 VertexList* contour = contours;
536 this->appendPointToContour(quad[i], contours);
1105 void GrTriangulator::sanitizeContours(VertexList* contours, int contourCnt) const {
1106 for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) {
1159 // Stage 2: convert the contours to a mesh of edges connecting the vertices.
1161 void GrTriangulator::buildEdges(VertexList* contours, int contourCnt, VertexList* mesh,
1163 for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) {
1469 void GrTriangulator::contoursToMesh(VertexList* contours, int contourCnt, VertexList* mesh,
1473 Vertex* v = contours[i].fHead;
1481 this->sanitizeContours(contours, contourCnt);
1482 this->buildEdges(contours, contourCnt, mesh, c);
1504 Poly* GrTriangulator::contoursToPolys(VertexList* contours, int contourCnt) const {
1509 this->contoursToMesh(contours, contourCnt, &mesh, c);
1536 // We could theoretically be more aggressive about not counting empty contours, but we need to
1579 std::unique_ptr<VertexList[]> contours(new VertexList[contourCnt]);
1581 this->pathToContours(tolerance, clipBounds, contours.get(), isLinear);
1582 return this->contoursToPolys(contours.get(), contourCnt);