| /third_party/skia/src/gpu/geometry/ |
| D | GrAATriangulator.h | 36 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;
|
| D | GrTriangulator.h | 48 struct VertexList;
63 void pathToContours(float tolerance, const SkRect& clipBounds, VertexList* contours,
67 void contoursToMesh(VertexList* contours, int contourCnt, VertexList* mesh,
71 static void SortedMerge(VertexList* front, VertexList* back, VertexList* result,
73 static void SortMesh(VertexList* vertices, const Comparator&);
81 SimplifyResult simplify(VertexList* mesh, const Comparator&) const;
84 virtual Poly* tessellate(const VertexList& vertices, const Comparator&) const;
137 void appendPointToContour(const SkPoint& p, VertexList* contour) const;
139 VertexList* contour) const;
141 SkScalar tolSqd, VertexList* contour, int pointsLeft) const;
[all …]
|
| D | GrTriangulator.cpp | 30 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()
316 VertexList vertices; in emitMonotonePoly()
455 void GrTriangulator::appendPointToContour(const SkPoint& p, VertexList* contour) const { in appendPointToContour()
476 VertexList* contour) const { in appendQuadraticToContour()
499 const SkPoint& p3, SkScalar tolSqd, VertexList* contour, in generateCubicPoints()
526 VertexList* contours, bool* isLinear) const { in pathToContours()
530 VertexList* contour = contours; in pathToContours()
968 void GrTriangulator::mergeVertices(Vertex* src, Vertex* dst, VertexList* mesh, in mergeVertices()
[all …]
|
| D | GrAATriangulator.cpp | 27 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 …]
|
| /third_party/flutter/skia/src/gpu/ |
| D | GrTessellator.cpp | 229 struct VertexList { struct
230 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() argument
231 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() function
240 void append(const VertexList& list) { in append() argument
496 void apply(VertexList* mesh, Comparator& c, EventList* events, SkArenaAlloc& alloc);
607 VertexList vertices; in emit()
728 void append_point_to_contour(const SkPoint& p, VertexList* contour, SkArenaAlloc& alloc) { in append_point_to_contour()
748 void append_quadratic_to_contour(const SkPoint pts[3], SkScalar toleranceSqd, VertexList* contour, in append_quadratic_to_contour()
776 VertexList* contour, in generate_cubic_points()
804 VertexList* contours, SkArenaAlloc& alloc, bool *isLinear) { in path_to_contours()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | hawick_circuits.hpp | 181 typedef typename ClosedMatrix::const_reference VertexList; in is_closed_to() typedef
182 VertexList closed_to_u = closed_[index_of(u)]; in is_closed_to()
205 typedef typename ClosedMatrix::reference VertexList; in unblock() typedef
208 VertexList closed_to_u = closed_[index_of(u)]; in unblock()
|
| D | tiernan_all_cycles.hpp | 264 typedef std::vector< Vertex > VertexList; in all_cycles_from_vertex() typedef
265 typedef std::vector< VertexList > ClosedMatrix; in all_cycles_from_vertex()
268 ClosedMatrix closed(num_vertices(g), VertexList()); in all_cycles_from_vertex()
|
| D | adjacency_matrix.hpp | 547 typedef integer_range< vertex_descriptor > VertexList; typedef in boost::adjacency_matrix
548 typedef typename VertexList::iterator vertex_iterator;
661 VertexList m_vertex_set;
|
| /third_party/boost/libs/graph/test/ |
| D | mcgregor_subgraphs_test.cpp | 254 typedef std::vector< Vertex > VertexList; in add_random_vertices() typedef
256 VertexList new_vertices; in add_random_vertices()
268 for (typename VertexList::const_iterator v_iter = new_vertices.begin(); in add_random_vertices()
|
| /third_party/boost/boost/graph/distributed/ |
| D | connected_components.hpp | 236 template <typename Graph, typename ParentMap, typename VertexList>
239 std::vector<VertexList>& parent_requests) in request_parent_map_entries()
283 for (typename VertexList::iterator v = parent_requests[i].begin(); in request_parent_map_entries()
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 2336 SeqVertexList >::type VertexList; typedef
2338 typedef typename VertexList::iterator vertex_iterator;
|