• Home
  • Raw
  • Download

Lines Matching refs:VertexList

235 struct VertexList {  struct
236 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() function
237 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() argument
246 void append(const VertexList& list) { in append() argument
500 VertexList vertices; in emit()
621 void append_point_to_contour(const SkPoint& p, VertexList* contour, SkArenaAlloc& alloc) { in append_point_to_contour()
641 void append_quadratic_to_contour(const SkPoint pts[3], SkScalar toleranceSqd, VertexList* contour, in append_quadratic_to_contour()
669 VertexList* contour, in generate_cubic_points()
697 VertexList* contours, SkArenaAlloc& alloc, bool *isLinear) { in path_to_contours()
702 VertexList* contour = contours; in path_to_contours()
1049 void merge_vertices(Vertex* src, Vertex* dst, VertexList* mesh, Comparator& c, in merge_vertices()
1082 VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { in check_for_intersection()
1139 void sanitize_contours(VertexList* contours, int contourCnt, bool approximate) { in sanitize_contours()
1140 for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) { in sanitize_contours()
1161 void merge_coincident_vertices(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { in merge_coincident_vertices()
1177 void build_edges(VertexList* contours, int contourCnt, VertexList* mesh, Comparator& c, in build_edges()
1179 for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) { in build_edges()
1191 void connect_partners(VertexList* outerVertices, Comparator& c, SkArenaAlloc& alloc) { in connect_partners()
1203 void sorted_merge(VertexList* front, VertexList* back, VertexList* result) { in sorted_merge()
1221 void sorted_merge(VertexList* front, VertexList* back, VertexList* result, Comparator& c) { in sorted_merge()
1238 void merge_sort(VertexList* vertices) { in merge_sort()
1254 VertexList front(vertices->fHead, slow); in merge_sort()
1255 VertexList back(slow->fNext, vertices->fTail); in merge_sort()
1267 void simplify(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { in simplify()
1329 bool is_complex(const VertexList& vertices) { in is_complex()
1371 Poly* tessellate(const VertexList& vertices, SkArenaAlloc& alloc) { in tessellate()
1478 void remove_non_boundary_edges(const VertexList& mesh, SkPath::FillType fillType, in remove_non_boundary_edges()
1572 void stroke_boundary(EdgeList* boundary, VertexList* innerMesh, VertexList* outerMesh, in stroke_boundary()
1585 VertexList innerVertices; in stroke_boundary()
1586 VertexList outerVertices; in stroke_boundary()
1671 void extract_boundaries(const VertexList& inMesh, VertexList* innerVertices, in extract_boundaries()
1672 VertexList* outerVertices, SkPath::FillType fillType, in extract_boundaries()
1687 void contours_to_mesh(VertexList* contours, int contourCnt, bool antialias, in contours_to_mesh()
1688 VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { in contours_to_mesh()
1703 void sort_mesh(VertexList* vertices, Comparator& c, SkArenaAlloc& alloc) { in sort_mesh()
1722 Poly* contours_to_polys(VertexList* contours, int contourCnt, SkPath::FillType fillType, in contours_to_polys()
1723 const SkRect& pathBounds, bool antialias, VertexList* outerMesh, in contours_to_polys()
1727 VertexList mesh; in contours_to_polys()
1733 VertexList innerMesh; in contours_to_polys()
1739 VertexList aaMesh; in contours_to_polys()
1769 VertexList* outerMesh) { in path_to_polys()
1774 std::unique_ptr<VertexList[]> contours(new VertexList[contourCnt]); in path_to_polys()
1804 int count_outer_mesh_points(const VertexList& outerMesh) { in count_outer_mesh_points()
1814 void* outer_mesh_to_triangles(const VertexList& outerMesh, const AAParams* aaParams, void* data) { in outer_mesh_to_triangles()
1843 VertexList outerMesh; in PathToTriangles()