Home
last modified time | relevance | path

Searched refs:isects (Results 1 – 25 of 43) sorted by relevance

12

/dports/converters/wkhtmltopdf/qt-5db36ec/tests/auto/qtessellator/
H A Doldtessellator.cpp367 for (int i = 0; i < isects.size()-1; ++i) { in old_tesselate_polygon()
369 isects[i].x = (edge->p1.x != edge->p2.x) ? in old_tesselate_polygon()
371 isects[i].edge = edge; in old_tesselate_polygon()
374 if (isects.size()%2 != 1) in old_tesselate_polygon()
378 qSort(&isects[0], &isects[isects.size()-1], compareIntersections); in old_tesselate_polygon()
385 for (int i = 0; i < isects.size()-1;) { in old_tesselate_polygon()
387 const QEdge *left = isects[i].edge; in old_tesselate_polygon()
389 winding += isects[i].edge->winding; in old_tesselate_polygon()
391 winding += isects[i].edge->winding; in old_tesselate_polygon()
392 right = isects[i].edge; in old_tesselate_polygon()
[all …]
/dports/graphics/xfig/xfig-3.2.8a/src/
H A De_chop.c431 isect_cb.isects = NULL; in chop_polyline()
506 int t_idx = isect_cb.isects[j].seg_idx; in chop_polyline()
536 if (isect_cb.isects) free(isect_cb.isects); in chop_polyline()
562 isect_cb.isects = NULL;; in chop_arc()
643 s_points[i].x = isect_cb.isects[i].x; in chop_arc()
644 s_points[i].y = isect_cb.isects[i].y; in chop_arc()
694 if (isect_cb.isects) free(isect_cb.isects); in chop_arc()
711 isect_cb.isects = NULL;; in chop_ellipse()
746 s_points[i].x = isect_cb.isects[i].x; in chop_ellipse()
747 s_points[i].y = isect_cb.isects[i].y; in chop_ellipse()
[all …]
H A Dw_intersect.h29 isects_s * isects; member
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/
H A Dclip.h159 EdgeIsect isects[6]; variable
361 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
364 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
386 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
389 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
411 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
414 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
552 EdgeIsect isects[6]; in Box() local
805 currVIdx = (*(hi.first)).second.isects[s].idx; in Box()
832 currVIdx = (*(hi.first)).second.isects[s].idx; in Box()
[all …]
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/
H A Dclip.h159 EdgeIsect isects[6]; variable
361 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
364 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
386 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
389 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
411 if (vClipped[i] == (*(hi.first)).second.isects[s].p) in Box()
414 vnfo.idx = (*(hi.first)).second.isects[s].idx; in Box()
552 EdgeIsect isects[6]; in Box() local
805 currVIdx = (*(hi.first)).second.isects[s].idx; in Box()
832 currVIdx = (*(hi.first)).second.isects[s].idx; in Box()
[all …]
/dports/graphics/krita/krita-4.4.8/libs/flake/tests/
H A DTestPathSegment.cpp172 QList<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
173 QCOMPARE(isects.count(), 1); in segmentIntersections()
178 QList<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
179 QCOMPARE(isects.count(), 1); in segmentIntersections()
185 QList<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
186 QCOMPARE(isects.count(), 1); in segmentIntersections()
191 QList<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
192 QCOMPARE(isects.count(), 1); in segmentIntersections()
197 QList<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
198 QCOMPARE(isects.count(), 2); in segmentIntersections()
/dports/editors/calligra/calligra-3.2.1/libs/flake/tests/
H A DTestPathSegment.cpp172 QVector<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
173 QCOMPARE(isects.count(), 1); in segmentIntersections()
178 QVector<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
179 QCOMPARE(isects.count(), 1); in segmentIntersections()
185 QVector<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
186 QCOMPARE(isects.count(), 1); in segmentIntersections()
191 QVector<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
192 QCOMPARE(isects.count(), 1); in segmentIntersections()
197 QVector<QPointF> isects = s1.intersections(s2); in segmentIntersections() local
198 QCOMPARE(isects.count(), 2); in segmentIntersections()
/dports/graphics/krita/krita-4.4.8/libs/flake/
H A DKoPathSegment.cpp296 QList<QPointF> isects; in linesIntersection() local
306 return isects; in linesIntersection()
314 return isects; in linesIntersection()
316 return isects; in linesIntersection()
321 return isects; in linesIntersection()
530 QList<QPointF> isects; in intersections() local
533 return isects; in intersections()
544 return isects; in intersections()
551 return isects; in intersections()
621 return isects; in intersections()
[all …]
H A DKoSnapStrategy.cpp260 QList<QPointF> isects = s1.intersections(s2); in snap() local
261 if (isects.count() == 1 && squareDistance(isects[0], mousePosition) < maxDistance) { in snap()
263 m_lines.append(QLineF(startPoints[0], isects[0])); in snap()
264 m_lines.append(QLineF(startPoints[1], isects[0])); in snap()
265 setSnappedPosition(isects[0]); in snap()
396 QList<QPointF> isects = s1.intersections(segments[j]); in snap() local
397 Q_FOREACH (const QPointF &point, isects) { in snap()
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/SLA/
H A DIndexedMesh.cpp216 std::array<std::pair<float, Vec3d>, 2> isects; in filter_hits() local
217 if (hole.get_intersections(sf, dirf, isects)) { in filter_hits()
219 … if (isects[0].first > 0.f) hole_isects.emplace_back(isects[0].first, isects[0].second, true); in filter_hits()
220 … if (isects[1].first > 0.f) hole_isects.emplace_back(isects[1].first, isects[1].second, false); in filter_hits()
/dports/editors/calligra/calligra-3.2.1/libs/flake/
H A DKoPathSegment.cpp532 QVector<QPointF> isects; in linesIntersection() local
542 return isects; in linesIntersection()
550 return isects; in linesIntersection()
552 return isects; in linesIntersection()
557 return isects; in linesIntersection()
768 QVector<QPointF> isects; in intersections() local
771 return isects; in intersections()
782 return isects; in intersections()
789 return isects; in intersections()
859 return isects; in intersections()
[all …]
H A DKoSnapStrategy.cpp263 QVector<QPointF> isects = s1.intersections(s2); in snap() local
264 if (isects.count() == 1 && squareDistance(isects[0], mousePosition) < maxDistance) { in snap()
266 m_lines.append(QLineF(startPoints[0], isects[0])); in snap()
267 m_lines.append(QLineF(startPoints[1], isects[0])); in snap()
268 setSnappedPosition(isects[0]); in snap()
399 QVector<QPointF> isects = s1.intersections(segments[j]); in snap() local
401 for (int a = 0; a < isects.count(); ++a) { in snap()
402 const QPointF& point(isects[a]); in snap()
/dports/graphics/py-geomdl/geomdl-5.2.10/geomdl/
H A D_tessellate.py350 isects = []
353 isects.append(isect)
355 if isects:
359 for isect in isects:
/dports/games/pioneer/pioneer-20210723/src/collider/
H A DGeomTree.cpp284 …rsect(int numRays, const vector3f &origin, const vector3f *dirs, int triIdx, isect_t *isects) const in RayTriIntersect()
306 if ((dist > 0) && (dist < isects[i].dist)) { in RayTriIntersect()
307 isects[i].dist = dist; in RayTriIntersect()
308 isects[i].triIdx = triIdx / 3; in RayTriIntersect()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/gui/painting/
H A Dqpainterpath.cpp1612 QVector< QList<int> > isects; in toFillPolygons() local
1613 isects.resize(count); in toFillPolygons()
1622 isects[j] << i; in toFillPolygons()
1631 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1632 printf("%d ", isects[i][j]); in toFillPolygons()
1646 int isect_k = isects[isect_j][k]; in toFillPolygons()
1648 isects[i] += isect_k; in toFillPolygons()
1651 isects[isect_j].clear(); in toFillPolygons()
1659 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1660 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-sqlite2/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-tds/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-sqlite3/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/devel/qt5-testlib/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-ibase/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-odbc/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-mysql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/databases/qt5-sqldrivers-pgsql/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]
/dports/net/qt5-network/kde-qtbase-5.15.2p263/src/gui/painting/
H A Dqpainterpath.cpp1720 QVector< QVector<int> > isects; in toFillPolygons() local
1721 isects.resize(count); in toFillPolygons()
1730 isects[j] << i; in toFillPolygons()
1739 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1740 printf("%d ", isects[i][j]); in toFillPolygons()
1748 const QVector<int> &current_isects = isects.at(i); in toFillPolygons()
1757 isects[i] += isect_k; in toFillPolygons()
1760 isects[isect_j].clear(); in toFillPolygons()
1768 for (int j = 0; j < isects[i].size(); ++j) { in toFillPolygons()
1769 printf("%d ", isects[i][j]); in toFillPolygons()
[all …]

12