blob: 1f4b8632770ad001e40c1f6db21e9cc768f08aad (
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
|
/****************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt 3D Studio.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** 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 General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** 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-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "TabOrderHandler.h"
TabOrderHandler::TabOrderHandler(QObject *parent)
: QObject(parent)
{
}
TabOrderHandler::~TabOrderHandler()
{
}
void TabOrderHandler::addItem(int group, QQuickItem *item)
{
m_itemMap[group].append(item);
}
void TabOrderHandler::clear()
{
m_itemMap.clear();
}
void TabOrderHandler::clearGroup(int group)
{
m_itemMap[group].clear();
}
void TabOrderHandler::tabNavigate(bool tabForward)
{
// Find the currently focused control
for (int i = 0; i < m_itemMap.size(); i++) {
const QList<QQuickItem *> items = m_itemMap[i];
for (int j = 0; j < items.size(); j++) {
if (items[j]->hasActiveFocus()) {
if (tabForward)
nextItem(i, j)->forceActiveFocus(Qt::TabFocusReason);
else
previousItem(i, j)->forceActiveFocus(Qt::BacktabFocusReason);
return;
}
}
}
// Activate the first item if could not find currently focused item
for (int i = 0; i < m_itemMap.size(); i++) {
if (m_itemMap[i].size() > 0)
m_itemMap[i][0]->forceActiveFocus(Qt::TabFocusReason);
}
}
QQuickItem *TabOrderHandler::nextItem(int group, int index)
{
if (m_itemMap[group].size() > index + 1) {
// Try next item in group
index++;
} else {
// Get item in next available group
int nextGroup = group + 1;
while (nextGroup != group) {
if (nextGroup >= m_itemMap.size())
nextGroup = 0;
if (m_itemMap[nextGroup].size() == 0)
nextGroup++;
else
group = nextGroup;
}
index = 0;
}
return m_itemMap[group][index];
}
QQuickItem *TabOrderHandler::previousItem(int group, int index)
{
if (index - 1 >= 0) {
// Try previous item in group
index--;
} else {
// Get last item in previous available group
int nextGroup = group - 1;
while (nextGroup != group) {
if (nextGroup < 0)
nextGroup = m_itemMap.size() - 1;
if (m_itemMap[nextGroup].size() == 0)
nextGroup--;
else
group = nextGroup;
}
index = m_itemMap[group].size() - 1;
}
return m_itemMap[group][index];
}
|
