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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtQuick module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qquickmultipointerhandler_p.h"
#include <private/qquickitem_p.h>
#include <QLineF>
#include <QMouseEvent>
#include <QDebug>
QT_BEGIN_NAMESPACE
/*!
An intermediate class (not registered as a QML type)
for the type of handler which requires and acts upon a specific number
of multiple touchpoints.
*/
QQuickMultiPointerHandler::QQuickMultiPointerHandler(QObject *parent, int requiredPointCount)
: QQuickPointerDeviceHandler(parent)
, m_requiredPointCount(requiredPointCount)
, m_pointDistanceThreshold(0)
{
}
QQuickMultiPointerHandler::~QQuickMultiPointerHandler()
{
}
bool QQuickMultiPointerHandler::wantsPointerEvent(QQuickPointerEvent *event)
{
if (!QQuickPointerDeviceHandler::wantsPointerEvent(event))
return false;
if (event->pointCount() < m_requiredPointCount)
return false;
if (sameAsCurrentPoints(event))
return true;
const QVector<QQuickEventPoint *> candidatePoints = pointsInsideOrNearTarget(event);
const bool ret = (candidatePoints.size() == m_requiredPointCount);
if (ret)
m_currentPoints = candidatePoints;
return ret;
}
QVector<QQuickEventPoint *> QQuickMultiPointerHandler::pointsInsideOrNearTarget(QQuickPointerEvent *event)
{
QVector<QQuickEventPoint *> ret;
int c = event->pointCount();
QRectF targetBounds = target()->mapRectToScene(target()->boundingRect())
.marginsAdded(QMarginsF(m_pointDistanceThreshold, m_pointDistanceThreshold, m_pointDistanceThreshold, m_pointDistanceThreshold));
for (int i = 0; i < c; ++i) {
QQuickEventPoint *p = event->point(i);
if (targetBounds.contains(p->scenePos()))
ret << p;
}
return ret;
}
void QQuickMultiPointerHandler::setRequiredPointCount(int c)
{
if (m_requiredPointCount == c)
return;
m_requiredPointCount = c;
emit requiredPointCountChanged();
}
void QQuickMultiPointerHandler::setPointDistanceThreshold(qreal pointDistanceThreshold)
{
if (m_pointDistanceThreshold == pointDistanceThreshold)
return;
m_pointDistanceThreshold = pointDistanceThreshold;
emit pointDistanceThresholdChanged();
}
bool QQuickMultiPointerHandler::sameAsCurrentPoints(QQuickPointerEvent *event)
{
bool ret = true;
int c = event->pointCount();
if (c != m_currentPoints.size())
return false;
// TODO optimize: either ensure the points are sorted,
// or use std::equal with a predicate
for (int i = 0; ret && i < c; ++i) {
bool found = false;
quint64 pointId = event->point(i)->pointId();
for (QQuickEventPoint *o : qAsConst(m_currentPoints))
if (o && pointId == o->pointId())
found = true;
if (!found)
ret = false;
}
return ret;
}
// TODO make templates for these functions somehow?
QPointF QQuickMultiPointerHandler::touchPointCentroid()
{
QPointF ret;
if (Q_UNLIKELY(m_currentPoints.size() == 0))
return ret;
for (QQuickEventPoint *point : qAsConst(m_currentPoints))
ret += point->scenePos();
return ret / m_currentPoints.size();
}
qreal QQuickMultiPointerHandler::averageTouchPointDistance(const QPointF &ref)
{
qreal ret = 0;
if (Q_UNLIKELY(m_currentPoints.size() == 0))
return ret;
for (QQuickEventPoint *point : qAsConst(m_currentPoints))
ret += QVector2D(point->scenePos() - ref).length();
return ret / m_currentPoints.size();
}
qreal QQuickMultiPointerHandler::averageStartingDistance(const QPointF &ref)
{
// TODO cache it in setActive()?
qreal ret = 0;
if (Q_UNLIKELY(m_currentPoints.size() == 0))
return ret;
for (QQuickEventPoint *point : qAsConst(m_currentPoints))
ret += QVector2D(point->sceneGrabPos() - ref).length();
return ret / m_currentPoints.size();
}
QVector<QQuickMultiPointerHandler::PointData> QQuickMultiPointerHandler::angles(const QPointF &ref) const
{
QVector<PointData> angles;
angles.reserve(m_currentPoints.count());
for (QQuickEventPoint *point : qAsConst(m_currentPoints)) {
qreal angle = QLineF(ref, point->scenePos()).angle();
angles.append(PointData(point->pointId(), -angle)); // convert to clockwise, to be consistent with QQuickItem::rotation
}
return angles;
}
qreal QQuickMultiPointerHandler::averageAngleDelta(const QVector<PointData> &old, const QVector<PointData> &newAngles)
{
qreal avgAngleDelta = 0;
int numSamples = 0;
auto oldBegin = old.constBegin();
for (PointData newData : newAngles) {
quint64 id = newData.id;
auto it = std::find_if(oldBegin, old.constEnd(), [id] (PointData pd) { return pd.id == id; });
qreal angleD = 0;
if (it != old.constEnd()) {
PointData oldData = *it;
// We might rotate from 359 degrees to 1 degree. However, this
// should be interpreted as a rotation of +2 degrees instead of
// -358 degrees. Therefore, we call remainder() to translate the angle
// to be in the range [-180, 180] (-350 to +10 etc)
angleD = remainder(newData.angle - oldData.angle, qreal(360));
// optimization: narrow down the O(n^2) search to optimally O(n)
// if both vectors have the same points and they are in the same order
if (it == oldBegin)
++oldBegin;
numSamples++;
}
avgAngleDelta += angleD;
}
if (numSamples > 1)
avgAngleDelta /= numSamples;
return avgAngleDelta;
}
void QQuickMultiPointerHandler::acceptPoints(const QVector<QQuickEventPoint *> &points)
{
for (QQuickEventPoint* point : points)
point->setAccepted();
}
void QQuickMultiPointerHandler::grabPoints(QVector<QQuickEventPoint *> points)
{
for (QQuickEventPoint* point : points)
point->setGrabberPointerHandler(this);
}
QT_END_NAMESPACE
|
