/************************************************************************ ** ** @file ** @author Roman Telezhynskyi ** @date 22 11, 2016 ** ** @brief ** @copyright ** This source code is part of the Valentine project, a pattern making ** program, whose allow create and modeling patterns of clothing. ** Copyright (C) 2016 Valentina project ** All Rights Reserved. ** ** Valentina is free software: you can redistribute it and/or modify ** it under the terms of the GNU General Public License as published by ** the Free Software Foundation, either version 3 of the License, or ** (at your option) any later version. ** ** Valentina is distributed in the hope that it will be useful, ** but WITHOUT ANY WARRANTY; without even the implied warranty of ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ** GNU General Public License for more details. ** ** You should have received a copy of the GNU General Public License ** along with Valentina. If not, see . ** *************************************************************************/ #include "vpiecepath.h" #include "vpiecepath_p.h" #include "vcontainer.h" #include "../vgeometry/vpointf.h" #include "../vlayout/vabstractpiece.h" #include namespace { //--------------------------------------------------------------------------------------------------------------------- VSAPoint CurvePoint(VSAPoint candidate, const VContainer *data, const VPieceNode &node, const QVector &curvePoints) { if (node.GetTypeTool() == Tool::NodePoint) { const QPointF p = static_cast(*data->GeometricObject(node.GetId())); if (VAbstractCurve::IsPointOnCurve(curvePoints, p)) { candidate = VSAPoint(p); candidate.SetSAAfter(node.GetSAAfter(data, *data->GetPatternUnit())); candidate.SetSABefore(node.GetSABefore(data, *data->GetPatternUnit())); candidate.SetAngleType(node.GetAngleType()); } } return candidate; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint CurveStartPoint(VSAPoint candidate, const VContainer *data, const VPieceNode &node, const QVector &curvePoints) { if (node.GetTypeTool() == Tool::NodePoint) { return CurvePoint(candidate, data, node, curvePoints); } else { // See issue #620. Detail path not correct. Previous curve also should cut segment. const QSharedPointer curve = data->GeometricObject(node.GetId()); const QVector points = curve->GetPoints(); if (not points.isEmpty()) { QPointF end; // Last point for this curve show start of next segment node.GetReverse() ? end = points.first() : end = points.last(); if (VAbstractCurve::IsPointOnCurve(curvePoints, end)) { candidate = VSAPoint(end); } } } return candidate; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint CurveEndPoint(VSAPoint candidate, const VContainer *data, const VPieceNode &node, const QVector &curvePoints) { if (node.GetTypeTool() == Tool::NodePoint) { return CurvePoint(candidate, data, node, curvePoints); } else { // See issue #620. Detail path not correct. Previous curve also should cut segment. const QSharedPointer curve = data->GeometricObject(node.GetId()); const QVector points = curve->GetPoints(); if (not points.isEmpty()) { QPointF begin;// First point for this curve show finish of previous segment node.GetReverse() ? begin = points.last() : begin = points.first(); if (VAbstractCurve::IsPointOnCurve(curvePoints, begin)) { candidate = VSAPoint(begin); } } } return candidate; } //--------------------------------------------------------------------------------------------------------------------- /** * @brief indexOfNode return index in list node using id object. * @param list list nodes detail. * @param id object (arc, point, spline, splinePath) id. * @return index in list or -1 id can't find. */ int IndexOfNode(const QVector &list, quint32 id) { for (int i = 0; i < list.size(); ++i) { if (list.at(i).GetId() == id) { return i; } } qDebug()<<"Can't find node."; return -1; } } //--------------------------------------------------------------------------------------------------------------------- VPiecePath::VPiecePath() : d(new VPiecePathData) {} //--------------------------------------------------------------------------------------------------------------------- VPiecePath::VPiecePath(PiecePathType type) : d(new VPiecePathData(type)) {} //--------------------------------------------------------------------------------------------------------------------- VPiecePath::VPiecePath(const VPiecePath &path) : d (path.d) {} //--------------------------------------------------------------------------------------------------------------------- VPiecePath &VPiecePath::operator=(const VPiecePath &path) { if ( &path == this ) { return *this; } d = path.d; return *this; } //--------------------------------------------------------------------------------------------------------------------- VPiecePath::~VPiecePath() {} //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::Append(const VPieceNode &node) { d->m_nodes.append(node); } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::Clear() { d->m_nodes.clear(); } //--------------------------------------------------------------------------------------------------------------------- qint32 VPiecePath::CountNodes() const { return d->m_nodes.size(); } //--------------------------------------------------------------------------------------------------------------------- VPieceNode &VPiecePath::operator[](int indx) { return d->m_nodes[indx]; } //--------------------------------------------------------------------------------------------------------------------- const VPieceNode &VPiecePath::at(int indx) const { return d->m_nodes.at(indx); } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::GetNodes() const { return d->m_nodes; } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::SetNodes(const QVector &nodes) { d->m_nodes = nodes; } //--------------------------------------------------------------------------------------------------------------------- PiecePathType VPiecePath::GetType() const { return d->m_type; } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::SetType(PiecePathType type) { d->m_type = type; } //--------------------------------------------------------------------------------------------------------------------- QString VPiecePath::GetName() const { return d->m_name; } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::SetName(const QString &name) { d->m_name = name; } //--------------------------------------------------------------------------------------------------------------------- Qt::PenStyle VPiecePath::GetPenType() const { return d->m_penType; } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::SetPenType(const Qt::PenStyle &type) { d->m_penType = type; } //--------------------------------------------------------------------------------------------------------------------- bool VPiecePath::IsCutPath() const { return d->m_cut; } //--------------------------------------------------------------------------------------------------------------------- void VPiecePath::SetCutPath(bool cut) { d->m_cut = cut; } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::PathPoints(const VContainer *data) const { QVector points; for (int i = 0; i < CountNodes(); ++i) { if (at(i).IsExcluded()) { continue;// skip excluded node } switch (at(i).GetTypeTool()) { case (Tool::NodePoint): { const QSharedPointer point = data->GeometricObject(at(i).GetId()); points.append(static_cast(*point)); } break; case (Tool::NodeArc): case (Tool::NodeElArc): case (Tool::NodeSpline): case (Tool::NodeSplinePath): { const QSharedPointer curve = data->GeometricObject(at(i).GetId()); const QPointF begin = StartSegment(data, i, at(i).GetReverse()); const QPointF end = EndSegment(data, i, at(i).GetReverse()); points << curve->GetSegmentPoints(begin, end, at(i).GetReverse()); } break; default: qDebug()<<"Get wrong tool type. Ignore."<< static_cast(at(i).GetTypeTool()); break; } } return points; } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::PathNodePoints(const VContainer *data, bool showExcluded) const { QVector points; for (int i = 0; i < CountNodes(); ++i) { switch (at(i).GetTypeTool()) { case Tool::NodePoint: { if (showExcluded || not at(i).IsExcluded()) { const QSharedPointer point = data->GeometricObject(at(i).GetId()); points.append(*point); } } break; case Tool::NodeArc: case Tool::NodeElArc: case Tool::NodeSpline: case Tool::NodeSplinePath: default: break; } } return points; } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::SeamAllowancePoints(const VContainer *data, qreal width, bool reverse) const { SCASSERT(data != nullptr); QVector pointsEkv; for (int i = 0; i< d->m_nodes.size(); ++i) { const VPieceNode &node = d->m_nodes.at(i); switch (node.GetTypeTool()) { case (Tool::NodePoint): { pointsEkv.append(PreparePointEkv(node, data)); } break; case (Tool::NodeArc): case (Tool::NodeElArc): case (Tool::NodeSpline): case (Tool::NodeSplinePath): { const QSharedPointer curve = data->GeometricObject(node.GetId()); pointsEkv += CurveSeamAllowanceSegment(data, d->m_nodes, curve, i, node.GetReverse(), width); } break; default: qDebug()<<"Get wrong tool type. Ignore."<< static_cast(node.GetTypeTool()); break; } } if (reverse) { pointsEkv = VGObject::GetReversePoints(pointsEkv); } return pointsEkv; } //--------------------------------------------------------------------------------------------------------------------- QPainterPath VPiecePath::PainterPath(const VContainer *data) const { const QVector points = PathPoints(data); QPainterPath path; if (not points.isEmpty()) { path.addPolygon(QPolygonF(points)); path.setFillRule(Qt::WindingFill); } return path; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint VPiecePath::StartSegment(const VContainer *data, const QVector &nodes, int i, bool reverse) { if (i < 0 || i > nodes.size()-1) { return VSAPoint(); } const QSharedPointer curve = data->GeometricObject(nodes.at(i).GetId()); const QVector points = curve->GetPoints(); if (points.isEmpty()) { return VSAPoint(); } VSAPoint begin; reverse ? begin = VSAPoint(points.last()) : begin = VSAPoint(points.first()); if (nodes.size() > 1) { const int index = FindInLoopNotExcludedUp(i, nodes); if (index != i && index != -1) { begin = CurveStartPoint(begin, data, nodes.at(index), points); } } return begin; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint VPiecePath::EndSegment(const VContainer *data, const QVector &nodes, int i, bool reverse) { if (i < 0 || i > nodes.size()-1) { return VSAPoint(); } const QSharedPointer curve = data->GeometricObject(nodes.at(i).GetId()); const QVector points = curve->GetPoints(); if (points.isEmpty()) { return VSAPoint(); } VSAPoint end; reverse ? end = VSAPoint(points.first()) : end = VSAPoint(points.last()); if (nodes.size() > 2) { const int index = FindInLoopNotExcludedDown(i, nodes); if (index != i && index != -1) { end = CurveEndPoint(end, data, nodes.at(index), points); } } return end; } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::MissingNodes(const VPiecePath &path) const { if (d->m_nodes.size() == path.CountNodes()) //-V807 { return QVector(); } QSet set1; for (qint32 i = 0; i < d->m_nodes.size(); ++i) { set1.insert(d->m_nodes.at(i).GetId()); } QSet set2; for (qint32 j = 0; j < path.CountNodes(); ++j) { set2.insert(path.at(j).GetId()); } const QList set3 = set1.subtract(set2).toList(); QVector nodes; for (qint32 i = 0; i < set3.size(); ++i) { const int index = indexOfNode(set3.at(i)); if (index != -1) { nodes.append(d->m_nodes.at(index).GetId()); } } return nodes; } //--------------------------------------------------------------------------------------------------------------------- int VPiecePath::indexOfNode(quint32 id) const { return indexOfNode(d->m_nodes, id); } //--------------------------------------------------------------------------------------------------------------------- /** * @brief NodeOnEdge return nodes located on edge with index. * @param index index of edge. * @param p1 first node. * @param p2 second node. */ void VPiecePath::NodeOnEdge(quint32 index, VPieceNode &p1, VPieceNode &p2) const { const QVector list = ListNodePoint(); if (index > static_cast(list.size())) { qDebug()<<"Wrong edge index index ="<(index)); if (index + 1 > static_cast(list.size()) - 1) { p2 = list.at(0); } else { p2 = list.at(static_cast(index+1)); } } //--------------------------------------------------------------------------------------------------------------------- bool VPiecePath::Contains(quint32 id) const { for (int i = 0; i < d->m_nodes.size(); ++i) { if (d->m_nodes.at(i).GetId() == id) { return true; } } return false; } //--------------------------------------------------------------------------------------------------------------------- /** * @brief OnEdge checks if two poins located on the edge. Edge is line between two points. If between two points * located arcs or splines ignore this. * @param p1 id first point. * @param p2 id second point. * @return true - on edge, false - no. */ bool VPiecePath::OnEdge(quint32 p1, quint32 p2) const { const QVector list = ListNodePoint(); if (list.size() < 2) { qDebug()<<"Not enough points."; return false; } int i = IndexOfNode(list, p1); int j1 = 0, j2 = 0; if (i == list.size() - 1) { j1 = i-1; j2 = 0; } else if (i == 0) { j1 = list.size() - 1; j2 = i + 1; } else { j1 = i - 1; j2 = i + 1; } if (list.at(j1).GetId() == p2 || list.at(j2).GetId() == p2) { return true; } else { return false; } } //--------------------------------------------------------------------------------------------------------------------- /** * @brief Edge return edge index in detail. Edge is line between two points. If between two points * located arcs or splines ignore this. * @param p1 id first point. * @param p2 id second point. * @return edge index or -1 if points don't located on edge */ int VPiecePath::Edge(quint32 p1, quint32 p2) const { if (OnEdge(p1, p2) == false) { qDebug()<<"Points don't on edge."; return -1; } const QVector list = ListNodePoint(); int i = IndexOfNode(list, p1); int j = IndexOfNode(list, p2); int min = qMin(i, j); if (min == 0 && (i == list.size() - 1 || j == list.size() - 1)) { return list.size() - 1; } else { return min; } } //--------------------------------------------------------------------------------------------------------------------- /** * @brief listNodePoint return list nodes only with points. * @return list points node. */ QVector VPiecePath::ListNodePoint() const { QVector list; for (int i = 0; i < d->m_nodes.size(); ++i) //-V807 { if (d->m_nodes.at(i).GetTypeTool() == Tool::NodePoint) { list.append(d->m_nodes.at(i)); } } return list; } //--------------------------------------------------------------------------------------------------------------------- /** * @brief RemoveEdge return path without edge with index. * @param index idex of edge. * @return path without edge with index. */ VPiecePath VPiecePath::RemoveEdge(quint32 index) const { VPiecePath path(*this); path.Clear(); // Edge can be only segment. We ignore all curves inside segments. const quint32 edges = static_cast(ListNodePoint().size()); quint32 k = 0; for (quint32 i=0; iat(static_cast(k))); ++k; } else { VPieceNode p1; VPieceNode p2; this->NodeOnEdge(i, p1, p2); const int j1 = this->indexOfNode(p1.GetId()); int j2 = this->indexOfNode(p2.GetId()); if (j2 == 0) { j2 = this->CountNodes(); } for (int j=j1; jat(j)); ++k; } } } return path; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint VPiecePath::StartSegment(const VContainer *data, int i, bool reverse) const { return StartSegment(data, d->m_nodes, i, reverse); } //--------------------------------------------------------------------------------------------------------------------- VSAPoint VPiecePath::EndSegment(const VContainer *data, int i, bool reverse) const { return EndSegment(data, d->m_nodes, i, reverse); } //--------------------------------------------------------------------------------------------------------------------- QPointF VPiecePath::NodePreviousPoint(const VContainer *data, int i) const { if (i < 0 || i > d->m_nodes.size()-1) { return QPointF(); } if (d->m_nodes.size() > 1) { int index = 0; if (i == 0) { index = d->m_nodes.size()-1; } else { index = i-1; } const VPieceNode &node = d->m_nodes.at(index); switch (node.GetTypeTool()) { case (Tool::NodePoint): return static_cast(*data->GeometricObject(node.GetId())); case (Tool::NodeArc): case (Tool::NodeElArc): case (Tool::NodeSpline): case (Tool::NodeSplinePath): { const QSharedPointer curve = data->GeometricObject(node.GetId()); const VSAPoint begin = StartSegment(data, d->m_nodes, index, node.GetReverse()); const VSAPoint end = EndSegment(data, d->m_nodes, index, node.GetReverse()); const QVector points = curve->GetSegmentPoints(begin, end, node.GetReverse()); if (points.size() > 1) { return points.at(points.size()-2); } } break; default: qDebug()<<"Get wrong tool type. Ignore."<< static_cast(node.GetTypeTool()); break; } } return QPointF(); } //--------------------------------------------------------------------------------------------------------------------- QPointF VPiecePath::NodeNextPoint(const VContainer *data, int i) const { QPointF point; if (i < 0 || i > d->m_nodes.size()-1) { return point; } if (d->m_nodes.size() > 1) { int index = 0; if (i == d->m_nodes.size() - 1) { index = 0; } else { index = i+1; } const VPieceNode &node = d->m_nodes.at(index); switch (node.GetTypeTool()) { case (Tool::NodePoint): return static_cast(*data->GeometricObject(node.GetId())); case (Tool::NodeArc): case (Tool::NodeElArc): case (Tool::NodeSpline): case (Tool::NodeSplinePath): { const QSharedPointer curve = data->GeometricObject(node.GetId()); const VSAPoint begin = StartSegment(data, d->m_nodes, index, node.GetReverse()); const VSAPoint end = EndSegment(data, d->m_nodes, index, node.GetReverse()); const QVector points = curve->GetSegmentPoints(begin, end, node.GetReverse()); if (points.size() > 1) { return points.at(1); } } break; default: qDebug()<<"Get wrong tool type. Ignore."<< static_cast(node.GetTypeTool()); break; } } return point; } //--------------------------------------------------------------------------------------------------------------------- int VPiecePath::indexOfNode(const QVector &nodes, quint32 id) { for (int i = 0; i < nodes.size(); ++i) { if (nodes.at(i).GetId() == id) { return i; } } qDebug()<<"Can't find node."; return -1; } //--------------------------------------------------------------------------------------------------------------------- int VPiecePath::FindInLoopNotExcludedUp(int start, const QVector &nodes) { if (start < 0 || start >= nodes.size()) { return -1; } int i = (start == 0) ? nodes.size()-1 : start-1; if (i < 0 || i >= nodes.size()) { return -1; } int checked = 0; bool found = false; do { if (not nodes.at(i).IsExcluded()) { found = true; break; } ++checked; --i; if (i < 0) { i = nodes.size() - 1; } } while (checked < nodes.size()); return (not found) ? -1 : i; } //--------------------------------------------------------------------------------------------------------------------- int VPiecePath::FindInLoopNotExcludedDown(int start, const QVector &nodes) { if (start < 0 || start >= nodes.size()) { return -1; } int i = (start == nodes.size()-1) ? 0 : start+1; if (i < 0 || i >= nodes.size()) { return -1; } int checked = 0; bool found = false; do { if (not nodes.at(i).IsExcluded()) { found = true; break; } ++checked; ++i; if (i >= nodes.size()) { i = 0; } } while (checked < nodes.size()); return (not found) ? -1 : i; } //--------------------------------------------------------------------------------------------------------------------- VSAPoint VPiecePath::PreparePointEkv(const VPieceNode &node, const VContainer *data) { SCASSERT(data !=nullptr) const QSharedPointer point = data->GeometricObject(node.GetId()); VSAPoint p(point->toQPointF()); p.SetSAAfter(node.GetSAAfter(data, *data->GetPatternUnit())); p.SetSABefore(node.GetSABefore(data, *data->GetPatternUnit())); p.SetAngleType(node.GetAngleType()); return p; } //--------------------------------------------------------------------------------------------------------------------- QVector VPiecePath::CurveSeamAllowanceSegment(const VContainer *data, const QVector &nodes, const QSharedPointer &curve, int i, bool reverse, qreal width) { QVector pointsEkv; const VSAPoint begin = StartSegment(data, nodes, i, reverse); const VSAPoint end = EndSegment(data, nodes, i, reverse); const QVector points = curve->GetSegmentPoints(begin, end, reverse); if (points.isEmpty()) { return pointsEkv; } qreal w1 = begin.GetSAAfter(); qreal w2 = end.GetSABefore(); if (w1 < 0 && w2 < 0) {// no local widths for(int i = 0; i < points.size(); ++i) { VSAPoint p(points.at(i)); if (i == 0) { // first point p.SetSAAfter(begin.GetSAAfter()); p.SetSABefore(begin.GetSABefore()); p.SetAngleType(begin.GetAngleType()); } else if (i == points.size() - 1) { // last point p.SetSAAfter(end.GetSAAfter()); p.SetSABefore(end.GetSABefore()); p.SetAngleType(end.GetAngleType()); } pointsEkv.append(p); } } else { if (w1 < 0) { w1 = width; } if (w2 < 0) { w2 = width; } const qreal wDiff = w2 - w1;// Difference between to local widths const qreal fullLength = VAbstractCurve::PathLength(points); VSAPoint p(points.at(0));//First point in the list p.SetSAAfter(begin.GetSAAfter()); p.SetSABefore(begin.GetSABefore()); p.SetAngleType(begin.GetAngleType()); pointsEkv.append(p); qreal length = 0; // how much we handle for(int i = 1; i < points.size(); ++i) { p = VSAPoint(points.at(i)); if (i == points.size() - 1) {// last point p.SetSAAfter(end.GetSAAfter()); p.SetSABefore(end.GetSABefore()); p.SetAngleType(end.GetAngleType()); } else { length += QLineF(points.at(i-1), points.at(i)).length(); const qreal localWidth = w1 + wDiff*(length/fullLength); p.SetSAAfter(localWidth); p.SetSABefore(localWidth); // curve points have angle type by default } pointsEkv.append(p); } } return pointsEkv; }