blob: 4dbd3cd290d5272c8e9b3c635f547ffca58be658 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0+ OR GPL-3.0 WITH Qt-GPL-exception-1.0
#include "onedimensionalcluster.h"
#include <utils/algorithm.h>
#include <QDebug>
namespace QmlDesigner {
double sum(const QList<double> & list)
{
double sum = 0.0;
for (auto iterator = list.constBegin(); iterator != list.constEnd(); ++iterator)
{
sum += *iterator;
}
return sum;
}
OneDimensionalCluster::OneDimensionalCluster(const QList<double> & coordinateList )
: m_coordinateList(coordinateList)
{
}
double OneDimensionalCluster::mean() const
{
Q_ASSERT(!m_coordinateList.isEmpty());
if (m_coordinateList.size() == 1)
{
return m_coordinateList.constFirst();
}
return sum(m_coordinateList) / m_coordinateList.size();
}
double OneDimensionalCluster::constFirst() const
{
Q_ASSERT(!m_coordinateList.isEmpty());
return m_coordinateList.constFirst();
}
QList<OneDimensionalCluster> OneDimensionalCluster::createOneDimensionalClusterList(const QList<double> & oneDimensionalCoordinateList)
{
QList<OneDimensionalCluster> oneDimensionalClusterList;
for (double coordinate : oneDimensionalCoordinateList)
{
QList<double> initialList;
initialList.append(coordinate);
OneDimensionalCluster cluster(initialList);
oneDimensionalClusterList.append(initialList);
}
return oneDimensionalClusterList;
}
QList<OneDimensionalCluster> OneDimensionalCluster::reduceOneDimensionalClusterList(const QList<OneDimensionalCluster> & unreducedClusterList, double maximumDistance)
{
if (unreducedClusterList.size() < 2)
return unreducedClusterList;
QList<OneDimensionalCluster> workingList(unreducedClusterList);
QList<OneDimensionalCluster> reducedList;
while (true)
{
Utils::sort(workingList);
reducedList.clear();
bool clusterMerged = false;
for (int i = 0, n = workingList.size(); i != n; ) {
OneDimensionalCluster currentCluster = workingList.at(i);
if (i + 1 < n) {
OneDimensionalCluster nextCluster = workingList.at(i + 1);
if ((nextCluster.mean() - currentCluster.mean()) < maximumDistance)
{
reducedList.append(currentCluster + nextCluster);
++i;
clusterMerged = true;
}
else
{
reducedList.append(currentCluster);
}
}
else
{
reducedList.append(currentCluster);
break;
}
}
workingList = reducedList;
if (clusterMerged == false)
break;
}
return reducedList;
}
QList<double> OneDimensionalCluster::reduceLines(const QList<double> & oneDimensionalCoordinateList, double maximumDistance)
{
QList<OneDimensionalCluster> clusterList(createOneDimensionalClusterList(oneDimensionalCoordinateList));
clusterList = reduceOneDimensionalClusterList(clusterList, maximumDistance);
QList<double> lineList;
for (const OneDimensionalCluster &cluster : qAsConst(clusterList))
lineList.append(cluster.constFirst());
return lineList;
}
}
|
