427 lines
11 KiB
C++
427 lines
11 KiB
C++
/************************************************************************
|
|
**
|
|
** @file vbank.cpp
|
|
** @author Roman Telezhynskyi <dismine(at)gmail.com>
|
|
** @date 11 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) 2013-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 "vbank.h"
|
|
#include "vlayoutdetail.h"
|
|
|
|
#include <QPointF>
|
|
#include <climits>
|
|
#include <QRectF>
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
VBank::VBank()
|
|
:details(QVector<VLayoutDetail>()), unsorted(QHash<int, qint64>()), big(QHash<int, qint64>()),
|
|
middle(QHash<int, qint64>()), small(QHash<int, qint64>()), layoutWidth(0), caseType(Cases::CaseDesc),
|
|
prepare(false), boundingRect(QRectF())
|
|
{}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
qreal VBank::GetLayoutWidth() const
|
|
{
|
|
return layoutWidth;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::SetLayoutWidth(const qreal &value)
|
|
{
|
|
layoutWidth = value;
|
|
Reset();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::SetDetails(const QVector<VLayoutDetail> &details)
|
|
{
|
|
this->details = details;
|
|
Reset();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::GetTiket()
|
|
{
|
|
if (prepare == false)
|
|
{
|
|
return -1;
|
|
}
|
|
|
|
if (LeftArrange() == 0)
|
|
{
|
|
if (unsorted.isEmpty())
|
|
{
|
|
return -1;
|
|
}
|
|
else
|
|
{
|
|
PrepareGroup();
|
|
}
|
|
}
|
|
|
|
switch (caseType)
|
|
{
|
|
case Cases::CaseThreeGroup:
|
|
return GetNextThreeGroups();
|
|
case Cases::CaseTwoGroup:
|
|
return GetNextTwoGroups();
|
|
case Cases::CaseDesc:
|
|
return GetNextDescGroup();
|
|
default:
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
VLayoutDetail VBank::GetDetail(int i) const
|
|
{
|
|
if (i >= 0 && i < details.size())
|
|
{
|
|
return details.at(i);
|
|
}
|
|
else
|
|
{
|
|
return VLayoutDetail();
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::Arranged(int i)
|
|
{
|
|
if (big.contains(i))
|
|
{
|
|
big.remove(i);
|
|
return;
|
|
}
|
|
|
|
if (middle.contains(i))
|
|
{
|
|
middle.remove(i);
|
|
return;
|
|
}
|
|
|
|
if (small.contains(i))
|
|
{
|
|
small.remove(i);
|
|
return;
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::NotArranged(int i)
|
|
{
|
|
if (big.contains(i))
|
|
{
|
|
unsorted.insert(i, big.value(i));
|
|
big.remove(i);
|
|
return;
|
|
}
|
|
|
|
if (middle.contains(i))
|
|
{
|
|
unsorted.insert(i, middle.value(i));
|
|
middle.remove(i);
|
|
return;
|
|
}
|
|
|
|
if (small.contains(i))
|
|
{
|
|
unsorted.insert(i, small.value(i));
|
|
small.remove(i);
|
|
return;
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
bool VBank::Prepare()
|
|
{
|
|
if (layoutWidth <= 0)
|
|
{
|
|
prepare = false;
|
|
return prepare;
|
|
}
|
|
|
|
if (details.isEmpty())
|
|
{
|
|
prepare = false;
|
|
return prepare;
|
|
}
|
|
|
|
for (int i=0; i < details.size(); ++i)
|
|
{
|
|
details[i].SetLayoutWidth(layoutWidth);
|
|
details[i].SetLayoutAllowencePoints();
|
|
const qint64 square = details.at(i).Square();
|
|
if (square <= 0)
|
|
{
|
|
prepare = false;
|
|
return prepare;
|
|
}
|
|
unsorted.insert(i, square);
|
|
}
|
|
|
|
BiggestBoundingRect();
|
|
PrepareGroup();
|
|
|
|
prepare = true;
|
|
return prepare;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::Reset()
|
|
{
|
|
prepare = false;
|
|
unsorted.clear();
|
|
big.clear();
|
|
middle.clear();
|
|
small.clear();
|
|
boundingRect = QRectF();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::SetCaseType(Cases caseType)
|
|
{
|
|
this->caseType = caseType;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::AllDetailsCount() const
|
|
{
|
|
return unsorted.count() + big.count() + middle.count() + small.count();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::LeftArrange() const
|
|
{
|
|
return big.count() + middle.count() + small.count();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::BiggestBoundingRect()
|
|
{
|
|
int index = -1;
|
|
qint64 sMax = LLONG_MIN;
|
|
|
|
QHash<int, qint64>::const_iterator i = unsorted.constBegin();
|
|
while (i != unsorted.constEnd())
|
|
{
|
|
if (i.value() > sMax)
|
|
{
|
|
sMax = i.value();
|
|
index = i.key();
|
|
}
|
|
|
|
++i;
|
|
}
|
|
|
|
if (index >= 0 && index < details.size())
|
|
{
|
|
boundingRect = QPolygonF(details.at(index).GetLayoutAllowencePoints()).boundingRect();
|
|
}
|
|
else
|
|
{
|
|
boundingRect = QRectF();
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
QRectF VBank::GetBiggestBoundingRect() const
|
|
{
|
|
return boundingRect;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::ArrangedCount() const
|
|
{
|
|
return details.size() - AllDetailsCount();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::PrepareGroup()
|
|
{
|
|
switch (caseType)
|
|
{
|
|
case Cases::CaseThreeGroup:
|
|
PrepareThreeGroups();
|
|
break;
|
|
case Cases::CaseTwoGroup:
|
|
PrepareTwoGroups();
|
|
break;
|
|
case Cases::CaseDesc:
|
|
PrepareDescGroup();
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::PrepareThreeGroups()
|
|
{
|
|
qint64 sMax = LLONG_MIN;
|
|
qint64 sMin = LLONG_MAX;
|
|
|
|
SqMaxMin(sMax, sMin);
|
|
|
|
const qint64 s1 = sMax - (sMax - sMin)/3;
|
|
const qint64 s2 = sMin + (sMax - sMin)/3;
|
|
|
|
QHash<int, qint64>::const_iterator i = unsorted.constBegin();
|
|
while (i != unsorted.constEnd())
|
|
{
|
|
if (i.value() > s1)
|
|
{
|
|
big.insert(i.key(), i.value());
|
|
}
|
|
else if (s1 >= i.value() && i.value() > s2)
|
|
{
|
|
middle.insert(i.key(), i.value());
|
|
}
|
|
else
|
|
{
|
|
small.insert(i.key(), i.value());
|
|
}
|
|
++i;
|
|
}
|
|
unsorted.clear();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::PrepareTwoGroups()
|
|
{
|
|
qint64 sMax = LLONG_MIN;
|
|
qint64 sMin = LLONG_MAX;
|
|
|
|
SqMaxMin(sMax, sMin);
|
|
|
|
const qint64 s = (sMax + sMin)/2;
|
|
QHash<int, qint64>::const_iterator i = unsorted.constBegin();
|
|
while (i != unsorted.constEnd())
|
|
{
|
|
if (i.value() >= s)
|
|
{
|
|
big.insert(i.key(), i.value());
|
|
}
|
|
else
|
|
{
|
|
small.insert(i.key(), i.value());
|
|
}
|
|
++i;
|
|
}
|
|
unsorted.clear();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::PrepareDescGroup()
|
|
{
|
|
big = unsorted;
|
|
unsorted.clear();
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::GetNextThreeGroups() const
|
|
{
|
|
if (big.isEmpty() == false)
|
|
{
|
|
QHash<int, qint64>::const_iterator i = big.constBegin();
|
|
return i.key();
|
|
}
|
|
|
|
if (middle.isEmpty() == false)
|
|
{
|
|
QHash<int, qint64>::const_iterator i = middle.constBegin();
|
|
return i.key();
|
|
}
|
|
|
|
if (small.isEmpty() == false)
|
|
{
|
|
QHash<int, qint64>::const_iterator i = small.constBegin();
|
|
return i.key();
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::GetNextTwoGroups() const
|
|
{
|
|
if (big.isEmpty() == false)
|
|
{
|
|
QHash<int, qint64>::const_iterator i = big.constBegin();
|
|
return i.key();
|
|
}
|
|
|
|
if (small.isEmpty() == false)
|
|
{
|
|
QHash<int, qint64>::const_iterator i = small.constBegin();
|
|
return i.key();
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
int VBank::GetNextDescGroup() const
|
|
{
|
|
int index = -1;
|
|
qint64 sMax = LLONG_MIN;
|
|
|
|
QHash<int, qint64>::const_iterator i = big.constBegin();
|
|
while (i != big.constEnd())
|
|
{
|
|
if (i.value() > sMax)
|
|
{
|
|
sMax = i.value();
|
|
index = i.key();
|
|
}
|
|
|
|
++i;
|
|
}
|
|
|
|
return index;
|
|
}
|
|
|
|
//---------------------------------------------------------------------------------------------------------------------
|
|
void VBank::SqMaxMin(qint64 &sMax, qint64 &sMin) const
|
|
{
|
|
sMax = LLONG_MIN;
|
|
sMin = LLONG_MAX;
|
|
|
|
QHash<int, qint64>::const_iterator i = unsorted.constBegin();
|
|
while (i != unsorted.constEnd())
|
|
{
|
|
if (i.value() < sMin)
|
|
{
|
|
sMin = i.value();
|
|
}
|
|
|
|
if (i.value() > sMax)
|
|
{
|
|
sMax = i.value();
|
|
}
|
|
++i;
|
|
}
|
|
|
|
}
|