Home
last modified time | relevance | path

Searched defs:isConvex (Results 1 – 15 of 15) sorted by relevance

/external/skia/src/core/
DSkCoverageDelta.cpp86 void SkCoverageDeltaMask::convertCoverageToAlpha(bool isEvenOdd, bool isInverse, bool isConvex) { in convertCoverageToAlpha()
DSkScan_DAAPath.cpp331 bool isConvex = path.isConvex(); in DAAFillPath() local
DSkBlitter.cpp106 bool isEvenOdd, bool isInverse, bool isConvex) { in blitCoverageDeltas()
/external/skqp/src/core/
DSkCoverageDelta.cpp86 void SkCoverageDeltaMask::convertCoverageToAlpha(bool isEvenOdd, bool isInverse, bool isConvex) { in convertCoverageToAlpha()
DSkScan_DAAPath.cpp331 bool isConvex = path.isConvex(); in DAAFillPath() local
DSkBlitter.cpp105 bool isEvenOdd, bool isInverse, bool isConvex) { in blitCoverageDeltas()
/external/skqp/include/core/
DSkPath.h271 bool isConvex() const { in isConvex() function
/external/skia/include/core/
DSkPath.h271 bool isConvex() const { in isConvex() function
/external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/
DShadowPath.java240 protected boolean isConvex() { in isConvex() method in ShadowPath
/external/skia/src/gpu/ops/
DGrAAConvexTessellator.cpp875 bool GrAAConvexTessellator::Ring::isConvex(const GrAAConvexTessellator& tess) const { in isConvex() function in GrAAConvexTessellator::Ring
/external/skqp/src/gpu/ops/
DGrAAConvexTessellator.cpp875 bool GrAAConvexTessellator::Ring::isConvex(const GrAAConvexTessellator& tess) const { in isConvex() function in GrAAConvexTessellator::Ring
/external/skqp/src/utils/
DSkLua.cpp1314 bool isConvex = SkPath::kConvex_Convexity == get_obj<SkPath>(L, 1)->getConvexity(); in lpath_isConvex() local
/external/skia/src/utils/
DSkLua.cpp1314 bool isConvex = SkPath::kConvex_Convexity == get_obj<SkPath>(L, 1)->getConvexity(); in lpath_isConvex() local
/external/skia/tests/
DPathTest.cpp1337 bool isConvex = SkPathPriv::IsConvex(&points.front() + skip, points.size() - skip); in check_convexity() local
/external/skqp/tests/
DPathTest.cpp1337 bool isConvex = SkPathPriv::IsConvex(&points.front() + skip, points.size() - skip); in check_convexity() local