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
|
/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of Qt Creator.
**
** 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 Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/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 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
****************************************************************************/
#include "rmkeysoperation.h"
#include <iostream>
QString RmKeysOperation::name() const
{
return QLatin1String("rmKeys");
}
QString RmKeysOperation::helpText() const
{
return QLatin1String("remove settings from Qt Creator configuration");
}
QString RmKeysOperation::argumentsHelpText() const
{
return QLatin1String("A file (profiles, qtversions or toolchains) followed by one or more keys to remove.\n");
}
bool RmKeysOperation::setArguments(const QStringList &args)
{
if (args.count() < 2)
return false;
m_keys = args;
m_file = m_keys.takeFirst();
return true;
}
int RmKeysOperation::execute() const
{
Q_ASSERT(!m_keys.isEmpty());
QVariantMap map = load(m_file);
QVariantMap result = rmKeys(map, m_keys);
if (map == result)
return 1;
// Write data again:
return save(map, m_file) ? 0 : 2;
}
#ifdef WITH_TESTS
bool RmKeysOperation::test() const
{
QVariantMap testMap;
QVariantMap subKeys;
QVariantMap cur;
cur.insert(QLatin1String("testint2"), 53);
subKeys.insert(QLatin1String("subsubkeys"), cur);
subKeys.insert(QLatin1String("testbool"), true);
testMap.insert(QLatin1String("subkeys"), subKeys);
subKeys.clear();
testMap.insert(QLatin1String("subkeys2"), subKeys);
testMap.insert(QLatin1String("testint"), 23);
QStringList data;
QVariantMap result = rmKeys(testMap, data);
if (result != testMap)
return false;
data.append(QLatin1String("testint"));
result = rmKeys(testMap, data);
if (result.count() != 2
|| !result.contains(QLatin1String("subkeys"))
|| !result.contains(QLatin1String("subkeys2")))
return false;
cur = result.value(QLatin1String("subkeys")).toMap();
if (cur.count() != 2
|| !cur.contains(QLatin1String("subsubkeys"))
|| !cur.contains(QLatin1String("testbool")))
return false;
cur = cur.value(QLatin1String("subsubkeys")).toMap();
if (cur.count() != 1
|| !cur.contains(QLatin1String("testint2")))
return false;
cur = result.value(QLatin1String("subkeys2")).toMap();
if (cur.count() != 0)
return false;
data.clear();
data.append("subkeys/subsubkeys");
result = rmKeys(testMap, data);
if (result.count() != 3
|| !result.contains(QLatin1String("subkeys"))
|| !result.contains(QLatin1String("subkeys2"))
|| !result.contains(QLatin1String("testint")))
return false;
cur = result.value(QLatin1String("subkeys")).toMap();
if (cur.count() != 1
|| !cur.contains(QLatin1String("testbool")))
return false;
cur = result.value(QLatin1String("subkeys2")).toMap();
if (cur.count() != 0)
return false;
data.clear();
data.append("subkeys/testbool");
result = rmKeys(testMap, data);
if (result.count() != 3
|| !result.contains(QLatin1String("subkeys"))
|| !result.contains(QLatin1String("subkeys2"))
|| !result.contains(QLatin1String("testint")))
return false;
cur = result.value(QLatin1String("subkeys")).toMap();
if (cur.count() != 1
|| !cur.contains(QLatin1String("subsubkeys")))
return false;
cur = cur.value(QLatin1String("subsubkeys")).toMap();
if (cur.count() != 1
|| !cur.contains(QLatin1String("testint2")))
return false;
cur = result.value(QLatin1String("subkeys2")).toMap();
if (cur.count() != 0)
return false;
cur = result.value(QLatin1String("subkeys2")).toMap();
if (cur.count() != 0)
return false;
return true;
}
#endif
QVariantMap RmKeysOperation::rmKeys(const QVariantMap &map, const QStringList &removals)
{
QVariantMap result = map;
foreach (const QString &r, removals) {
QList<QVariantMap> stack;
const QStringList keys = r.split(QLatin1Char('/'));
// Set up a stack of QVariantMaps along the path we take:
stack.append(result);
for (int i = 0; i < keys.count() - 1; ++i) {
QVariantMap subMap;
if (stack.last().contains(keys.at(i))) {
subMap = stack.last().value(keys.at(i)).toMap();
} else {
std::cerr << "Warning: Key " << qPrintable(r) << " not found." << std::endl;
continue;
}
stack.append(subMap);
}
// remove
Q_ASSERT(stack.count() == keys.count());
if (!stack.last().contains(keys.last())) {
std::cerr << "Warning: Key " << qPrintable(r) << " not found." << std::endl;
continue;
}
stack.last().remove(keys.last());
// Generate new resultset by folding maps back in:
QVariantMap foldBack = stack.takeLast();
for (int i = keys.count() - 2; i >= 0; --i) { // skip last key, that is already taken care of
const QString k = keys.at(i);
QVariantMap current = stack.takeLast();
current.insert(k, foldBack);
foldBack = current;
}
Q_ASSERT(stack.count() == 0);
Q_ASSERT(foldBack != map);
result = foldBack;
}
return result;
}
|
