Home
last modified time | relevance | path

Searched refs:convexity (Results 1 - 4 of 4) sorted by relevance

/third_party/skia/src/core/
H A DSkPath.cpp301 // Closing the current contour; but since convexity is a precondition, it's the only in conservativelyContainsRect()
568 SkPathConvexity convexity = this->getConvexityOrUnknown(); in isConvexityAccurate() local
569 if (convexity != SkPathConvexity::kUnknown) { in isConvexityAccurate()
571 if (conv != convexity) { in isConvexityAccurate()
582 SkPathConvexity convexity = this->getConvexityOrUnknown(); in getConvexity() local
583 if (convexity == SkPathConvexity::kUnknown) { in getConvexity()
584 convexity = this->computeConvexity(); in getConvexity()
586 SkASSERT(convexity != SkPathConvexity::kUnknown); in getConvexity()
587 return convexity; in getConvexity()
1274 outside their marks. A round rect may lose convexity a in arcTo()
1630 SkPathConvexity convexity = this->getConvexityOrUnknown(); transform() local
2300 SkPathConvexity convexity = Convexicator::BySign(points, pointCount); computeConvexity() local
[all...]
H A DSkPathBuilder.cpp188 auto convexity = SkPathConvexity::kUnknown; in make() local
194 convexity = SkPathConvexity::kConvex; in make()
199 convexity = SkPathConvexity::kConvex; in make()
206 convexity = fOverrideConvexity; in make()
209 // Wonder if we can combine convexity and dir internally... in make()
211 // Do we ever have direction w/o convexity, or viceversa (inside path)? in make()
213 auto path = SkPath(std::move(pr), fFillType, fIsVolatile, convexity, dir); in make()
564 outside their marks. A round rect may lose convexity as a result. If the input in arcTo()
/third_party/skia/include/core/
H A DSkPath.h41 Internally, SkPath lazily computes metrics likes bounds and convexity. Call
226 /** Returns true if the path is convex. If necessary, it will first compute the convexity.
1858 @return path's convexity type (convex or concave)
1869 /** Stores a convexity type for this path. This is what will be returned if
1871 * is called, the real convexity will be computed.
1875 void setConvexity(SkPathConvexity convexity);
/third_party/skia/tests/
H A DPathTest.cpp1315 bool convexity = copy.isConvex(); in check_convexity() local
1316 REPORTER_ASSERT(reporter, convexity == expectedConvexity); in check_convexity()
1972 // have no effect on convexity in test_conservativelyContains()
2661 // test persistence of the oval flag & convexity in test_flattening()
5525 * - convexity, isrect, isoval, ...
5526 * Axis-aligned shapes (rect, oval, rrect) should survive, including convexity if the matrix
5551 // force the issue (computing convexity) the first time. in survive()
5556 // a path's isa and convexity should survive assignment in survive()
5561 // a path's isa and convexity should identity transform in survive()
5569 // a path's isa should survive translation, convexity depend in survive()
[all...]

Completed in 18 milliseconds