/dports/www/firefox-esr/firefox-91.8.0/gfx/skia/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); in makeTestBase() 99 SkPoint fPt; member 108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 181 newHit->fPt = pt; in rayCheck() 206 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 210 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 214 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 218 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 287 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo() 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo() 163 SkPoint result = pt->fPt; in update() 165 result = fFirstPtT->fPt; in update() 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 222 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 286 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/skia/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); in makeTestBase() 99 SkPoint fPt; member 108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 181 newHit->fPt = pt; in rayCheck() 206 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 210 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 214 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 218 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 287 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo() 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo() 163 SkPoint result = pt->fPt; in update() 165 result = fFirstPtT->fPt; in update() 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 222 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 286 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); in makeTestBase() 99 SkPoint fPt; member 108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 181 newHit->fPt = pt; in rayCheck() 206 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 210 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 214 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 218 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 287 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo() 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo() 163 SkPoint result = pt->fPt; in update() 165 result = fFirstPtT->fPt; in update() 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 219 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 283 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
/dports/www/firefox/firefox-99.0/gfx/skia/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); in makeTestBase() 99 SkPoint fPt; member 108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 181 newHit->fPt = pt; in rayCheck() 206 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 210 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 214 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 218 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 287 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo() 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo() 163 SkPoint result = pt->fPt; in update() 165 result = fFirstPtT->fPt; in update() 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 222 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 286 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 93 fPt = segment->ptAtT(fT); in makeTestBase() 100 SkPoint fPt; member 109 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 182 newHit->fPt = pt; in rayCheck() 207 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 211 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 215 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 219 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 275 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 288 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
H A D | SkPathWriter.cpp | 121 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 123 fCurrent.lineTo(fDefer[1]->fPt); in lineTo() 141 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 143 fCurrent.moveTo(fFirstPtT->fPt); in moveTo() 163 SkPoint result = pt->fPt; in update() 165 result = fFirstPtT->fPt; in update() 180 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 181 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 219 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 283 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/skia/skia/src/pathops/ |
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 58 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining); in insert() 68 if (pt.roughlyEqual(fPt[index])) { in insert() 86 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 93 fPt[index] = pt; in insert() 103 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 136 fPt[0] = a.fPt[aIndex]; in merge() 137 fPt2[0] = b.fPt[bIndex]; in merge() 151 SkDVector best = fPt[result] - origin; in mostOutside() 152 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 92 fPt = segment->ptAtT(fT); in makeTestBase() 99 SkPoint fPt; member 108 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 181 newHit->fPt = pt; in rayCheck() 206 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 210 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 214 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 218 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 274 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 287 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/skia/skia/src/pathops/ |
H A D | SkPathWriter.cpp | 37 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY, weight); in conicTo() 46 pt1.fX, pt1.fY, pt2.fX, pt2.fY, pt3->fPt.fX, pt3->fPt.fY); in cubicTo() 120 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 140 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 149 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY); in quadTo() 151 fCurrent.quadTo(pt1, pt2->fPt); in quadTo() 172 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 173 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 214 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 235 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 56 fPt[index] = pt; in insert() 61 if (pt.roughlyEqual(fPt[index])) { in insert() 77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 84 fPt[index] = pt; in insert() 94 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 127 fPt[0] = a.fPt[aIndex]; in merge() 128 fPt2[0] = b.fPt[bIndex]; in merge() 142 SkDVector best = fPt[result] - origin; in mostOutside() 143 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 90 fPt = segment->ptAtT(fT); in makeTestBase() 97 SkPoint fPt; member 106 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 179 newHit->fPt = pt; in rayCheck() 204 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 208 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 212 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 216 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 272 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 285 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/skia/skia/src/pathops/ |
H A D | SkPathWriter.cpp | 37 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY, weight); in conicTo() 46 pt1.fX, pt1.fY, pt2.fX, pt2.fY, pt3->fPt.fX, pt3->fPt.fY); in cubicTo() 117 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1]->fPt.fX, fDefer[1]->fPt.fY); in lineTo() 137 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fFirstPtT->fPt.fX, fFirstPtT->fPt.fY); in moveTo() 146 pt1.fX, pt1.fY, pt2->fPt.fX, pt2->fPt.fY); in quadTo() 148 fCurrent.quadTo(pt1, pt2->fPt); in quadTo() 169 SkVector deferDxdy = fDefer[1]->fPt - fDefer[0]->fPt; in changedSlopes() 170 SkVector lineDxdy = ptT->fPt - fDefer[1]->fPt; in changedSlopes() 211 eStart->fPt.fX, eStart->fPt.fY, eEnd->fPt.fX, eEnd->fPt.fY); in assemble() 232 double dx = iPtT->fPt.fX - oPtT->fPt.fX; in assemble() [all …]
|
H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() 56 fPt[index] = pt; in insert() 61 if (pt.roughlyEqual(fPt[index])) { in insert() 77 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); in insert() 84 fPt[index] = pt; in insert() 90 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); in insert() 123 fPt[0] = a.fPt[aIndex]; in merge() 124 fPt2[0] = b.fPt[bIndex]; in merge() 138 SkDVector best = fPt[result] - origin; in mostOutside() 139 SkDVector test = fPt[index] - origin; in mostOutside() [all …]
|
H A D | SkPathOpsWinding.cpp | 90 fPt = segment->ptAtT(fT); in makeTestBase() 97 SkPoint fPt; member 106 SkScalar baseXY = pt_xy(base.fPt, dir); in rayCheck() 179 newHit->fPt = pt; in rayCheck() 204 return a->fPt.fX < b->fPt.fX; in hit_compare_x() 208 return b->fPt.fX < a->fPt.fX; in reverse_hit_compare_x() 212 return a->fPt.fY < b->fPt.fY; in hit_compare_y() 216 return b->fPt.fY < a->fPt.fY; in reverse_hit_compare_y() 269 hitBase.fT, hitBase.fPt.fX, hitBase.fPt.fY); in sortableTop() 282 hit->fPt.fX, hit->fPt.fY, hit->fSlope.fX, hit->fSlope.fY); in sortableTop() [all …]
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/columnstore/columnstore/dbcon/execplan/ |
H A D | outerjoinonfilter.cpp | 43 fPt(new ParseTree (*(pt.get()))), in OuterJoinOnFilter() 49 fPt (rhs.fPt), in OuterJoinOnFilter() 61 if (fPt.get()) in toString() 62 oss << fPt->toString(); in toString() 81 if (fPt.get() != NULL) in serialize() 82 ObjectReader::writeParseTree(fPt.get(), b); in serialize() 91 fPt.reset(ObjectReader::createParseTree(b)); in unserialize() 104 if (*(fPt.get()) != *(t.fPt.get())) in operator ==()
|
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/columnstore/columnstore/dbcon/execplan/ |
H A D | outerjoinonfilter.cpp | 43 fPt(new ParseTree (*(pt.get()))), in OuterJoinOnFilter() 49 fPt (rhs.fPt), in OuterJoinOnFilter() 61 if (fPt.get()) in toString() 62 oss << fPt->toString(); in toString() 81 if (fPt.get() != NULL) in serialize() 82 ObjectReader::writeParseTree(fPt.get(), b); in serialize() 91 fPt.reset(ObjectReader::createParseTree(b)); in unserialize() 104 if (*(fPt.get()) != *(t.fPt.get())) in operator ==()
|