Home
last modified time | relevance | path

Searched refs:VertexList (Results 1 – 5 of 5) sorted by relevance

/external/skia/src/gpu/
DGrAATriangulator.h36 void apply(VertexList* mesh, const Comparator&, EventList* events, const GrAATriangulator*);
56 void extractBoundaries(const VertexList& inMesh, VertexList* innerVertices,
65 void strokeBoundary(EdgeList* boundary, VertexList* innerMesh, const Comparator&) const;
68 Poly* tessellate(const VertexList& mesh, const Comparator&) const override;
75 void connectPartners(VertexList* mesh, const Comparator&) const;
76 void removeNonBoundaryEdges(const VertexList& mesh) const;
78 bool collapseOverlapRegions(VertexList* mesh, const Comparator&, EventComparator comp) const;
81 mutable VertexList fOuterMesh;
DGrTriangulator.h45 struct VertexList;
60 void pathToContours(float tolerance, const SkRect& clipBounds, VertexList* contours,
64 void contoursToMesh(VertexList* contours, int contourCnt, VertexList* mesh,
68 static void SortedMerge(VertexList* front, VertexList* back, VertexList* result,
70 static void SortMesh(VertexList* vertices, const Comparator&);
78 SimplifyResult simplify(VertexList* mesh, const Comparator&) const;
81 virtual Poly* tessellate(const VertexList& vertices, const Comparator&) const;
134 void appendPointToContour(const SkPoint& p, VertexList* contour) const;
136 VertexList* contour) const;
138 SkScalar tolSqd, VertexList* contour, int pointsLeft) const;
[all …]
DGrTriangulator.cpp30 using VertexList = GrTriangulator::VertexList; typedef
113 void GrTriangulator::VertexList::insert(Vertex* v, Vertex* prev, Vertex* next) { in insert()
117 void GrTriangulator::VertexList::remove(Vertex* v) { in remove()
224 VertexList vertices; in emitMonotonePoly()
363 void GrTriangulator::appendPointToContour(const SkPoint& p, VertexList* contour) const { in appendPointToContour()
384 VertexList* contour) const { in appendQuadraticToContour()
407 const SkPoint& p3, SkScalar tolSqd, VertexList* contour, in generateCubicPoints()
434 VertexList* contours, bool* isLinear) const { in pathToContours()
438 VertexList* contour = contours; in pathToContours()
865 void GrTriangulator::mergeVertices(Vertex* src, Vertex* dst, VertexList* mesh, in mergeVertices()
[all …]
DGrAATriangulator.cpp27 using VertexList = GrTriangulator::VertexList; typedef
109 void GrAATriangulator::connectPartners(VertexList* mesh, const Comparator& c) const { in connectPartners()
142 void GrAATriangulator::removeNonBoundaryEdges(const VertexList& mesh) const { in removeNonBoundaryEdges()
245 void GrAATriangulator::Event::apply(VertexList* mesh, const Comparator& c, EventList* events, in apply()
308 bool GrAATriangulator::collapseOverlapRegions(VertexList* mesh, const Comparator& c, in collapseOverlapRegions()
410 void GrAATriangulator::strokeBoundary(EdgeList* boundary, VertexList* innerMesh, in strokeBoundary()
426 VertexList innerVertices; in strokeBoundary()
427 VertexList outerVertices; in strokeBoundary()
606 void GrAATriangulator::extractBoundaries(const VertexList& inMesh, VertexList* innerVertices, in extractBoundaries()
619 Poly* GrAATriangulator::tessellate(const VertexList& mesh, const Comparator& c) const { in tessellate()
[all …]
/external/skqp/src/gpu/
DGrTessellator.cpp227 struct VertexList { struct
228 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() function
229 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() argument
238 void append(const VertexList& list) { in append() argument
479 void apply(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc);
550 VertexList vertices; in emit()
671 void append_point_to_contour(const SkPoint& p, VertexList* contour, SkArenaAlloc& alloc) { in append_point_to_contour()
691 void append_quadratic_to_contour(const SkPoint pts[3], SkScalar toleranceSqd, VertexList* contour, in append_quadratic_to_contour()
719 VertexList* contour, in generate_cubic_points()
747 VertexList* contours, SkArenaAlloc& alloc, bool *isLinear) { in path_to_contours()
[all …]