| /third_party/skia/src/pathops/ |
| H A D | SkPathOpsConic.h | 69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects() function
70 return fPts.hullIntersects(quad, isLinear); in hullIntersects()
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() function
74 return fPts.hullIntersects(conic.fPts, isLinear); in hullIntersects()
77 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
161 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
163 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override {
164 return conic.hullIntersects(fConic, isLinear);
167 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override;
169 bool hullIntersects(cons
[all...] |
| H A D | SkPathOpsQuad.h | 81 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
82 bool hullIntersects(const SkDConic& , bool* isLinear) const;
83 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
153 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override {
154 return quad.hullIntersects(fQuad, isLinear);
157 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
158 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override;
160 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override {
161 return curve.hullIntersects(fQuad, isLinear);
|
| H A D | SkPathOpsCubic.h | 79 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const;
80 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
81 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
209 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const override;
210 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
212 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const override {
213 return cubic.hullIntersects(fCubic, isLinear);
216 bool hullIntersects(const SkTCurve& curve, bool* isLinear) const override {
217 return curve.hullIntersects(fCubi
[all...] |
| H A D | SkPathOpsTCurve.h | 29 virtual bool hullIntersects(const SkDQuad& , bool* isLinear) const = 0;
30 virtual bool hullIntersects(const SkDConic& , bool* isLinear) const = 0;
31 virtual bool hullIntersects(const SkDCubic& , bool* isLinear) const = 0;
32 virtual bool hullIntersects(const SkTCurve& , bool* isLinear) const = 0;
|
| H A D | SkPathOpsConic.cpp | 84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects() function in SkDConic
85 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
180 bool SkTConic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects() function in SkTConic
181 return quad.hullIntersects(fConic, isLinear); in hullIntersects()
184 bool SkTConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects() function in SkTConic
185 return cubic.hullIntersects(fConic, isLinear); in hullIntersects()
|
| H A D | SkPathOpsQuad.cpp | 47 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects() function in SkDQuad
85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() function in SkDQuad
86 return conic.hullIntersects(*this, isLinear); in hullIntersects()
89 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects() function in SkDQuad
90 return cubic.hullIntersects(*this, isLinear); in hullIntersects()
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() function in SkTQuad
407 return conic.hullIntersects(fQuad, isLinear); in hullIntersects()
410 bool SkTQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects() function in SkTQuad
411 return cubic.hullIntersects(fQuad, isLinear); in hullIntersects()
|
| H A D | SkPathOpsCubic.cpp | 149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects() function in SkDCubic
198 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const { in hullIntersects() function in SkDCubic
199 return hullIntersects(c2.fPts, SkDCubic::kPointCount, isLinear); in hullIntersects()
202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects() function in SkDCubic
203 return hullIntersects(quad.fPts, SkDQuad::kPointCount, isLinear); in hullIntersects()
206 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() function in SkDCubic
208 return hullIntersects(conic.fPts, isLinear); in hullIntersects()
742 bool SkTCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const {
743 return quad.hullIntersects(fCubic, isLinear);
746 bool SkTCubic::hullIntersects(cons
[all...] |
| H A D | SkPathOpsTSect.cpp | 181 if (fPart->hullIntersects(*opp->fPart, &linear)) { in hullCheck()
|