Home
last modified time | relevance | path

Searched refs:kMaxIntersections (Results 1 – 8 of 8) sorted by relevance

/external/skqp/src/pathops/
DSkPathOpsConic.h17 static const int kMaxIntersections = 4; member
DSkPathOpsQuad.h24 static const int kMaxIntersections = 4; member
DSkPathOpsCubic.h19 static const int kMaxIntersections = 9; member
DSkPathOpsTSect.h2123 SkSTArray<TCurve::kMaxIntersections * 3, in finish()
2137 SkSTArray<TCurve::kMaxIntersections * 2, SkClosestRecord<TCurve, OppCurve>, true> fClosest;
2151 intersections->setMax(TCurve::kMaxIntersections + 4); // give extra for slop in BinarySearch()
2266 if (sect1->collapsed() > TCurve::kMaxIntersections) { in BinarySearch()
2430 SkOPOBJASSERT(intersections, intersections->used() <= TCurve::kMaxIntersections); in BinarySearch()
/external/skia/src/pathops/
DSkPathOpsConic.h17 static const int kMaxIntersections = 4; member
DSkPathOpsQuad.h24 static const int kMaxIntersections = 4; member
DSkPathOpsCubic.h19 static const int kMaxIntersections = 9; member
DSkPathOpsTSect.h2123 SkSTArray<TCurve::kMaxIntersections * 3, in finish()
2137 SkSTArray<TCurve::kMaxIntersections * 2, SkClosestRecord<TCurve, OppCurve>, true> fClosest;
2151 intersections->setMax(TCurve::kMaxIntersections + 4); // give extra for slop in BinarySearch()
2266 if (sect1->collapsed() > TCurve::kMaxIntersections) { in BinarySearch()
2430 SkOPOBJASSERT(intersections, intersections->used() <= TCurve::kMaxIntersections); in BinarySearch()