Refactoring. Prepare for support multithreading.
--HG-- branch : feature
This commit is contained in:
parent
8655460d6e
commit
62aa898742
101
src/libs/vlayout/vbestsquare.cpp
Normal file
101
src/libs/vlayout/vbestsquare.cpp
Normal file
|
@ -0,0 +1,101 @@
|
|||
/************************************************************************
|
||||
**
|
||||
** @file vbestsquare.cpp
|
||||
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
||||
** @date 21 1, 2015
|
||||
**
|
||||
** @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) 2015 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 "vbestsquare.h"
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VBestSquare::VBestSquare()
|
||||
:resI(0), resJ(0), resMatrix(QMatrix()), resSquare(LLONG_MAX), valideResult(false), resMirror(false),
|
||||
type (BestFrom::Rotation)
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VBestSquare::NewResult(qint64 square, int i, int j, const QTransform &matrix, bool mirror, BestFrom type)
|
||||
{
|
||||
if (square <= resSquare && square > 0 && type >= this->type)
|
||||
{
|
||||
resI = i;
|
||||
resJ = j;
|
||||
resMatrix = matrix;
|
||||
resSquare = square;
|
||||
valideResult = true;
|
||||
resMirror = mirror;
|
||||
this->type = type;
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VBestSquare::NewResult(const VBestSquare &best)
|
||||
{
|
||||
if (best.ValideResult())
|
||||
{
|
||||
NewResult(best.BestSquare(), best.GContourEdge(), best.DetailEdge(), best.Matrix(), best.Mirror(), best.Type());
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
qint64 VBestSquare::BestSquare() const
|
||||
{
|
||||
return resSquare;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VBestSquare::GContourEdge() const
|
||||
{
|
||||
return resI;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VBestSquare::DetailEdge() const
|
||||
{
|
||||
return resJ;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QTransform VBestSquare::Matrix() const
|
||||
{
|
||||
return resMatrix;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VBestSquare::ValideResult() const
|
||||
{
|
||||
return valideResult;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VBestSquare::Mirror() const
|
||||
{
|
||||
return resMirror;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
BestFrom VBestSquare::Type() const
|
||||
{
|
||||
return type;
|
||||
}
|
63
src/libs/vlayout/vbestsquare.h
Normal file
63
src/libs/vlayout/vbestsquare.h
Normal file
|
@ -0,0 +1,63 @@
|
|||
/************************************************************************
|
||||
**
|
||||
** @file vbestsquare.h
|
||||
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
||||
** @date 21 1, 2015
|
||||
**
|
||||
** @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) 2015 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/>.
|
||||
**
|
||||
*************************************************************************/
|
||||
|
||||
#ifndef VBESTSQUARE_H
|
||||
#define VBESTSQUARE_H
|
||||
|
||||
#include "vlayoutdef.h"
|
||||
|
||||
#include <QTransform>
|
||||
|
||||
class VBestSquare
|
||||
{
|
||||
public:
|
||||
VBestSquare();
|
||||
|
||||
void NewResult(qint64 square, int i, int j, const QTransform &matrix, bool mirror, BestFrom type);
|
||||
void NewResult(const VBestSquare &best);
|
||||
|
||||
qint64 BestSquare() const;
|
||||
int GContourEdge() const;
|
||||
int DetailEdge() const;
|
||||
QTransform Matrix() const;
|
||||
bool ValideResult() const;
|
||||
bool Mirror() const;
|
||||
BestFrom Type() const;
|
||||
|
||||
private:
|
||||
// All nedded information about best result
|
||||
int resI; // Edge of global contour
|
||||
int resJ; // Edge of detail
|
||||
QTransform resMatrix; // Matrix for rotation and translation detail
|
||||
qint64 resSquare; // Best square size (least). For begin set max value.
|
||||
bool valideResult;
|
||||
bool resMirror;
|
||||
BestFrom type;
|
||||
};
|
||||
|
||||
#endif // VBESTSQUARE_H
|
326
src/libs/vlayout/vcontour.cpp
Normal file
326
src/libs/vlayout/vcontour.cpp
Normal file
|
@ -0,0 +1,326 @@
|
|||
/************************************************************************
|
||||
**
|
||||
** @file vcontour.cpp
|
||||
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
||||
** @date 21 1, 2015
|
||||
**
|
||||
** @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) 2015 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 "vcontour.h"
|
||||
#include "vcontour_p.h"
|
||||
#include "vlayoutdetail.h"
|
||||
|
||||
#include <QPointF>
|
||||
#include <QLineF>
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VContour::VContour()
|
||||
:d(new VContourData())
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VContour::VContour(int height, int width)
|
||||
:d(new VContourData(height, width))
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VContour::VContour(const VContour &contour)
|
||||
:d (contour.d)
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VContour &VContour::operator=(const VContour &contour)
|
||||
{
|
||||
if ( &contour == this )
|
||||
{
|
||||
return *this;
|
||||
}
|
||||
d = contour.d;
|
||||
return *this;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VContour::~VContour()
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VContour::SetContour(const QVector<QPointF> &contour)
|
||||
{
|
||||
d->globalContour = contour;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VContour::GetContour() const
|
||||
{
|
||||
return d->globalContour;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
unsigned int VContour::GetShift() const
|
||||
{
|
||||
return d->shift;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VContour::SetShift(unsigned int shift)
|
||||
{
|
||||
d->shift = shift;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VContour::GetHeight() const
|
||||
{
|
||||
return d->paperHeight;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VContour::SetHeight(int height)
|
||||
{
|
||||
d->paperHeight = height;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VContour::GetWidth() const
|
||||
{
|
||||
return d->paperWidth;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VContour::SetWidth(int width)
|
||||
{
|
||||
d->paperWidth = width;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VContour::UniteWithContour(const VLayoutDetail &detail, int globalI, int detJ, BestFrom type) const
|
||||
{
|
||||
QVector<QPointF> newContour;
|
||||
if (d->globalContour.isEmpty())
|
||||
{
|
||||
AppendWhole(newContour, detail, detJ);
|
||||
}
|
||||
else
|
||||
{
|
||||
if (globalI <= 0 || globalI > EdgesCount())
|
||||
{
|
||||
return QVector<QPointF>();
|
||||
}
|
||||
|
||||
if (detJ <= 0 || detJ > detail.EdgesCount())
|
||||
{
|
||||
return QVector<QPointF>();
|
||||
}
|
||||
|
||||
int i2 = 0;
|
||||
if (globalI == d->globalContour.count())
|
||||
{
|
||||
i2 = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
i2 = globalI;
|
||||
}
|
||||
|
||||
int i=0;
|
||||
while(i < d->globalContour.count())
|
||||
{
|
||||
if (i == i2)
|
||||
{
|
||||
if (type == BestFrom::Rotation)
|
||||
{
|
||||
AppendWhole(newContour, detail, detJ);
|
||||
}
|
||||
else
|
||||
{
|
||||
int processedEdges = 0;
|
||||
const int nD = detail.EdgesCount();
|
||||
int j = detJ+1;
|
||||
do
|
||||
{
|
||||
if (j > nD)
|
||||
{
|
||||
j=1;
|
||||
}
|
||||
if (j != detJ)
|
||||
{
|
||||
const QVector<QPointF> points = CutEdge(detail.Edge(j));
|
||||
for (int i = 0; i < points.size()-1; ++i)
|
||||
{
|
||||
newContour.append(points.at(i));
|
||||
}
|
||||
}
|
||||
++processedEdges;
|
||||
++j;
|
||||
}while (processedEdges < nD);
|
||||
}
|
||||
}
|
||||
|
||||
if (newContour.isEmpty() == false)
|
||||
{
|
||||
if (newContour.last() != d->globalContour.at(i))
|
||||
{
|
||||
newContour.append(d->globalContour.at(i));
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
newContour.append(d->globalContour.at(i));
|
||||
}
|
||||
++i;
|
||||
}
|
||||
}
|
||||
return newContour;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VContour::EdgesCount() const
|
||||
{
|
||||
if (d->globalContour.isEmpty())
|
||||
{
|
||||
if (d->shift == 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
const QLineF axis = QLineF(0, 0, d->paperWidth, 0);
|
||||
const int n = qFloor(axis.length()/d->shift);
|
||||
if (n <= 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
return n;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
return d->globalContour.count();
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QLineF VContour::GlobalEdge(int i) const
|
||||
{
|
||||
if (d->globalContour.isEmpty())
|
||||
{
|
||||
// Because sheet is blank we have one global edge for all cases - Ox axis.
|
||||
const QLineF axis = QLineF(0, 0, d->paperWidth - 5, 0);
|
||||
if (d->shift == 0)
|
||||
{
|
||||
return axis;
|
||||
}
|
||||
|
||||
const int n = qFloor(axis.length()/d->shift);
|
||||
|
||||
if (i < 1 || i > n)
|
||||
{ // Doesn't exist such edge
|
||||
return QLineF();
|
||||
}
|
||||
|
||||
if (n <= 0)
|
||||
{
|
||||
return axis;
|
||||
}
|
||||
else
|
||||
{
|
||||
const qreal nShift = axis.length()/n;
|
||||
return QLineF(nShift*(i-1), 0, nShift*i, 0);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if (i < 1 || i > EdgesCount())
|
||||
{ // Doesn't exist such edge
|
||||
return QLineF();
|
||||
}
|
||||
QLineF edge;
|
||||
if (i < EdgesCount())
|
||||
{
|
||||
edge = QLineF(d->globalContour.at(i-1), d->globalContour.at(i));
|
||||
}
|
||||
else
|
||||
{ // Closed countour
|
||||
edge = QLineF(d->globalContour.at(EdgesCount()-1), d->globalContour.at(0));
|
||||
}
|
||||
return edge;
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VContour::CutEdge(const QLineF &edge) const
|
||||
{
|
||||
QVector<QPointF> points;
|
||||
if (d->shift == 0)
|
||||
{
|
||||
points.append(edge.p1());
|
||||
points.append(edge.p2());
|
||||
}
|
||||
|
||||
const int n = qFloor(edge.length()/d->shift);
|
||||
|
||||
if (n <= 0)
|
||||
{
|
||||
points.append(edge.p1());
|
||||
points.append(edge.p2());
|
||||
}
|
||||
else
|
||||
{
|
||||
const qreal nShift = edge.length()/n;
|
||||
for (int i = 1; i <= n+1; ++i)
|
||||
{
|
||||
QLineF l1 = edge;
|
||||
l1.setLength(nShift*(i-1));
|
||||
points.append(l1.p2());
|
||||
}
|
||||
}
|
||||
return points;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
const QPointF &VContour::at(int i) const
|
||||
{
|
||||
return d->globalContour.at(i);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VContour::AppendWhole(QVector<QPointF> &contour, const VLayoutDetail &detail, int detJ) const
|
||||
{
|
||||
int processedEdges = 0;
|
||||
const int nD = detail.EdgesCount();
|
||||
int j = detJ+1;
|
||||
do
|
||||
{
|
||||
if (j > nD)
|
||||
{
|
||||
j=1;
|
||||
}
|
||||
const QVector<QPointF> points = CutEdge(detail.Edge(j));
|
||||
for (int i = 0; i < points.size()-1; ++i)
|
||||
{
|
||||
contour.append(points.at(i));
|
||||
}
|
||||
++processedEdges;
|
||||
++j;
|
||||
}while (processedEdges < nD);
|
||||
}
|
77
src/libs/vlayout/vcontour.h
Normal file
77
src/libs/vlayout/vcontour.h
Normal file
|
@ -0,0 +1,77 @@
|
|||
/************************************************************************
|
||||
**
|
||||
** @file vcontour.h
|
||||
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
||||
** @date 21 1, 2015
|
||||
**
|
||||
** @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) 2015 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/>.
|
||||
**
|
||||
*************************************************************************/
|
||||
|
||||
#ifndef VCONTOUR_H
|
||||
#define VCONTOUR_H
|
||||
|
||||
#include "vlayoutdef.h"
|
||||
|
||||
#include <QVector>
|
||||
#include <QSharedDataPointer>
|
||||
|
||||
class VContourData;
|
||||
class QPointF;
|
||||
class VLayoutDetail;
|
||||
class QLineF;
|
||||
|
||||
class VContour
|
||||
{
|
||||
public:
|
||||
VContour();
|
||||
VContour(int height, int width);
|
||||
VContour(const VContour &contour);
|
||||
VContour &operator=(const VContour &contour);
|
||||
virtual ~VContour();
|
||||
|
||||
void SetContour(const QVector<QPointF> &contour);
|
||||
QVector<QPointF> GetContour() const;
|
||||
|
||||
unsigned int GetShift() const;
|
||||
void SetShift(unsigned int shift);
|
||||
|
||||
int GetHeight() const;
|
||||
void SetHeight(int height);
|
||||
|
||||
int GetWidth() const;
|
||||
void SetWidth(int width);
|
||||
|
||||
QVector<QPointF> UniteWithContour(const VLayoutDetail &detail, int globalI, int detJ, BestFrom type) const;
|
||||
|
||||
int EdgesCount() const;
|
||||
QLineF GlobalEdge(int i) const;
|
||||
QVector<QPointF> CutEdge(const QLineF &edge) const;
|
||||
|
||||
const QPointF & at(int i) const;
|
||||
|
||||
private:
|
||||
QSharedDataPointer<VContourData> d;
|
||||
|
||||
void AppendWhole(QVector<QPointF> &contour, const VLayoutDetail &detail, int detJ) const;
|
||||
};
|
||||
|
||||
#endif // VCONTOUR_H
|
74
src/libs/vlayout/vcontour_p.h
Normal file
74
src/libs/vlayout/vcontour_p.h
Normal file
|
@ -0,0 +1,74 @@
|
|||
/************************************************************************
|
||||
**
|
||||
** @file vcontour_p.h
|
||||
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
||||
** @date 21 1, 2015
|
||||
**
|
||||
** @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) 2015 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/>.
|
||||
**
|
||||
*************************************************************************/
|
||||
|
||||
#ifndef VCONTOUR_P_H
|
||||
#define VCONTOUR_P_H
|
||||
|
||||
#include <QSharedData>
|
||||
#include <QPointF>
|
||||
|
||||
#ifdef Q_CC_GNU
|
||||
#pragma GCC diagnostic push
|
||||
#pragma GCC diagnostic ignored "-Weffc++"
|
||||
#endif
|
||||
|
||||
class VContourData : public QSharedData
|
||||
{
|
||||
public:
|
||||
VContourData()
|
||||
:globalContour(QVector<QPointF>()), paperHeight(0), paperWidth(0), shift(0)
|
||||
{}
|
||||
|
||||
VContourData(int height, int width)
|
||||
:globalContour(QVector<QPointF>()), paperHeight(height), paperWidth(width), shift(0)
|
||||
{}
|
||||
|
||||
VContourData(const VContourData &contour)
|
||||
:QSharedData(contour), globalContour(contour.globalContour), paperHeight(contour.paperHeight),
|
||||
paperWidth(contour.paperWidth), shift(contour.shift)
|
||||
{}
|
||||
|
||||
~VContourData() {}
|
||||
|
||||
/** @brief globalContour list of global points contour. */
|
||||
QVector<QPointF> globalContour;
|
||||
|
||||
/** @brief paperHeight height of paper in pixels*/
|
||||
int paperHeight;
|
||||
|
||||
/** @brief paperWidth width of paper in pixels*/
|
||||
int paperWidth;
|
||||
|
||||
unsigned int shift;
|
||||
};
|
||||
|
||||
#ifdef Q_CC_GNU
|
||||
#pragma GCC diagnostic pop
|
||||
#endif
|
||||
|
||||
#endif // VCONTOUR_P_H
|
|
@ -11,7 +11,10 @@ HEADERS += \
|
|||
$$PWD/vlayoutdef.h \
|
||||
$$PWD/vlayoutpaper.h \
|
||||
$$PWD/vlayoutpaper_p.h \
|
||||
$$PWD/vbank.h
|
||||
$$PWD/vbank.h \
|
||||
$$PWD/vcontour.h \
|
||||
$$PWD/vcontour_p.h \
|
||||
$$PWD/vbestsquare.h
|
||||
|
||||
SOURCES += \
|
||||
$$PWD/stable.cpp \
|
||||
|
@ -19,4 +22,6 @@ SOURCES += \
|
|||
$$PWD/vlayoutdetail.cpp \
|
||||
$$PWD/vabstractdetail.cpp \
|
||||
$$PWD/vlayoutpaper.cpp \
|
||||
$$PWD/vbank.cpp
|
||||
$$PWD/vbank.cpp \
|
||||
$$PWD/vcontour.cpp \
|
||||
$$PWD/vbestsquare.cpp
|
||||
|
|
|
@ -46,7 +46,7 @@ enum class BestFrom : char
|
|||
Combine = 1
|
||||
};
|
||||
|
||||
//#define LAYOUT_DEBUG // Enable debug mode
|
||||
#define LAYOUT_DEBUG // Enable debug mode
|
||||
|
||||
#ifdef LAYOUT_DEBUG
|
||||
# define SHOW_VERTICES // Show contour vertices
|
||||
|
|
|
@ -28,6 +28,7 @@
|
|||
|
||||
#include "vlayoutpaper.h"
|
||||
#include "vlayoutpaper_p.h"
|
||||
#include "vbestsquare.h"
|
||||
|
||||
#include <climits>
|
||||
#include <QPointF>
|
||||
|
@ -38,97 +39,6 @@
|
|||
#include <QGraphicsItem>
|
||||
#include <QCoreApplication>
|
||||
|
||||
class BestResult
|
||||
{
|
||||
public:
|
||||
BestResult();
|
||||
|
||||
void NewResult(qint64 square, int i, int j, const QTransform &matrix, bool mirror, BestFrom type);
|
||||
|
||||
qint64 BestSquare() const;
|
||||
int GContourEdge() const;
|
||||
int DetailEdge() const;
|
||||
QTransform Matrix() const;
|
||||
bool ValideResult() const;
|
||||
bool Mirror() const;
|
||||
BestFrom Type() const;
|
||||
|
||||
private:
|
||||
// All nedded information about best result
|
||||
int resI; // Edge of global contour
|
||||
int resJ; // Edge of detail
|
||||
QTransform resMatrix; // Matrix for rotation and translation detail
|
||||
qint64 resSquare; // Best square size (least). For begin set max value.
|
||||
bool valideResult;
|
||||
bool resMirror;
|
||||
BestFrom type;
|
||||
};
|
||||
|
||||
//===================================================BestResult========================================================
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
BestResult::BestResult()
|
||||
:resI(0), resJ(0), resMatrix(QMatrix()), resSquare(LLONG_MAX), valideResult(false), resMirror(false),
|
||||
type (BestFrom::Rotation)
|
||||
{}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void BestResult::NewResult(qint64 square, int i, int j, const QTransform &matrix, bool mirror, BestFrom type)
|
||||
{
|
||||
if (square <= resSquare && square > 0 && type >= this->type)
|
||||
{
|
||||
resI = i;
|
||||
resJ = j;
|
||||
resMatrix = matrix;
|
||||
resSquare = square;
|
||||
valideResult = true;
|
||||
resMirror = mirror;
|
||||
this->type = type;
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
qint64 BestResult::BestSquare() const
|
||||
{
|
||||
return resSquare;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int BestResult::GContourEdge() const
|
||||
{
|
||||
return resI;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int BestResult::DetailEdge() const
|
||||
{
|
||||
return resJ;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QTransform BestResult::Matrix() const
|
||||
{
|
||||
return resMatrix;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool BestResult::ValideResult() const
|
||||
{
|
||||
return valideResult;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool BestResult::Mirror() const
|
||||
{
|
||||
return resMirror;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
BestFrom BestResult::Type() const
|
||||
{
|
||||
return type;
|
||||
}
|
||||
|
||||
//===================================================VLayoutPaper======================================================
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
VLayoutPaper::VLayoutPaper()
|
||||
:d(new VLayoutPaperData)
|
||||
|
@ -162,25 +72,25 @@ VLayoutPaper::~VLayoutPaper()
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VLayoutPaper::GetHeight() const
|
||||
{
|
||||
return d->paperHeight;
|
||||
return d->globalContour.GetHeight();
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::SetHeight(int height)
|
||||
{
|
||||
d->paperHeight = height;
|
||||
d->globalContour.SetHeight(height);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VLayoutPaper::GetWidth() const
|
||||
{
|
||||
return d->paperWidth;
|
||||
return d->globalContour.GetWidth();
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::SetWidth(int width)
|
||||
{
|
||||
d->paperWidth = width;
|
||||
d->globalContour.SetWidth(width);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
|
@ -201,13 +111,13 @@ void VLayoutPaper::SetLayoutWidth(qreal width)
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
unsigned int VLayoutPaper::GetShift() const
|
||||
{
|
||||
return d->shift;
|
||||
return d->globalContour.GetShift();
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::SetShift(unsigned int shift)
|
||||
{
|
||||
d->shift = shift;
|
||||
d->globalContour.SetShift(shift);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
|
@ -220,7 +130,7 @@ void VLayoutPaper::SetPaperIndex(quint32 index)
|
|||
bool VLayoutPaper::ArrangeDetail(const VLayoutDetail &detail, bool &stop)
|
||||
{
|
||||
// First need set size of paper
|
||||
if (d->paperHeight <= 0 || d->paperWidth <= 0)
|
||||
if (d->globalContour.GetHeight() <= 0 || d->globalContour.GetWidth() <= 0)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
@ -244,9 +154,9 @@ int VLayoutPaper::Count() const
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VLayoutPaper::AddToSheet(const VLayoutDetail &detail, bool &stop)
|
||||
{
|
||||
BestResult bestResult;
|
||||
VBestSquare bestResult;
|
||||
|
||||
for (int j=1; j <= EdgesCount(); ++j)
|
||||
for (int j=1; j <= d->globalContour.EdgesCount(); ++j)
|
||||
{
|
||||
for (int i=1; i<= detail.EdgesCount(); i++)
|
||||
{
|
||||
|
@ -265,15 +175,12 @@ bool VLayoutPaper::AddToSheet(const VLayoutDetail &detail, bool &stop)
|
|||
{
|
||||
#ifdef LAYOUT_DEBUG
|
||||
# ifdef SHOW_CANDIDATE_BEST
|
||||
DrawDebug(workDetail, d->frame+2);
|
||||
DrawDebug(d->globalContour, workDetail, d->frame+2, d->paperIndex, d->details.count(),
|
||||
d->details);
|
||||
# endif
|
||||
#endif
|
||||
|
||||
QVector<QPointF> newGContour = UniteWithContour(workDetail, j, dEdge, BestFrom::Combine);
|
||||
newGContour.append(newGContour.first());
|
||||
const QRectF rec = QPolygonF(newGContour).boundingRect();
|
||||
bestResult.NewResult(static_cast<qint64>(rec.width()*rec.height()), j, dEdge,
|
||||
workDetail.GetMatrix(), workDetail.IsMirror(), BestFrom::Combine);
|
||||
SaveCandidate(bestResult, workDetail, j, dEdge, BestFrom::Combine);
|
||||
}
|
||||
d->frame = d->frame + 3;
|
||||
|
||||
|
@ -294,15 +201,12 @@ bool VLayoutPaper::AddToSheet(const VLayoutDetail &detail, bool &stop)
|
|||
#ifdef LAYOUT_DEBUG
|
||||
# ifdef SHOW_CANDIDATE_BEST
|
||||
++d->frame;
|
||||
DrawDebug(workDetail, d->frame);
|
||||
DrawDebug(d->globalContour, workDetail, d->frame, d->paperIndex, d->details.count(),
|
||||
d->details);
|
||||
# endif
|
||||
#endif
|
||||
|
||||
QVector<QPointF> newGContour = UniteWithContour(workDetail, j, i, BestFrom::Rotation);
|
||||
newGContour.append(newGContour.first());
|
||||
const QRectF rec = QPolygonF(newGContour).boundingRect();
|
||||
bestResult.NewResult(static_cast<qint64>(rec.width()*rec.height()), j, i,
|
||||
workDetail.GetMatrix(), workDetail.IsMirror(), BestFrom::Rotation);
|
||||
SaveCandidate(bestResult, workDetail, j, i, BestFrom::Rotation);
|
||||
}
|
||||
++d->frame;
|
||||
}
|
||||
|
@ -315,7 +219,7 @@ bool VLayoutPaper::AddToSheet(const VLayoutDetail &detail, bool &stop)
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VLayoutPaper::CheckCombineEdges(VLayoutDetail &detail, int j, int &dEdge) const
|
||||
{
|
||||
const QLineF globalEdge = GlobalEdge(j);
|
||||
const QLineF globalEdge = d->globalContour.GlobalEdge(j);
|
||||
bool flagMirror = false;
|
||||
bool flagSquare = false;
|
||||
|
||||
|
@ -323,7 +227,7 @@ bool VLayoutPaper::CheckCombineEdges(VLayoutDetail &detail, int j, int &dEdge) c
|
|||
|
||||
#ifdef LAYOUT_DEBUG
|
||||
# ifdef SHOW_COMBINE
|
||||
DrawDebug(detail, d->frame);
|
||||
DrawDebug(d->globalContour, detail, d->frame, d->paperIndex, d->details.count(), d->details);
|
||||
# endif
|
||||
#endif
|
||||
|
||||
|
@ -366,7 +270,7 @@ bool VLayoutPaper::CheckCombineEdges(VLayoutDetail &detail, int j, int &dEdge) c
|
|||
{
|
||||
#ifdef LAYOUT_DEBUG
|
||||
#ifdef SHOW_MIRROR
|
||||
DrawDebug(detail, d->frame+1);
|
||||
DrawDebug(d->globalContour, detail, d->frame+1, d->paperIndex, d->details.count(), d->details);
|
||||
#endif
|
||||
#endif
|
||||
|
||||
|
@ -415,14 +319,14 @@ bool VLayoutPaper::CheckCombineEdges(VLayoutDetail &detail, int j, int &dEdge) c
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VLayoutPaper::CheckRotationEdges(VLayoutDetail &detail, int j, int dEdge, int angle) const
|
||||
{
|
||||
const QLineF globalEdge = GlobalEdge(j);
|
||||
const QLineF globalEdge = d->globalContour.GlobalEdge(j);
|
||||
bool flagSquare = false;
|
||||
|
||||
RotateEdges(detail, globalEdge, dEdge, angle);
|
||||
|
||||
#ifdef LAYOUT_DEBUG
|
||||
#ifdef SHOW_ROTATION
|
||||
DrawDebug(detail, d->frame);
|
||||
DrawDebug(d->globalContour, detail, d->frame, d->paperIndex, d->details.count(), d->details);
|
||||
#endif
|
||||
#endif
|
||||
|
||||
|
@ -465,7 +369,7 @@ bool VLayoutPaper::CheckRotationEdges(VLayoutDetail &detail, int j, int dEdge, i
|
|||
VLayoutPaper::CrossingType VLayoutPaper::Crossing(const VLayoutDetail &detail, const int &globalI,
|
||||
const int &detailI) const
|
||||
{
|
||||
int globalEdgesCount = EdgesCount();
|
||||
int globalEdgesCount = d->globalContour.EdgesCount();
|
||||
if (globalEdgesCount == 0)
|
||||
{
|
||||
globalEdgesCount = 1;// For blank sheet
|
||||
|
@ -479,7 +383,7 @@ VLayoutPaper::CrossingType VLayoutPaper::Crossing(const VLayoutDetail &detail, c
|
|||
|
||||
for(int i = 1; i <= globalEdgesCount; i++)
|
||||
{
|
||||
const QLineF globalEdge = GlobalEdge(i);
|
||||
const QLineF globalEdge = d->globalContour.GlobalEdge(i);
|
||||
if (globalEdge.isNull()) // Got null edge
|
||||
{
|
||||
return CrossingType::EdgeError;
|
||||
|
@ -503,7 +407,7 @@ VLayoutPaper::CrossingType VLayoutPaper::Crossing(const VLayoutDetail &detail, c
|
|||
|
||||
if (type == QLineF::BoundedIntersection)
|
||||
{
|
||||
if (TrueIntersection(GlobalEdge(globalI), detail.Edge(detailI), xPoint))
|
||||
if (TrueIntersection(d->globalContour.GlobalEdge(globalI), detail.Edge(detailI), xPoint))
|
||||
{
|
||||
return CrossingType::Intersection;
|
||||
}
|
||||
|
@ -532,7 +436,7 @@ VLayoutPaper::InsideType VLayoutPaper::InsideContour(const VLayoutDetail &detail
|
|||
|
||||
if (d->details.isEmpty())
|
||||
{
|
||||
const QLineF globalEdge = GlobalEdge(1);
|
||||
const QLineF globalEdge = d->globalContour.GlobalEdge(1);
|
||||
for(int i = 0; i < lPoints.count(); i++)
|
||||
{
|
||||
if (CheckSide(globalEdge, lPoints.at(i)) < 0)
|
||||
|
@ -543,7 +447,7 @@ VLayoutPaper::InsideType VLayoutPaper::InsideContour(const VLayoutDetail &detail
|
|||
}
|
||||
else
|
||||
{
|
||||
const int polyCorners = EdgesCount();
|
||||
const int polyCorners = d->globalContour.EdgesCount();
|
||||
int j = polyCorners-1;
|
||||
|
||||
QVector<qreal> constant;
|
||||
|
@ -620,7 +524,7 @@ qreal VLayoutPaper::CheckSide(const QLineF &edge, const QPointF &p) const
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VLayoutPaper::SheetContains(const QRectF &rect) const
|
||||
{
|
||||
const QRectF bRect(0, 0, d->paperWidth, d->paperHeight);
|
||||
const QRectF bRect(0, 0, d->globalContour.GetWidth(), d->globalContour.GetHeight());
|
||||
return bRect.contains(rect);
|
||||
}
|
||||
|
||||
|
@ -659,241 +563,26 @@ void VLayoutPaper::RotateEdges(VLayoutDetail &detail, const QLineF &globalEdge,
|
|||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VLayoutPaper::UniteWithContour(const VLayoutDetail &detail, int globalI, int detJ, BestFrom type) const
|
||||
{
|
||||
QVector<QPointF> newContour;
|
||||
if (d->globalContour.isEmpty())
|
||||
{
|
||||
AppendWhole(newContour, detail, detJ);
|
||||
}
|
||||
else
|
||||
{
|
||||
if (globalI <= 0 || globalI > EdgesCount())
|
||||
{
|
||||
return QVector<QPointF>();
|
||||
}
|
||||
|
||||
if (detJ <= 0 || detJ > detail.EdgesCount())
|
||||
{
|
||||
return QVector<QPointF>();
|
||||
}
|
||||
|
||||
int i2 = 0;
|
||||
if (globalI == d->globalContour.count())
|
||||
{
|
||||
i2 = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
i2 = globalI;
|
||||
}
|
||||
|
||||
int i=0;
|
||||
while(i < d->globalContour.count())
|
||||
{
|
||||
if (i == i2)
|
||||
{
|
||||
if (type == BestFrom::Rotation)
|
||||
{
|
||||
AppendWhole(newContour, detail, detJ);
|
||||
}
|
||||
else
|
||||
{
|
||||
int processedEdges = 0;
|
||||
const int nD = detail.EdgesCount();
|
||||
int j = detJ+1;
|
||||
do
|
||||
{
|
||||
if (j > nD)
|
||||
{
|
||||
j=1;
|
||||
}
|
||||
if (j != detJ)
|
||||
{
|
||||
const QVector<QPointF> points = CutEdge(detail.Edge(j));
|
||||
for (int i = 0; i < points.size()-1; ++i)
|
||||
{
|
||||
newContour.append(points.at(i));
|
||||
}
|
||||
}
|
||||
++processedEdges;
|
||||
++j;
|
||||
}while (processedEdges < nD);
|
||||
}
|
||||
}
|
||||
|
||||
if (newContour.isEmpty() == false)
|
||||
{
|
||||
if (newContour.last() != d->globalContour.at(i))
|
||||
{
|
||||
newContour.append(d->globalContour.at(i));
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
newContour.append(d->globalContour.at(i));
|
||||
}
|
||||
++i;
|
||||
}
|
||||
}
|
||||
return newContour;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::AppendWhole(QVector<QPointF> &contour, const VLayoutDetail &detail, int detJ) const
|
||||
{
|
||||
int processedEdges = 0;
|
||||
const int nD = detail.EdgesCount();
|
||||
int j = detJ+1;
|
||||
do
|
||||
{
|
||||
if (j > nD)
|
||||
{
|
||||
j=1;
|
||||
}
|
||||
const QVector<QPointF> points = CutEdge(detail.Edge(j));
|
||||
for (int i = 0; i < points.size()-1; ++i)
|
||||
{
|
||||
contour.append(points.at(i));
|
||||
}
|
||||
++processedEdges;
|
||||
++j;
|
||||
}while (processedEdges < nD);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QLineF VLayoutPaper::GlobalEdge(int i) const
|
||||
{
|
||||
if (d->details.isEmpty())
|
||||
{
|
||||
// Because sheet is blank we have one global edge for all cases - Ox axis.
|
||||
const QLineF axis = QLineF(0, 0, d->paperWidth - d->layoutWidth/2, 0);
|
||||
if (d->shift == 0)
|
||||
{
|
||||
return axis;
|
||||
}
|
||||
|
||||
const int n = qFloor(axis.length()/d->shift);
|
||||
|
||||
if (i < 1 || i > n)
|
||||
{ // Doesn't exist such edge
|
||||
return QLineF();
|
||||
}
|
||||
|
||||
if (n <= 0)
|
||||
{
|
||||
return axis;
|
||||
}
|
||||
else
|
||||
{
|
||||
const qreal nShift = axis.length()/n;
|
||||
return QLineF(nShift*(i-1), 0, nShift*i, 0);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if (i < 1 || i > EdgesCount())
|
||||
{ // Doesn't exist such edge
|
||||
return QLineF();
|
||||
}
|
||||
QLineF edge;
|
||||
if (i < EdgesCount())
|
||||
{
|
||||
edge = QLineF(d->globalContour.at(i-1), d->globalContour.at(i));
|
||||
}
|
||||
else
|
||||
{ // Closed countour
|
||||
edge = QLineF(d->globalContour.at(EdgesCount()-1), d->globalContour.at(0));
|
||||
}
|
||||
return edge;
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
int VLayoutPaper::EdgesCount() const
|
||||
{
|
||||
if (d->details.isEmpty())
|
||||
{
|
||||
if (d->shift == 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
const QLineF axis = QLineF(0, 0, d->paperWidth, 0);
|
||||
const int n = qFloor(axis.length()/d->shift);
|
||||
if (n <= 0)
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
return n;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
return d->globalContour.count();
|
||||
}
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QPolygonF VLayoutPaper::GlobalPolygon() const
|
||||
{
|
||||
QVector<QPointF> points = d->globalContour;
|
||||
points.append(points.first());
|
||||
return QPolygonF(points);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VLayoutPaper::CutEdge(const QLineF &edge) const
|
||||
{
|
||||
QVector<QPointF> points;
|
||||
if (d->shift == 0)
|
||||
{
|
||||
points.append(edge.p1());
|
||||
points.append(edge.p2());
|
||||
}
|
||||
|
||||
const int n = qFloor(edge.length()/d->shift);
|
||||
|
||||
if (n <= 0)
|
||||
{
|
||||
points.append(edge.p1());
|
||||
points.append(edge.p2());
|
||||
}
|
||||
else
|
||||
{
|
||||
const qreal nShift = edge.length()/n;
|
||||
for (int i = 1; i <= n+1; ++i)
|
||||
{
|
||||
QLineF l1 = edge;
|
||||
l1.setLength(nShift*(i-1));
|
||||
points.append(l1.p2());
|
||||
}
|
||||
}
|
||||
return points;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
bool VLayoutPaper::SaveResult(const BestResult &bestResult, const VLayoutDetail &detail)
|
||||
bool VLayoutPaper::SaveResult(const VBestSquare &bestResult, const VLayoutDetail &detail)
|
||||
{
|
||||
if (bestResult.ValideResult())
|
||||
{
|
||||
VLayoutDetail workDetail = detail;
|
||||
workDetail.SetMatrix(bestResult.Matrix());// Don't forget set matrix
|
||||
workDetail.SetMirror(bestResult.Mirror());
|
||||
const QVector<QPointF> newGContour = UniteWithContour(workDetail, bestResult.GContourEdge(),
|
||||
bestResult.DetailEdge(), bestResult.Type());
|
||||
const QVector<QPointF> newGContour = d->globalContour.UniteWithContour(workDetail, bestResult.GContourEdge(),
|
||||
bestResult.DetailEdge(),
|
||||
bestResult.Type());
|
||||
if (newGContour.isEmpty())
|
||||
{
|
||||
return false;
|
||||
}
|
||||
d->details.append(workDetail);
|
||||
d->globalContour = newGContour;
|
||||
d->globalContour.SetContour(newGContour);
|
||||
|
||||
#ifdef LAYOUT_DEBUG
|
||||
# ifdef SHOW_BEST
|
||||
DrawDebug(workDetail, UINT_MAX);
|
||||
DrawDebug(d->globalContour, workDetail, UINT_MAX, d->paperIndex, d->details.count(), d->details);
|
||||
# endif
|
||||
#endif
|
||||
}
|
||||
|
@ -902,55 +591,67 @@ bool VLayoutPaper::SaveResult(const BestResult &bestResult, const VLayoutDetail
|
|||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::DrawDebug(const VLayoutDetail &detail, int frame) const
|
||||
void VLayoutPaper::SaveCandidate(VBestSquare &bestResult, const VLayoutDetail &detail, int globalI, int detJ,
|
||||
BestFrom type)
|
||||
{
|
||||
QImage frameImage(d->paperWidth*2, d->paperHeight*2, QImage::Format_RGB32);
|
||||
QVector<QPointF> newGContour = d->globalContour.UniteWithContour(detail, globalI, detJ, type);
|
||||
newGContour.append(newGContour.first());
|
||||
const QRectF rec = QPolygonF(newGContour).boundingRect();
|
||||
bestResult.NewResult(static_cast<qint64>(rec.width()*rec.height()), globalI, detJ,
|
||||
detail.GetMatrix(), detail.IsMirror(), type);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
void VLayoutPaper::DrawDebug(const VContour &contour, const VLayoutDetail &detail, int frame, quint32 paperIndex,
|
||||
int detailsCount, const QVector<VLayoutDetail> &details)
|
||||
{
|
||||
QImage frameImage(contour.GetWidth()*2, contour.GetHeight()*2, QImage::Format_RGB32);
|
||||
frameImage.fill(Qt::white);
|
||||
QPainter paint;
|
||||
paint.begin(&frameImage);
|
||||
|
||||
paint.setPen(QPen(Qt::darkRed, 10, Qt::SolidLine, Qt::FlatCap, Qt::MiterJoin));
|
||||
paint.drawRect(QRectF(d->paperWidth/2, d->paperHeight/2, d->paperWidth, d->paperHeight));
|
||||
paint.drawRect(QRectF(contour.GetWidth()/2, contour.GetHeight()/2, contour.GetWidth(), contour.GetHeight()));
|
||||
|
||||
paint.setPen(QPen(Qt::black, 3, Qt::SolidLine, Qt::FlatCap, Qt::MiterJoin));
|
||||
QPainterPath p;
|
||||
if (d->globalContour.isEmpty())
|
||||
if (contour.GetContour().isEmpty())
|
||||
{
|
||||
p = DrawContour(CutEdge(QLineF(0, 0, d->paperWidth, 0)));
|
||||
p.translate(d->paperWidth/2, d->paperHeight/2);
|
||||
p = DrawContour(contour.CutEdge(QLineF(0, 0, contour.GetWidth(), 0)));
|
||||
p.translate(contour.GetWidth()/2, contour.GetHeight()/2);
|
||||
paint.drawPath(p);
|
||||
}
|
||||
else
|
||||
{
|
||||
p = DrawContour(d->globalContour);
|
||||
p.translate(d->paperWidth/2, d->paperHeight/2);
|
||||
p = DrawContour(contour.GetContour());
|
||||
p.translate(contour.GetWidth()/2, contour.GetHeight()/2);
|
||||
paint.drawPath(p);
|
||||
}
|
||||
|
||||
#ifdef SHOW_CANDIDATE
|
||||
paint.setPen(QPen(Qt::darkGreen, 3, Qt::SolidLine, Qt::FlatCap, Qt::MiterJoin));
|
||||
p = DrawContour(detail.GetLayoutAllowencePoints());
|
||||
p.translate(d->paperWidth/2, d->paperHeight/2);
|
||||
p.translate(contour.GetWidth()/2, contour.GetHeight()/2);
|
||||
paint.drawPath(p);
|
||||
#endif
|
||||
|
||||
#ifdef ARRANGED_DETAILS
|
||||
paint.setPen(QPen(Qt::blue, 1, Qt::SolidLine, Qt::FlatCap, Qt::MiterJoin));
|
||||
p = DrawDetails();
|
||||
p.translate(d->paperWidth/2, d->paperHeight/2);
|
||||
p = DrawDetails(details);
|
||||
p.translate(contour.GetWidth()/2, contour.GetHeight()/2);
|
||||
paint.drawPath(p);
|
||||
#else
|
||||
Q_UNUSED(detail)
|
||||
#endif
|
||||
|
||||
paint.end();
|
||||
const QString path = QDir::homePath()+QStringLiteral("/LayoutDebug/")+QString("%1_%2_%3.png").arg(d->paperIndex)
|
||||
.arg(d->details.count()).arg(frame);
|
||||
const QString path = QDir::homePath()+QStringLiteral("/LayoutDebug/")+QString("%1_%2_%3.png").arg(paperIndex)
|
||||
.arg(detailsCount).arg(frame);
|
||||
frameImage.save (path);
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QPainterPath VLayoutPaper::ShowDirection(const QLineF &edge) const
|
||||
QPainterPath VLayoutPaper::ShowDirection(const QLineF &edge)
|
||||
{
|
||||
QLineF arrow = edge;
|
||||
arrow.setLength(edge.length()/2.0);
|
||||
|
@ -972,7 +673,7 @@ QPainterPath VLayoutPaper::ShowDirection(const QLineF &edge) const
|
|||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QPainterPath VLayoutPaper::DrawContour(const QVector<QPointF> &points) const
|
||||
QPainterPath VLayoutPaper::DrawContour(const QVector<QPointF> &points)
|
||||
{
|
||||
QPainterPath path;
|
||||
path.setFillRule(Qt::WindingFill);
|
||||
|
@ -1003,26 +704,15 @@ QPainterPath VLayoutPaper::DrawContour(const QVector<QPointF> &points) const
|
|||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QVector<QPointF> VLayoutPaper::TranslateContour(const QVector<QPointF> &points, qreal dx, qreal dy) const
|
||||
{
|
||||
QVector<QPointF> p;
|
||||
for (qint32 i = 0; i < points.count(); ++i)
|
||||
{
|
||||
p.append(QPointF(points.at(i).x()+dx, points.at(i).y()+dy));
|
||||
}
|
||||
return p;
|
||||
}
|
||||
|
||||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QPainterPath VLayoutPaper::DrawDetails() const
|
||||
QPainterPath VLayoutPaper::DrawDetails(const QVector<VLayoutDetail> &details)
|
||||
{
|
||||
QPainterPath path;
|
||||
path.setFillRule(Qt::WindingFill);
|
||||
if (Count() > 0)
|
||||
if (details.count() > 0)
|
||||
{
|
||||
for (int i = 0; i < d->details.size(); ++i)
|
||||
for (int i = 0; i < details.size(); ++i)
|
||||
{
|
||||
path.addPath(d->details.at(i).ContourPath());
|
||||
path.addPath(details.at(i).ContourPath());
|
||||
}
|
||||
}
|
||||
return path;
|
||||
|
@ -1061,7 +751,8 @@ QVector<QPointF> VLayoutPaper::Triplet(const QLineF &edge) const
|
|||
//---------------------------------------------------------------------------------------------------------------------
|
||||
QGraphicsItem *VLayoutPaper::GetItem() const
|
||||
{
|
||||
QGraphicsRectItem *paper = new QGraphicsRectItem(QRectF(0, 0, d->paperWidth, d->paperHeight));
|
||||
QGraphicsRectItem *paper = new QGraphicsRectItem(QRectF(0, 0, d->globalContour.GetWidth(),
|
||||
d->globalContour.GetHeight()));
|
||||
paper->setPen(QPen(Qt::black, 1));
|
||||
paper->setBrush(QBrush(Qt::white));
|
||||
for (int i=0; i < d->details.count(); ++i)
|
||||
|
|
|
@ -37,9 +37,11 @@ class VLayoutDetail;
|
|||
class QPointF;
|
||||
class QLineF;
|
||||
class QPolygonF;
|
||||
class BestResult;
|
||||
class QPainterPath;
|
||||
class QGraphicsItem;
|
||||
class VBestSquare;
|
||||
class VContour;
|
||||
class QRectF;
|
||||
|
||||
class VLayoutPaper
|
||||
{
|
||||
|
@ -98,22 +100,14 @@ private:
|
|||
void CombineEdges(VLayoutDetail &detail, const QLineF &globalEdge, const int &dEdge) const;
|
||||
void RotateEdges(VLayoutDetail &detail, const QLineF &globalEdge, int dEdge, int angle) const;
|
||||
|
||||
QVector<QPointF> UniteWithContour(const VLayoutDetail &detail, int globalI, int detJ, BestFrom type) const;
|
||||
void AppendWhole(QVector<QPointF> &contour, const VLayoutDetail &detail, int detJ) const;
|
||||
bool SaveResult(const VBestSquare &bestResult, const VLayoutDetail &detail);
|
||||
void SaveCandidate(VBestSquare &bestResult, const VLayoutDetail &detail, int globalI, int detJ, BestFrom type);
|
||||
|
||||
QLineF GlobalEdge(int i) const;
|
||||
int EdgesCount() const;
|
||||
|
||||
QPolygonF GlobalPolygon() const;
|
||||
QVector<QPointF> CutEdge(const QLineF &edge) const;
|
||||
|
||||
bool SaveResult(const BestResult &bestResult, const VLayoutDetail &detail);
|
||||
|
||||
void DrawDebug(const VLayoutDetail &detail, int frame) const;
|
||||
QPainterPath ShowDirection(const QLineF &edge) const;
|
||||
QPainterPath DrawContour(const QVector<QPointF> &points) const;
|
||||
QVector<QPointF> TranslateContour(const QVector<QPointF> &points, qreal dx, qreal dy) const;
|
||||
QPainterPath DrawDetails() const;
|
||||
static void DrawDebug(const VContour &contour, const VLayoutDetail &detail, int frame, quint32 paperIndex,
|
||||
int detailsCount, const QVector<VLayoutDetail> &details = QVector<VLayoutDetail>());
|
||||
static QPainterPath ShowDirection(const QLineF &edge);
|
||||
static QPainterPath DrawContour(const QVector<QPointF> &points);
|
||||
static QPainterPath DrawDetails(const QVector<VLayoutDetail> &details);
|
||||
|
||||
bool TrueIntersection(const QLineF &gEdge, const QLineF &dEdge, const QPointF &p) const;
|
||||
QPointF RoundedPoint(const QPointF &p) const;
|
||||
|
|
|
@ -34,6 +34,7 @@
|
|||
#include <QPointF>
|
||||
|
||||
#include "vlayoutdetail.h"
|
||||
#include "vcontour.h"
|
||||
|
||||
#ifdef Q_CC_GNU
|
||||
#pragma GCC diagnostic push
|
||||
|
@ -44,19 +45,17 @@ class VLayoutPaperData : public QSharedData
|
|||
{
|
||||
public:
|
||||
VLayoutPaperData()
|
||||
:details(QVector<VLayoutDetail>()), globalContour(QVector<QPointF>()), paperHeight(0), paperWidth(0), shift(0),
|
||||
paperIndex(0), frame(0), layoutWidth(0)
|
||||
:details(QVector<VLayoutDetail>()), globalContour(VContour()), paperIndex(0), frame(0), layoutWidth(0)
|
||||
{}
|
||||
|
||||
VLayoutPaperData(int height, int width)
|
||||
:details(QVector<VLayoutDetail>()), globalContour(QVector<QPointF>()), paperHeight(height), paperWidth(width),
|
||||
shift(0), paperIndex(0), frame(0), layoutWidth(0)
|
||||
:details(QVector<VLayoutDetail>()), globalContour(VContour(height, width)), paperIndex(0), frame(0),
|
||||
layoutWidth(0)
|
||||
{}
|
||||
|
||||
VLayoutPaperData(const VLayoutPaperData &paper)
|
||||
:QSharedData(paper), details(paper.details), globalContour(paper.globalContour), paperHeight(paper.paperHeight),
|
||||
paperWidth(paper.paperWidth), shift(paper.shift), paperIndex(paper.paperIndex), frame(paper.frame),
|
||||
layoutWidth(paper.layoutWidth)
|
||||
:QSharedData(paper), details(paper.details), globalContour(paper.globalContour), paperIndex(paper.paperIndex),
|
||||
frame(paper.frame), layoutWidth(paper.layoutWidth)
|
||||
{}
|
||||
|
||||
~VLayoutPaperData() {}
|
||||
|
@ -65,15 +64,8 @@ public:
|
|||
QVector<VLayoutDetail> details;
|
||||
|
||||
/** @brief globalContour list of global points contour. */
|
||||
QVector<QPointF> globalContour;
|
||||
VContour globalContour;
|
||||
|
||||
/** @brief paperHeight height of paper in pixels*/
|
||||
int paperHeight;
|
||||
|
||||
/** @brief paperWidth width of paper in pixels*/
|
||||
int paperWidth;
|
||||
|
||||
unsigned int shift;
|
||||
quint32 paperIndex;
|
||||
quint32 frame;
|
||||
qreal layoutWidth;
|
||||
|
|
Loading…
Reference in New Issue
Block a user