2016-11-03 16:59:53 +01:00
|
|
|
/************************************************************************
|
|
|
|
**
|
|
|
|
** @file
|
|
|
|
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
|
|
|
** @date 3 11, 2016
|
|
|
|
**
|
|
|
|
** @brief
|
|
|
|
** @copyright
|
2017-10-05 11:20:01 +02:00
|
|
|
** This source code is part of the Valentina project, a pattern making
|
2016-11-03 16:59:53 +01:00
|
|
|
** program, whose allow create and modeling patterns of clothing.
|
|
|
|
** Copyright (C) 2016 Valentina project
|
|
|
|
** <https://bitbucket.org/dismine/valentina> 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 <http://www.gnu.org/licenses/>.
|
|
|
|
**
|
|
|
|
*************************************************************************/
|
|
|
|
|
|
|
|
#include "vpiece.h"
|
|
|
|
#include "vpiece_p.h"
|
2019-05-08 14:19:03 +02:00
|
|
|
#include "vpassmark.h"
|
2016-11-03 19:15:53 +01:00
|
|
|
#include "../vgeometry/vpointf.h"
|
|
|
|
#include "../vgeometry/vabstractcurve.h"
|
2017-10-15 11:25:20 +02:00
|
|
|
#include "../vgeometry/vplacelabelitem.h"
|
2019-04-23 19:56:11 +02:00
|
|
|
#include "../vgeometry/varc.h"
|
2016-11-03 19:15:53 +01:00
|
|
|
#include "vcontainer.h"
|
2017-04-05 12:22:33 +02:00
|
|
|
#include "../vmisc/vabstractapplication.h"
|
2018-09-28 13:29:10 +02:00
|
|
|
#include "../ifc/exception/vexceptioninvalidnotch.h"
|
2016-11-03 19:15:53 +01:00
|
|
|
|
|
|
|
#include <QSharedPointer>
|
|
|
|
#include <QDebug>
|
2016-11-05 09:56:44 +01:00
|
|
|
#include <QPainterPath>
|
2016-11-03 16:59:53 +01:00
|
|
|
|
2017-01-31 17:09:18 +01:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
QVector<quint32> PieceMissingNodes(const QVector<quint32> &d1Nodes, const QVector<quint32> &d2Nodes)
|
|
|
|
{
|
|
|
|
if (d1Nodes.size() == d2Nodes.size()) //-V807
|
|
|
|
{
|
|
|
|
return QVector<quint32>();
|
|
|
|
}
|
|
|
|
|
|
|
|
QSet<quint32> set1;
|
|
|
|
for (qint32 i = 0; i < d1Nodes.size(); ++i)
|
|
|
|
{
|
|
|
|
set1.insert(d1Nodes.at(i));
|
|
|
|
}
|
|
|
|
|
|
|
|
QSet<quint32> set2;
|
|
|
|
for (qint32 j = 0; j < d2Nodes.size(); ++j)
|
|
|
|
{
|
|
|
|
set2.insert(d2Nodes.at(j));
|
|
|
|
}
|
|
|
|
|
|
|
|
const QList<quint32> set3 = set1.subtract(set2).toList();
|
|
|
|
QVector<quint32> r;
|
|
|
|
for (qint32 i = 0; i < set3.size(); ++i)
|
|
|
|
{
|
|
|
|
r.append(set3.at(i));
|
|
|
|
}
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
2017-03-28 12:09:00 +02:00
|
|
|
|
2017-03-30 12:59:10 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
bool IsPassmarksPossible(const QVector<VPieceNode> &path)
|
|
|
|
{
|
|
|
|
int countPointNodes = 0;
|
|
|
|
int countOthers = 0;
|
|
|
|
|
2018-04-03 13:36:38 +02:00
|
|
|
for (auto &node : path)
|
2017-03-30 12:59:10 +02:00
|
|
|
{
|
|
|
|
if (node.IsExcluded())
|
|
|
|
{
|
|
|
|
continue;// skip node
|
|
|
|
}
|
|
|
|
|
|
|
|
node.GetTypeTool() == Tool::NodePoint ? ++countPointNodes : ++countOthers;
|
|
|
|
}
|
|
|
|
|
|
|
|
return countPointNodes >= 3 || (countPointNodes >= 1 && countOthers >= 1);
|
|
|
|
}
|
2018-09-28 12:43:03 +02:00
|
|
|
|
2019-01-09 16:46:02 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<VPieceNode> RotatePath(const QVector<VPieceNode> &path, int index)
|
|
|
|
{
|
|
|
|
if (index < 0 || index >= path.size())
|
|
|
|
{
|
|
|
|
return path;
|
|
|
|
}
|
|
|
|
|
|
|
|
return path.mid(index) + path.mid(0, index);
|
2017-01-31 17:09:18 +01:00
|
|
|
}
|
2019-01-09 16:46:02 +01:00
|
|
|
} // anonymous namespace
|
2017-01-31 17:09:18 +01:00
|
|
|
|
2016-11-03 16:59:53 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VPiece::VPiece()
|
2016-11-24 20:26:51 +01:00
|
|
|
: VAbstractPiece(), d(new VPieceData(PiecePathType::PiecePath))
|
2016-11-03 16:59:53 +01:00
|
|
|
{}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VPiece::VPiece(const VPiece &piece)
|
2016-11-03 19:15:53 +01:00
|
|
|
: VAbstractPiece(piece), d (piece.d)
|
2016-11-03 16:59:53 +01:00
|
|
|
{}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VPiece &VPiece::operator=(const VPiece &piece)
|
|
|
|
{
|
|
|
|
if ( &piece == this )
|
|
|
|
{
|
|
|
|
return *this;
|
|
|
|
}
|
2016-11-03 19:15:53 +01:00
|
|
|
VAbstractPiece::operator=(piece);
|
2016-11-03 16:59:53 +01:00
|
|
|
d = piece.d;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
VPiece::~VPiece()
|
|
|
|
{}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-23 11:54:46 +01:00
|
|
|
VPiecePath VPiece::GetPath() const
|
2016-11-03 16:59:53 +01:00
|
|
|
{
|
2016-11-23 11:54:46 +01:00
|
|
|
return d->m_path;
|
2016-11-03 16:59:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-23 11:54:46 +01:00
|
|
|
VPiecePath &VPiece::GetPath()
|
2016-11-03 16:59:53 +01:00
|
|
|
{
|
2016-11-23 11:54:46 +01:00
|
|
|
return d->m_path;
|
2016-11-03 16:59:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-23 11:54:46 +01:00
|
|
|
void VPiece::SetPath(const VPiecePath &path)
|
2016-11-03 16:59:53 +01:00
|
|
|
{
|
2016-11-23 11:54:46 +01:00
|
|
|
d->m_path = path;
|
2016-11-03 16:59:53 +01:00
|
|
|
}
|
2016-11-03 19:15:53 +01:00
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPointF> VPiece::MainPathPoints(const VContainer *data) const
|
|
|
|
{
|
2016-11-23 11:54:46 +01:00
|
|
|
QVector<QPointF> points = GetPath().PathPoints(data);
|
2016-11-03 19:15:53 +01:00
|
|
|
points = CheckLoops(CorrectEquidistantPoints(points));//A path can contains loops
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
|
2019-02-11 14:00:32 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPointF> VPiece::UniteMainPathPoints(const VContainer *data) const
|
|
|
|
{
|
|
|
|
QVector<QPointF> points = VPiecePath::NodesToPoints(data, GetUnitedPath(data));
|
|
|
|
points = CheckLoops(CorrectEquidistantPoints(points));//A path can contains loops
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
|
2016-11-05 09:56:44 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-03-22 11:05:53 +01:00
|
|
|
QVector<VPointF> VPiece::MainPathNodePoints(const VContainer *data, bool showExcluded) const
|
2016-11-05 09:56:44 +01:00
|
|
|
{
|
2017-03-22 11:05:53 +01:00
|
|
|
return GetPath().PathNodePoints(data, showExcluded);
|
2016-11-05 09:56:44 +01:00
|
|
|
}
|
|
|
|
|
2016-11-10 13:06:09 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPointF> VPiece::SeamAllowancePoints(const VContainer *data) const
|
|
|
|
{
|
2019-01-09 16:46:02 +01:00
|
|
|
return SeamAllowancePointsWithRotation(data, -1);
|
2016-11-10 13:06:09 +01:00
|
|
|
}
|
|
|
|
|
2018-07-26 19:00:24 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPointF> VPiece::CuttingPathPoints(const VContainer *data) const
|
|
|
|
{
|
|
|
|
if (IsSeamAllowance() and not IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
return SeamAllowancePoints(data);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return MainPathPoints(data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-28 12:09:00 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2019-01-09 16:46:02 +01:00
|
|
|
QVector<QLineF> VPiece::PassmarksLines(const VContainer *data) const
|
2019-05-08 14:19:03 +02:00
|
|
|
{
|
|
|
|
QVector<VPassmark> passmarks = Passmarks(data);
|
|
|
|
QVector<QLineF> lines;
|
|
|
|
for(auto &passmark : passmarks)
|
|
|
|
{
|
|
|
|
if (not passmark.IsNull())
|
|
|
|
{
|
|
|
|
lines += passmark.FullPassmark(*this, data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return lines;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<VPassmark> VPiece::Passmarks(const VContainer *data) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-03-30 11:26:06 +02:00
|
|
|
const QVector<VPieceNode> unitedPath = GetUnitedPath(data);
|
|
|
|
if (not IsSeamAllowance() || not IsPassmarksPossible(unitedPath))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2019-05-08 14:19:03 +02:00
|
|
|
return QVector<VPassmark>();
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
2019-05-08 14:19:03 +02:00
|
|
|
QVector<VPassmark> passmarks;
|
2017-03-28 12:09:00 +02:00
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
for (int i = 0; i< unitedPath.size(); ++i)
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-03-30 11:26:06 +02:00
|
|
|
const VPieceNode &node = unitedPath.at(i);
|
2017-03-28 12:09:00 +02:00
|
|
|
if (node.IsExcluded() || not node.IsPassmark())
|
|
|
|
{
|
|
|
|
continue;// skip node
|
|
|
|
}
|
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
const int previousIndex = VPiecePath::FindInLoopNotExcludedUp(i, unitedPath);
|
|
|
|
const int nextIndex = VPiecePath::FindInLoopNotExcludedDown(i, unitedPath);
|
2017-03-28 12:09:00 +02:00
|
|
|
|
2019-01-09 16:46:02 +01:00
|
|
|
passmarks += CreatePassmark(unitedPath, previousIndex, i, nextIndex, data);
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return passmarks;
|
|
|
|
}
|
|
|
|
|
2018-04-02 15:49:53 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPainterPath> VPiece::CurvesPainterPath(const VContainer *data) const
|
|
|
|
{
|
|
|
|
return GetPath().CurvesPainterPath(data);
|
|
|
|
}
|
|
|
|
|
2016-11-05 09:56:44 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPainterPath VPiece::MainPathPath(const VContainer *data) const
|
|
|
|
{
|
2018-04-02 16:05:53 +02:00
|
|
|
return VPiece::MainPathPath(MainPathPoints(data));
|
2018-04-02 15:49:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2018-04-02 16:05:53 +02:00
|
|
|
QPainterPath VPiece::MainPathPath(const QVector<QPointF> &points)
|
2018-04-02 15:49:53 +02:00
|
|
|
{
|
2016-11-05 09:56:44 +01:00
|
|
|
QPainterPath path;
|
|
|
|
|
|
|
|
if (not points.isEmpty())
|
|
|
|
{
|
|
|
|
path.moveTo(points[0]);
|
|
|
|
for (qint32 i = 1; i < points.count(); ++i)
|
|
|
|
{
|
|
|
|
path.lineTo(points.at(i));
|
|
|
|
}
|
|
|
|
path.lineTo(points.at(0));
|
|
|
|
path.setFillRule(Qt::WindingFill);
|
|
|
|
}
|
|
|
|
|
|
|
|
return path;
|
|
|
|
}
|
|
|
|
|
2016-11-08 11:53:14 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-10 13:06:09 +01:00
|
|
|
QPainterPath VPiece::SeamAllowancePath(const VContainer *data) const
|
|
|
|
{
|
2017-08-05 10:03:19 +02:00
|
|
|
return SeamAllowancePath(SeamAllowancePoints(data));
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPainterPath VPiece::SeamAllowancePath(const QVector<QPointF> &points) const
|
|
|
|
{
|
2016-11-10 13:06:09 +01:00
|
|
|
QPainterPath ekv;
|
|
|
|
|
|
|
|
// seam allowence
|
2017-04-05 12:22:33 +02:00
|
|
|
if (IsSeamAllowance() && not IsSeamAllowanceBuiltIn())
|
2016-11-10 13:06:09 +01:00
|
|
|
{
|
2017-08-05 10:03:19 +02:00
|
|
|
if (not points.isEmpty())
|
2016-11-10 13:06:09 +01:00
|
|
|
{
|
2017-08-05 10:03:19 +02:00
|
|
|
ekv.moveTo(points.at(0));
|
|
|
|
for (qint32 i = 1; i < points.count(); ++i)
|
2016-11-10 13:06:09 +01:00
|
|
|
{
|
2017-08-05 10:03:19 +02:00
|
|
|
ekv.lineTo(points.at(i));
|
2016-11-10 13:06:09 +01:00
|
|
|
}
|
|
|
|
|
2019-08-06 15:38:32 +02:00
|
|
|
#if !defined(V_NO_ASSERT)
|
|
|
|
// uncomment for debug
|
|
|
|
// for (qint32 i = 0; i < points.count(); ++i)
|
|
|
|
// {
|
|
|
|
// ekv.addEllipse(points.at(i).x()-accuracyPointOnLine, points.at(i).y()-accuracyPointOnLine,
|
|
|
|
// accuracyPointOnLine*2., accuracyPointOnLine*2.);
|
|
|
|
// }
|
|
|
|
#endif
|
|
|
|
|
2016-11-10 13:06:09 +01:00
|
|
|
ekv.setFillRule(Qt::WindingFill);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ekv;
|
|
|
|
}
|
|
|
|
|
2017-03-28 12:09:00 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2019-01-09 16:46:02 +01:00
|
|
|
QPainterPath VPiece::PassmarksPath(const VContainer *data) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2019-01-09 16:46:02 +01:00
|
|
|
const QVector<QLineF> passmarks = PassmarksLines(data);
|
2017-03-28 12:09:00 +02:00
|
|
|
QPainterPath path;
|
|
|
|
|
|
|
|
// seam allowence
|
|
|
|
if (IsSeamAllowance())
|
|
|
|
{
|
|
|
|
if (not passmarks.isEmpty())
|
|
|
|
{
|
|
|
|
for (qint32 i = 0; i < passmarks.count(); ++i)
|
|
|
|
{
|
|
|
|
path.moveTo(passmarks.at(i).p1());
|
|
|
|
path.lineTo(passmarks.at(i).p2());
|
|
|
|
}
|
|
|
|
|
|
|
|
path.setFillRule(Qt::WindingFill);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return path;
|
|
|
|
}
|
|
|
|
|
2017-10-15 11:25:20 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QPainterPath VPiece::PlaceLabelPath(const VContainer *data) const
|
|
|
|
{
|
|
|
|
QPainterPath path;
|
2019-05-08 14:19:03 +02:00
|
|
|
for(auto placeLabel : d->m_placeLabels)
|
2017-10-15 11:25:20 +02:00
|
|
|
{
|
2019-05-08 14:19:03 +02:00
|
|
|
try
|
|
|
|
{
|
|
|
|
const auto label = data->GeometricObject<VPlaceLabelItem>(placeLabel);
|
|
|
|
if (label->IsVisible())
|
|
|
|
{
|
|
|
|
path.addPath(label->LabelShapePath());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
catch (const VExceptionBadId &e)
|
2017-10-15 11:25:20 +02:00
|
|
|
{
|
2019-05-08 14:19:03 +02:00
|
|
|
qWarning() << e.ErrorMessage();
|
2017-10-15 11:25:20 +02:00
|
|
|
}
|
|
|
|
}
|
2019-05-08 14:19:03 +02:00
|
|
|
path.setFillRule(Qt::WindingFill);
|
2017-10-15 11:25:20 +02:00
|
|
|
return path;
|
|
|
|
}
|
|
|
|
|
2019-02-23 17:43:06 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
bool VPiece::IsSeamAllowanceValid(const VContainer *data) const
|
|
|
|
{
|
2019-03-01 16:20:21 +01:00
|
|
|
if (IsSeamAllowance() && not IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
return VAbstractPiece::IsAllowanceValid(UniteMainPathPoints(data), SeamAllowancePoints(data));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
2019-02-23 17:43:06 +01:00
|
|
|
}
|
|
|
|
|
2016-11-09 13:11:58 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-09 14:53:22 +01:00
|
|
|
bool VPiece::IsInLayout() const
|
|
|
|
{
|
|
|
|
return d->m_inLayout;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetInLayout(bool inLayout)
|
|
|
|
{
|
|
|
|
d->m_inLayout = inLayout;
|
|
|
|
}
|
|
|
|
|
2016-11-23 17:40:27 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
bool VPiece::IsUnited() const
|
|
|
|
{
|
|
|
|
return d->m_united;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetUnited(bool united)
|
|
|
|
{
|
|
|
|
d->m_united = united;
|
|
|
|
}
|
|
|
|
|
2017-01-21 14:24:40 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QString VPiece::GetFormulaSAWidth() const
|
|
|
|
{
|
|
|
|
return d->m_formulaWidth;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetFormulaSAWidth(const QString &formula, qreal value)
|
|
|
|
{
|
|
|
|
SetSAWidth(value);
|
|
|
|
const qreal width = GetSAWidth();
|
2018-04-12 12:13:19 +02:00
|
|
|
width >= 0 ? d->m_formulaWidth = formula : d->m_formulaWidth = QLatin1Char('0');
|
2017-01-21 14:24:40 +01:00
|
|
|
}
|
|
|
|
|
2016-12-03 17:01:39 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> VPiece::GetInternalPaths() const
|
|
|
|
{
|
|
|
|
return d->m_internalPaths;
|
|
|
|
}
|
|
|
|
|
2017-01-31 15:26:28 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> &VPiece::GetInternalPaths()
|
|
|
|
{
|
|
|
|
return d->m_internalPaths;
|
|
|
|
}
|
|
|
|
|
2016-12-03 17:01:39 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetInternalPaths(const QVector<quint32> &iPaths)
|
|
|
|
{
|
|
|
|
d->m_internalPaths = iPaths;
|
|
|
|
}
|
|
|
|
|
2017-01-18 09:17:18 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-01-31 15:26:28 +01:00
|
|
|
QVector<CustomSARecord> VPiece::GetCustomSARecords() const
|
2017-01-18 09:17:18 +01:00
|
|
|
{
|
2017-01-31 15:26:28 +01:00
|
|
|
return d->m_customSARecords;
|
2017-01-18 09:17:18 +01:00
|
|
|
}
|
|
|
|
|
2016-11-25 13:19:44 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-01-31 15:26:28 +01:00
|
|
|
QVector<CustomSARecord> &VPiece::GetCustomSARecords()
|
2016-11-25 13:19:44 +01:00
|
|
|
{
|
|
|
|
return d->m_customSARecords;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetCustomSARecords(const QVector<CustomSARecord> &records)
|
|
|
|
{
|
|
|
|
d->m_customSARecords = records;
|
|
|
|
}
|
|
|
|
|
2017-01-18 09:17:18 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-01-31 15:26:28 +01:00
|
|
|
QVector<quint32> VPiece::GetPins() const
|
|
|
|
{
|
|
|
|
return d->m_pins;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> &VPiece::GetPins()
|
|
|
|
{
|
|
|
|
return d->m_pins;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetPins(const QVector<quint32> &pins)
|
2017-01-18 09:17:18 +01:00
|
|
|
{
|
2017-01-31 15:26:28 +01:00
|
|
|
d->m_pins = pins;
|
2017-01-18 09:17:18 +01:00
|
|
|
}
|
|
|
|
|
2017-10-15 11:25:20 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> VPiece::GetPlaceLabels() const
|
|
|
|
{
|
|
|
|
return d->m_placeLabels;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> &VPiece::GetPlaceLabels()
|
|
|
|
{
|
|
|
|
return d->m_placeLabels;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetPlaceLabels(const QVector<quint32> &labels)
|
|
|
|
{
|
|
|
|
d->m_placeLabels = labels;
|
|
|
|
}
|
|
|
|
|
2017-10-23 09:45:58 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QList<quint32> VPiece::Dependencies() const
|
|
|
|
{
|
|
|
|
QList<quint32> list = d->m_path.Dependencies();
|
2018-09-27 14:16:01 +02:00
|
|
|
list.reserve(list.size() + d->m_customSARecords.size() + d->m_internalPaths.size() + d->m_pins.size() +
|
|
|
|
d->m_placeLabels.size());
|
2017-10-23 09:45:58 +02:00
|
|
|
|
2018-04-03 10:15:58 +02:00
|
|
|
for (auto &record : d->m_customSARecords)
|
2017-10-23 09:45:58 +02:00
|
|
|
{
|
|
|
|
list.append(record.path);
|
|
|
|
}
|
|
|
|
|
2018-04-03 10:15:58 +02:00
|
|
|
for (auto &value : d->m_internalPaths)
|
2017-10-23 09:45:58 +02:00
|
|
|
{
|
|
|
|
list.append(value);
|
|
|
|
}
|
|
|
|
|
2018-04-03 10:15:58 +02:00
|
|
|
for (auto &value : d->m_pins)
|
2017-10-23 09:45:58 +02:00
|
|
|
{
|
|
|
|
list.append(value);
|
|
|
|
}
|
|
|
|
|
2018-04-03 10:15:58 +02:00
|
|
|
for (auto &value : d->m_placeLabels)
|
2017-10-23 09:45:58 +02:00
|
|
|
{
|
|
|
|
list.append(value);
|
|
|
|
}
|
|
|
|
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
2016-11-09 14:53:22 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-09 13:11:58 +01:00
|
|
|
/**
|
2016-11-25 14:35:52 +01:00
|
|
|
* @brief MissingNodes find missing nodes in detail. When we deleted object in detail and return this detail need
|
2016-11-09 13:11:58 +01:00
|
|
|
* understand, what nodes need make invisible.
|
|
|
|
* @param det changed detail.
|
|
|
|
* @return list with missing nodes.
|
|
|
|
*/
|
2016-11-25 15:12:33 +01:00
|
|
|
QVector<quint32> VPiece::MissingNodes(const VPiece &det) const
|
2016-11-09 13:11:58 +01:00
|
|
|
{
|
2016-11-28 09:47:36 +01:00
|
|
|
return d->m_path.MissingNodes(det.GetPath());
|
2016-11-09 13:11:58 +01:00
|
|
|
}
|
|
|
|
|
2016-11-25 15:12:33 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> VPiece::MissingCSAPath(const VPiece &det) const
|
|
|
|
{
|
2017-01-31 17:09:18 +01:00
|
|
|
QVector<quint32> oldCSARecords;
|
2016-11-25 15:12:33 +01:00
|
|
|
for (qint32 i = 0; i < d->m_customSARecords.size(); ++i)
|
|
|
|
{
|
2017-01-31 17:09:18 +01:00
|
|
|
oldCSARecords.append(d->m_customSARecords.at(i).path);
|
2016-11-25 15:12:33 +01:00
|
|
|
}
|
|
|
|
|
2017-01-31 17:09:18 +01:00
|
|
|
QVector<quint32> newCSARecords;
|
|
|
|
for (qint32 i = 0; i < det.GetCustomSARecords().size(); ++i)
|
2016-11-25 15:12:33 +01:00
|
|
|
{
|
2017-01-31 17:09:18 +01:00
|
|
|
newCSARecords.append(det.GetCustomSARecords().at(i).path);
|
2016-11-25 15:12:33 +01:00
|
|
|
}
|
|
|
|
|
2017-01-31 17:09:18 +01:00
|
|
|
return PieceMissingNodes(oldCSARecords, newCSARecords);
|
2016-11-25 15:12:33 +01:00
|
|
|
}
|
|
|
|
|
2016-11-11 16:55:02 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-12-03 17:01:39 +01:00
|
|
|
QVector<quint32> VPiece::MissingInternalPaths(const VPiece &det) const
|
|
|
|
{
|
2017-01-31 17:09:18 +01:00
|
|
|
return PieceMissingNodes(d->m_internalPaths, det.GetInternalPaths());
|
|
|
|
}
|
2016-12-03 17:01:39 +01:00
|
|
|
|
2017-01-31 17:09:18 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> VPiece::MissingPins(const VPiece &det) const
|
|
|
|
{
|
|
|
|
return PieceMissingNodes(d->m_pins, det.GetPins());
|
2016-12-03 17:01:39 +01:00
|
|
|
}
|
|
|
|
|
2017-10-15 11:25:20 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<quint32> VPiece::MissingPlaceLabels(const VPiece &det) const
|
|
|
|
{
|
|
|
|
return PieceMissingNodes(d->m_placeLabels, det.GetPlaceLabels());
|
|
|
|
}
|
|
|
|
|
2016-12-03 17:01:39 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-02-23 10:19:27 +01:00
|
|
|
void VPiece::SetPatternPieceData(const VPieceLabelData &data)
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
d->m_ppData = data;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief Returns full access to the pattern piece data object
|
|
|
|
* @return pattern piece data object
|
|
|
|
*/
|
2017-02-23 10:19:27 +01:00
|
|
|
VPieceLabelData &VPiece::GetPatternPieceData()
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_ppData;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief Returns the read only reference to the pattern piece data object
|
|
|
|
* @return pattern piece data object
|
|
|
|
*/
|
2017-02-23 10:19:27 +01:00
|
|
|
const VPieceLabelData &VPiece::GetPatternPieceData() const
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_ppData;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-02-23 10:26:25 +01:00
|
|
|
void VPiece::SetPatternInfo(const VPatternLabelData &info)
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
d->m_piPatternInfo = info;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief Returns full access to the pattern info geometry object
|
|
|
|
* @return pattern info geometry object
|
|
|
|
*/
|
2017-02-23 10:26:25 +01:00
|
|
|
VPatternLabelData &VPiece::GetPatternInfo()
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_piPatternInfo;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief Returns the read only reference to the pattern info geometry object
|
|
|
|
* @return pattern info geometry object
|
|
|
|
*/
|
2017-02-23 10:26:25 +01:00
|
|
|
const VPatternLabelData &VPiece::GetPatternInfo() const
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_piPatternInfo;
|
|
|
|
}
|
|
|
|
|
2018-01-25 22:53:53 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
void VPiece::SetGrainlineGeometry(const VGrainlineData &data)
|
|
|
|
{
|
|
|
|
d->m_glGrainline = data;
|
|
|
|
}
|
|
|
|
|
2017-01-12 14:51:08 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief VDetail::GetGrainlineGeometry full access to the grainline geometry object
|
|
|
|
* @return reference to grainline geometry object
|
|
|
|
*/
|
2017-02-23 10:33:17 +01:00
|
|
|
VGrainlineData &VPiece::GetGrainlineGeometry()
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_glGrainline;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
/**
|
|
|
|
* @brief VDetail::GetGrainlineGeometry returns the read-only reference to the grainline geometry object
|
|
|
|
* @return reference to grainline geometry object
|
|
|
|
*/
|
2017-02-23 10:33:17 +01:00
|
|
|
const VGrainlineData &VPiece::GetGrainlineGeometry() const
|
2017-01-12 14:51:08 +01:00
|
|
|
{
|
|
|
|
return d->m_glGrainline;
|
|
|
|
}
|
|
|
|
|
2019-01-09 16:46:02 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<QPointF> VPiece::SeamAllowancePointsWithRotation(const VContainer *data, int makeFirst) const
|
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr);
|
|
|
|
|
|
|
|
if (not IsSeamAllowance() || IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
return QVector<QPointF>();
|
|
|
|
}
|
|
|
|
|
|
|
|
const QVector<CustomSARecord> records = FilterRecords(GetValidRecords());
|
|
|
|
int recordIndex = -1;
|
|
|
|
bool insertingCSA = false;
|
|
|
|
const qreal width = ToPixel(GetSAWidth(), *data->GetPatternUnit());
|
|
|
|
const QVector<VPieceNode> unitedPath = makeFirst > 0 ? RotatePath(GetUnitedPath(data), makeFirst)
|
|
|
|
: GetUnitedPath(data);
|
|
|
|
|
|
|
|
QVector<VSAPoint> pointsEkv;
|
|
|
|
for (int i = 0; i< unitedPath.size(); ++i)
|
|
|
|
{
|
|
|
|
const VPieceNode &node = unitedPath.at(i);
|
|
|
|
if (node.IsExcluded())
|
|
|
|
{
|
|
|
|
continue;// skip excluded node
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (node.GetTypeTool())
|
|
|
|
{
|
|
|
|
case (Tool::NodePoint):
|
|
|
|
{
|
|
|
|
if (not insertingCSA)
|
|
|
|
{
|
|
|
|
pointsEkv.append(VPiecePath::PreparePointEkv(node, data));
|
|
|
|
|
|
|
|
recordIndex = IsCSAStart(records, node.GetId());
|
|
|
|
if (recordIndex != -1 && records.at(recordIndex).includeType == PiecePathIncludeType::AsCustomSA)
|
|
|
|
{
|
|
|
|
insertingCSA = true;
|
|
|
|
|
|
|
|
const VPiecePath path = data->GetPiecePath(records.at(recordIndex).path);
|
|
|
|
QVector<VSAPoint> r = path.SeamAllowancePoints(data, width, records.at(recordIndex).reverse);
|
|
|
|
|
|
|
|
for (int j = 0; j < r.size(); ++j)
|
|
|
|
{
|
|
|
|
r[j].SetAngleType(PieceNodeAngle::ByLengthCurve);
|
|
|
|
r[j].SetSABefore(0);
|
|
|
|
r[j].SetSAAfter(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
pointsEkv += r;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (records.at(recordIndex).endPoint == node.GetId())
|
|
|
|
{
|
|
|
|
insertingCSA = false;
|
|
|
|
recordIndex = -1;
|
|
|
|
|
|
|
|
pointsEkv.append(VPiecePath::PreparePointEkv(node, data));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case (Tool::NodeArc):
|
|
|
|
case (Tool::NodeElArc):
|
|
|
|
case (Tool::NodeSpline):
|
|
|
|
case (Tool::NodeSplinePath):
|
|
|
|
{
|
|
|
|
if (not insertingCSA)
|
|
|
|
{
|
|
|
|
const QSharedPointer<VAbstractCurve> curve = data->GeometricObject<VAbstractCurve>(node.GetId());
|
|
|
|
|
|
|
|
pointsEkv += VPiecePath::CurveSeamAllowanceSegment(data, unitedPath, curve, i, node.GetReverse(),
|
|
|
|
width);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
qDebug()<<"Get wrong tool type. Ignore."<< static_cast<char>(node.GetTypeTool());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Equidistant(pointsEkv, width, GetName());
|
|
|
|
}
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<VPieceNode> VPiece::GetUnitedPath(const VContainer *data) const
|
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr)
|
|
|
|
|
|
|
|
QVector<VPieceNode> united = d->m_path.GetNodes();
|
2017-04-05 12:22:33 +02:00
|
|
|
|
|
|
|
if (IsSeamAllowance() && IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
return united;
|
|
|
|
}
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
const QVector<CustomSARecord> records = FilterRecords(GetValidRecords());
|
|
|
|
|
|
|
|
for (int i = 0; i < records.size(); ++i)
|
|
|
|
{
|
|
|
|
if (records.at(i).includeType == PiecePathIncludeType::AsMainPath)
|
|
|
|
{
|
|
|
|
const int indexStartPoint = VPiecePath::indexOfNode(united, records.at(i).startPoint);
|
|
|
|
const int indexEndPoint = VPiecePath::indexOfNode(united, records.at(i).endPoint);
|
|
|
|
|
|
|
|
if (indexStartPoint == -1 || indexEndPoint == -1)
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2018-12-19 08:19:37 +01:00
|
|
|
QVector<VPieceNode> midBefore;
|
|
|
|
QVector<VPieceNode> midAfter;
|
|
|
|
if (indexStartPoint <= indexEndPoint)
|
|
|
|
{
|
|
|
|
midBefore = united.mid(0, indexStartPoint+1);
|
|
|
|
midAfter = united.mid(indexEndPoint, united.size() - midBefore.size());
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
midBefore = united.mid(indexEndPoint, indexStartPoint+1);
|
|
|
|
}
|
2017-03-30 11:26:06 +02:00
|
|
|
|
|
|
|
QVector<VPieceNode> customNodes = data->GetPiecePath(records.at(i).path).GetNodes();
|
|
|
|
if (records.at(i).reverse)
|
|
|
|
{
|
|
|
|
customNodes = VGObject::GetReversePoints(customNodes);
|
2017-04-05 12:22:33 +02:00
|
|
|
}
|
2017-03-30 11:26:06 +02:00
|
|
|
|
2017-04-05 12:22:33 +02:00
|
|
|
for (int j = 0; j < customNodes.size(); ++j)
|
|
|
|
{
|
2017-03-30 11:26:06 +02:00
|
|
|
// Additionally reverse all curves
|
2017-04-05 12:22:33 +02:00
|
|
|
if (records.at(i).reverse)
|
|
|
|
{
|
|
|
|
// don't make a check because node point will ignore the change
|
2017-03-30 11:26:06 +02:00
|
|
|
customNodes[j].SetReverse(not customNodes.at(j).GetReverse());
|
|
|
|
}
|
2017-04-05 12:22:33 +02:00
|
|
|
|
|
|
|
// If seam allowance is built in main path user will not see a passmark provided by piece path
|
|
|
|
if (IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
customNodes[j].SetPassmark(false);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
customNodes[j].SetMainPathNode(false);
|
|
|
|
}
|
2017-03-30 11:26:06 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
united = midBefore + customNodes + midAfter;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return united;
|
|
|
|
}
|
|
|
|
|
2017-01-12 14:51:08 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2016-11-29 13:10:53 +01:00
|
|
|
QVector<CustomSARecord> VPiece::GetValidRecords() const
|
2016-11-11 16:55:02 +01:00
|
|
|
{
|
2016-11-29 13:10:53 +01:00
|
|
|
QVector<CustomSARecord> records;
|
2018-09-27 14:16:01 +02:00
|
|
|
records.reserve(d->m_customSARecords.size());
|
2018-04-03 13:36:38 +02:00
|
|
|
for (auto &record : d->m_customSARecords)
|
2016-11-11 19:17:39 +01:00
|
|
|
{
|
2017-03-22 11:05:53 +01:00
|
|
|
const int indexStartPoint = d->m_path.indexOfNode(record.startPoint);
|
|
|
|
const int indexEndPoint = d->m_path.indexOfNode(record.endPoint);
|
2016-11-11 16:55:02 +01:00
|
|
|
|
2016-11-29 15:59:48 +01:00
|
|
|
if (record.startPoint > NULL_ID
|
|
|
|
&& record.path > NULL_ID
|
|
|
|
&& record.endPoint > NULL_ID
|
2017-03-22 11:05:53 +01:00
|
|
|
&& indexStartPoint != -1
|
|
|
|
&& not d->m_path.at(indexStartPoint).IsExcluded()
|
|
|
|
&& indexEndPoint != -1
|
2018-01-15 15:20:29 +01:00
|
|
|
&& not d->m_path.at(indexEndPoint).IsExcluded())
|
2016-11-11 19:17:39 +01:00
|
|
|
{
|
2016-11-29 13:10:53 +01:00
|
|
|
records.append(record);
|
2016-11-11 19:17:39 +01:00
|
|
|
}
|
|
|
|
}
|
2016-11-29 13:10:53 +01:00
|
|
|
return records;
|
|
|
|
}
|
2016-11-11 19:17:39 +01:00
|
|
|
|
2017-03-29 13:18:33 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
QVector<CustomSARecord> VPiece::FilterRecords(QVector<CustomSARecord> records) const
|
|
|
|
{
|
|
|
|
if (records.size() < 2)
|
|
|
|
{
|
|
|
|
return records;
|
|
|
|
}
|
|
|
|
|
2018-12-21 12:01:32 +01:00
|
|
|
QVector<VPieceNode> path = d->m_path.GetNodes();
|
|
|
|
QVector<CustomSARecord> filteredRecords;
|
|
|
|
for (auto record : qAsConst(records))
|
2017-03-29 13:18:33 +02:00
|
|
|
{
|
2018-12-21 12:01:32 +01:00
|
|
|
const int indexStartPoint = VPiecePath::indexOfNode(path, record.startPoint);
|
|
|
|
const int indexEndPoint = VPiecePath::indexOfNode(path, record.endPoint);
|
|
|
|
|
|
|
|
if (indexStartPoint == -1 || indexEndPoint == -1)
|
2017-03-29 13:18:33 +02:00
|
|
|
{
|
2018-12-21 12:01:32 +01:00
|
|
|
continue;
|
2017-03-29 13:18:33 +02:00
|
|
|
}
|
|
|
|
|
2018-12-21 12:01:32 +01:00
|
|
|
QVector<VPieceNode> midBefore;
|
|
|
|
QVector<VPieceNode> midAfter;
|
|
|
|
if (indexStartPoint <= indexEndPoint)
|
2017-03-29 13:18:33 +02:00
|
|
|
{
|
2018-12-21 12:01:32 +01:00
|
|
|
midBefore = path.mid(0, indexStartPoint+1);
|
|
|
|
midAfter = path.mid(indexEndPoint, path.size() - midBefore.size());
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
midBefore = path.mid(indexEndPoint, indexStartPoint+1);
|
2017-03-29 13:18:33 +02:00
|
|
|
}
|
|
|
|
|
2018-12-21 12:01:32 +01:00
|
|
|
path = midBefore + midAfter;
|
|
|
|
filteredRecords.append(record);
|
|
|
|
}
|
2017-03-29 13:18:33 +02:00
|
|
|
|
2018-12-21 12:01:32 +01:00
|
|
|
return filteredRecords;
|
2017-03-29 13:18:33 +02:00
|
|
|
}
|
|
|
|
|
2017-03-28 12:09:00 +02:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-03-30 11:26:06 +02:00
|
|
|
QVector<VSAPoint> VPiece::GetNodeSAPoints(const QVector<VPieceNode> &path, int index, const VContainer *data) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr)
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
if (index < 0 || index >= path.size())
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
return QVector<VSAPoint>();
|
|
|
|
}
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
const VPieceNode &node = path.at(index);
|
2017-03-28 12:09:00 +02:00
|
|
|
QVector<VSAPoint> points;
|
|
|
|
|
|
|
|
if (node.GetTypeTool() == Tool::NodePoint)
|
|
|
|
{
|
|
|
|
points.append(VPiecePath::PreparePointEkv(node, data));
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const QSharedPointer<VAbstractCurve> curve = data->GeometricObject<VAbstractCurve>(node.GetId());
|
|
|
|
const qreal width = ToPixel(GetSAWidth(), *data->GetPatternUnit());
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
points += VPiecePath::CurveSeamAllowanceSegment(data, path, curve, index, node.GetReverse(), width);
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
return points;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-03-30 11:26:06 +02:00
|
|
|
bool VPiece::GetPassmarkSAPoint(const QVector<VPieceNode> &path, int index, const VContainer *data,
|
|
|
|
VSAPoint &point) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr)
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
const QVector<VSAPoint> points = GetNodeSAPoints(path, index, data);
|
2017-03-28 12:09:00 +02:00
|
|
|
|
|
|
|
if (points.isEmpty() || points.size() > 1)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
point = points.first();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-04-25 19:48:32 +02:00
|
|
|
bool VPiece::GetPassmarkPreviousSAPoints(const QVector<VPieceNode> &path, int index, const VSAPoint &passmarkSAPoint,
|
2018-09-29 21:01:13 +02:00
|
|
|
const VContainer *data, VSAPoint &point, int passmarkIndex) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr)
|
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
const QVector<VSAPoint> points = GetNodeSAPoints(path, index, data);
|
2017-03-28 12:09:00 +02:00
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
if (points.isEmpty())
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-09-29 21:01:13 +02:00
|
|
|
const QString errorMsg = QObject::tr("Cannot calculate a notch for point '%1' in piece '%2'.")
|
|
|
|
.arg(VPiecePath::NodeName(path, passmarkIndex, data), GetName());
|
|
|
|
qApp->IsPedantic() ? throw VExceptionInvalidNotch(errorMsg) : qWarning() << errorMsg;
|
2017-04-25 19:48:32 +02:00
|
|
|
return false; // Something wrong
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool found = false;
|
2017-04-25 19:48:32 +02:00
|
|
|
int nodeIndex = points.size()-1;
|
2017-03-28 12:09:00 +02:00
|
|
|
do
|
|
|
|
{
|
2017-04-25 19:48:32 +02:00
|
|
|
const VSAPoint previous = points.at(nodeIndex);
|
2019-07-02 18:41:49 +02:00
|
|
|
QLineF line(passmarkSAPoint, previous);
|
|
|
|
if (line.length() >= ToPixel(1, Unit::Mm))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-04-25 19:48:32 +02:00
|
|
|
point = previous;
|
2017-03-28 12:09:00 +02:00
|
|
|
found = true;
|
|
|
|
}
|
|
|
|
--nodeIndex;
|
|
|
|
} while (nodeIndex >= 0 && not found);
|
|
|
|
|
|
|
|
if (not found)
|
|
|
|
{
|
2018-09-29 21:01:13 +02:00
|
|
|
// No warning here because of valid case of passmark collapse
|
2017-04-25 19:48:32 +02:00
|
|
|
return false; // Something wrong
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
2017-04-25 19:48:32 +02:00
|
|
|
return true;
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2019-01-09 16:46:02 +01:00
|
|
|
bool VPiece::GetPassmarkNextSAPoints(const QVector<VPieceNode> &path, int index, const VSAPoint &passmarkSAPoint,
|
2018-09-29 21:01:13 +02:00
|
|
|
const VContainer *data, VSAPoint &point, int passmarkIndex) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-04-25 19:48:32 +02:00
|
|
|
SCASSERT(data != nullptr)
|
|
|
|
|
|
|
|
const QVector<VSAPoint> points = GetNodeSAPoints(path, index, data);
|
2017-03-28 12:09:00 +02:00
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
if (points.isEmpty())
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-09-29 21:01:13 +02:00
|
|
|
const QString errorMsg = QObject::tr("Cannot calculate a notch for point '%1' in piece '%2'.")
|
|
|
|
.arg(VPiecePath::NodeName(path, passmarkIndex, data), GetName());
|
|
|
|
qApp->IsPedantic() ? throw VExceptionInvalidNotch(errorMsg) : qWarning() << errorMsg;
|
2017-04-25 19:48:32 +02:00
|
|
|
return false; // Something wrong
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool found = false;
|
|
|
|
int nodeIndex = 0;
|
|
|
|
do
|
|
|
|
{
|
2017-04-25 19:48:32 +02:00
|
|
|
const VSAPoint next = points.at(nodeIndex);
|
2019-07-02 18:41:49 +02:00
|
|
|
QLineF line(passmarkSAPoint, next);
|
|
|
|
if (line.length() >= ToPixel(1, Unit::Mm))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-04-25 19:48:32 +02:00
|
|
|
point = next;
|
2017-03-28 12:09:00 +02:00
|
|
|
found = true;
|
|
|
|
}
|
|
|
|
++nodeIndex;
|
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
} while (nodeIndex < points.size() && not found);
|
2017-03-28 12:09:00 +02:00
|
|
|
|
|
|
|
if (not found)
|
|
|
|
{
|
2018-09-29 21:01:13 +02:00
|
|
|
// No warning here because of valid case of passmark collapse
|
2017-04-25 19:48:32 +02:00
|
|
|
return false; // Something wrong
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
2017-04-25 19:48:32 +02:00
|
|
|
return true;
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2017-03-30 11:26:06 +02:00
|
|
|
bool VPiece::IsPassmarkVisible(const QVector<VPieceNode> &path, int passmarkIndex) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2017-03-30 11:26:06 +02:00
|
|
|
if (passmarkIndex < 0 || passmarkIndex >= path.size())
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
const VPieceNode &node = path.at(passmarkIndex);
|
2017-03-28 12:09:00 +02:00
|
|
|
if (node.GetTypeTool() != Tool::NodePoint || not node.IsPassmark() || node.IsExcluded())
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2017-04-05 12:22:33 +02:00
|
|
|
if (IsSeamAllowance() && IsSeamAllowanceBuiltIn())
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2017-03-28 12:09:00 +02:00
|
|
|
const QVector<CustomSARecord> records = FilterRecords(GetValidRecords());
|
|
|
|
if (records.isEmpty())
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-04-03 13:36:38 +02:00
|
|
|
for (auto &record : records)
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-04-03 13:36:38 +02:00
|
|
|
if (record.includeType == PiecePathIncludeType::AsCustomSA)
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-04-03 13:36:38 +02:00
|
|
|
const int indexStartPoint = VPiecePath::indexOfNode(path, record.startPoint);
|
|
|
|
const int indexEndPoint = VPiecePath::indexOfNode(path, record.endPoint);
|
2017-03-30 11:26:06 +02:00
|
|
|
if (passmarkIndex > indexStartPoint && passmarkIndex < indexEndPoint)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
2019-05-08 14:19:03 +02:00
|
|
|
VPassmark VPiece::CreatePassmark(const QVector<VPieceNode> &path, int previousIndex, int passmarkIndex, int nextIndex,
|
|
|
|
const VContainer *data) const
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
|
|
|
SCASSERT(data != nullptr);
|
|
|
|
|
2017-03-30 11:26:06 +02:00
|
|
|
if (not IsPassmarkVisible(path, passmarkIndex))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2019-05-08 14:19:03 +02:00
|
|
|
return VPassmark();
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
VSAPoint passmarkSAPoint;
|
2017-03-30 11:26:06 +02:00
|
|
|
if (not GetPassmarkSAPoint(path, passmarkIndex, data, passmarkSAPoint))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-09-28 13:29:10 +02:00
|
|
|
const QString errorMsg = QObject::tr("Cannot calculate a notch for point '%1' in piece '%2'.")
|
|
|
|
.arg(VPiecePath::NodeName(path, passmarkIndex, data), GetName());
|
|
|
|
qApp->IsPedantic() ? throw VExceptionInvalidNotch(errorMsg) : qWarning() << errorMsg;
|
2019-05-08 14:19:03 +02:00
|
|
|
return VPassmark();
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
VSAPoint previousSAPoint;
|
2018-09-29 21:01:13 +02:00
|
|
|
if (not GetPassmarkPreviousSAPoints(path, previousIndex, passmarkSAPoint, data, previousSAPoint, passmarkIndex))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-09-29 18:36:55 +02:00
|
|
|
// No check here because it will cover valid cases
|
2019-05-08 14:19:03 +02:00
|
|
|
return VPassmark(); // Something wrong
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
2017-04-25 19:48:32 +02:00
|
|
|
VSAPoint nextSAPoint;
|
2018-09-29 21:01:13 +02:00
|
|
|
if (not GetPassmarkNextSAPoints(path, nextIndex, passmarkSAPoint, data, nextSAPoint, passmarkIndex))
|
2017-03-28 12:09:00 +02:00
|
|
|
{
|
2018-09-29 18:36:55 +02:00
|
|
|
// No check here because it will cover valid cases
|
2019-05-08 14:19:03 +02:00
|
|
|
return VPassmark(); // Something wrong
|
|
|
|
}
|
|
|
|
|
|
|
|
if (passmarkSAPoint.IsManualPasskmarkLength() && passmarkSAPoint.GetPasskmarkLength() <= 0)
|
|
|
|
{
|
|
|
|
return VPassmark();
|
2017-03-28 12:09:00 +02:00
|
|
|
}
|
|
|
|
|
2019-01-09 16:46:02 +01:00
|
|
|
VPiecePassmarkData passmarkData;
|
|
|
|
passmarkData.previousSAPoint = previousSAPoint;
|
|
|
|
passmarkData.passmarkSAPoint = passmarkSAPoint;
|
|
|
|
passmarkData.nextSAPoint = nextSAPoint;
|
|
|
|
passmarkData.saWidth = ToPixel(GetSAWidth(), *data->GetPatternUnit());
|
|
|
|
passmarkData.nodeName = VPiecePath::NodeName(path, passmarkIndex, data);
|
|
|
|
passmarkData.pieceName = GetName();
|
|
|
|
passmarkData.passmarkLineType = path.at(passmarkIndex).GetPassmarkLineType();
|
|
|
|
passmarkData.passmarkAngleType = path.at(passmarkIndex).GetPassmarkAngleType();
|
2019-05-08 14:19:03 +02:00
|
|
|
passmarkData.isMainPathNode = path.at(passmarkIndex).IsMainPathNode();
|
|
|
|
passmarkData.isShowSecondPassmark = path.at(passmarkIndex).IsShowSecondPassmark();
|
|
|
|
passmarkData.passmarkIndex = passmarkIndex;
|
|
|
|
passmarkData.id = path.at(passmarkIndex).GetId();
|
2019-01-09 16:46:02 +01:00
|
|
|
|
2019-05-08 14:19:03 +02:00
|
|
|
return VPassmark(passmarkData);
|
2017-04-05 12:22:33 +02:00
|
|
|
}
|
|
|
|
|
2016-11-29 13:10:53 +01:00
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
|
|
int VPiece::IsCSAStart(const QVector<CustomSARecord> &records, quint32 id)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < records.size(); ++i)
|
|
|
|
{
|
|
|
|
if (records.at(i).startPoint == id)
|
2016-11-11 19:17:39 +01:00
|
|
|
{
|
2016-11-29 13:10:53 +01:00
|
|
|
return i;
|
2016-11-11 19:17:39 +01:00
|
|
|
}
|
2016-11-11 16:55:02 +01:00
|
|
|
}
|
2016-11-29 13:10:53 +01:00
|
|
|
|
|
|
|
return -1;
|
2016-11-11 16:55:02 +01:00
|
|
|
}
|