Lines Matching defs:const
69 typedef bool (*CompareFunc)(const SkPoint& a, const SkPoint& b);
71 static bool sweep_lt_horiz(const SkPoint& a, const SkPoint& b) {
75 static bool sweep_lt_vert(const SkPoint& a, const SkPoint& b) {
79 bool GrTriangulator::Comparator::sweep_lt(const SkPoint& a, const SkPoint& b) const {
130 static const double kMaxLimit = (double) SK_ScalarMax;
133 static const double kNearZeroLimit = 16 * (double) std::numeric_limits<float>::min();
140 bool GrTriangulator::Line::intersect(const Line& other, SkPoint* point) const {
155 static bool edge_line_needs_recursion(const SkPoint& p0, const SkPoint& p1) {
167 static bool recursive_edge_intersect(const Line& u, SkPoint u0, SkPoint u1,
168 const Line& v, SkPoint v0, SkPoint v1,
204 const bool uNeedsSplit = edge_line_needs_recursion(u0, u1);
205 const bool vNeedsSplit = edge_line_needs_recursion(v0, v1);
250 bool GrTriangulator::Edge::intersect(const Edge& other, SkPoint* p, uint8_t* alpha) const {
261 const bool intersects = recursive_edge_intersect(
313 void* GrTriangulator::emitMonotonePoly(const MonotonePoly* monotonePoly, void* data) const {
361 void* data) const {
433 void* GrTriangulator::emitPoly(const Poly* poly, void *data) const {
444 static bool coincident(const SkPoint& a, const SkPoint& b) {
448 Poly* GrTriangulator::makePoly(Poly** head, Vertex* v, int winding) const {
455 void GrTriangulator::appendPointToContour(const SkPoint& p, VertexList* contour) const {
464 static SkScalar quad_error_at(const SkPoint pts[3], SkScalar t, SkScalar u) {
475 void GrTriangulator::appendQuadraticToContour(const SkPoint pts[3], SkScalar toleranceSqd,
476 VertexList* contour) const {
498 void GrTriangulator::generateCubicPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2,
499 const SkPoint& p3, SkScalar tolSqd, VertexList* contour,
500 int pointsLeft) const {
508 const SkPoint q[] = {
513 const SkPoint r[] = {
517 const SkPoint s = { SkScalarAve(r[0].fX, r[1].fX), SkScalarAve(r[0].fY, r[1].fY) };
525 void GrTriangulator::pathToContours(float tolerance, const SkRect& clipBounds,
526 VertexList* contours, bool* isLinear) const {
551 const SkPoint* quadPts = converter.computeQuads(pts, weight, toleranceSqd);
611 bool GrTriangulator::applyFillType(int winding) const {
620 const Comparator& c) const {
653 void GrTriangulator::Edge::insertAbove(Vertex* v, const Comparator& c) {
671 void GrTriangulator::Edge::insertBelow(Vertex* v, const Comparator& c) {
710 static void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, const Comparator& c) {
737 const Comparator& c) {
775 const Comparator& c) const {
789 const Comparator& c) const {
803 Vertex** current, const Comparator& c) const {
824 Vertex** current, const Comparator& c) const {
861 const Comparator& c) const {
882 const Comparator& c) const {
923 Vertex** current, const Comparator& c) const {
956 const Comparator& c, int windingScale) const {
969 const Comparator& c) const {
986 Vertex* GrTriangulator::makeSortedVertex(const SkPoint& p, uint8_t alpha, VertexList* mesh,
987 Vertex* reference, const Comparator& c) const {
1021 static SkPoint clamp(SkPoint p, SkPoint min, SkPoint max, const Comparator& c) {
1036 void GrTriangulator::computeBisector(Edge* edge1, Edge* edge2, Vertex* v) const {
1058 const Comparator& c) const {
1105 void GrTriangulator::sanitizeContours(VertexList* contours, int contourCnt) const {
1140 bool GrTriangulator::mergeCoincidentVertices(VertexList* mesh, const Comparator& c) const {
1162 const Comparator& c) const {
1195 const Comparator& c) {
1240 void VertexList::dump() const {
1260 static void validate_edge_pair(Edge* left, Edge* right, const Comparator& c) {
1282 static void validate_edge_list(EdgeList* edges, const Comparator& c) {
1297 const Comparator& c) const {
1353 Poly* GrTriangulator::tessellate(const VertexList& vertices, const Comparator&) const {
1470 const Comparator& c) const {
1485 void GrTriangulator::SortMesh(VertexList* vertices, const Comparator& c) {
1504 Poly* GrTriangulator::contoursToPolys(VertexList* contours, int contourCnt) const {
1505 const SkRect& pathBounds = fPath.getBounds();
1526 SkPathFillType overrideFillType) const {
1535 static int get_contour_count(const SkPath& path, SkScalar tolerance) {
1569 Poly* GrTriangulator::pathToPolys(float tolerance, const SkRect& clipBounds, bool* isLinear) const {
1597 int GrTriangulator::polysToTriangles(Poly* polys, GrEagerVertexAllocator* vertexAllocator) const {