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
|
/****************************************************************************
**
** Copyright (C) 2022 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the tools applications of the Qt Toolkit.
**
** $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 "qqmljsutils_p.h"
#include "qqmljstyperesolver_p.h"
#include "qqmljsscopesbyid_p.h"
#include <algorithm>
using namespace Qt::StringLiterals;
/*! \internal
Fully resolves alias \a property and returns the information about the
origin, which is not an alias.
*/
template<typename ScopeForId>
static QQmlJSUtils::ResolvedAlias
resolveAlias(ScopeForId scopeForId, const QQmlJSMetaProperty &property,
const QQmlJSScope::ConstPtr &owner, const QQmlJSUtils::AliasResolutionVisitor &visitor)
{
Q_ASSERT(property.isAlias());
Q_ASSERT(owner);
QQmlJSUtils::ResolvedAlias result {};
result.owner = owner;
for (QQmlJSMetaProperty nextProperty = property; nextProperty.isAlias();) {
// this is a special (seemingly useless) section which is necessary when
// we have an alias pointing to an alias. this way we avoid a check
// whether a property is an alias at the very end of the loop body
QQmlJSScope::ConstPtr resultOwner = result.owner;
result = QQmlJSUtils::ResolvedAlias {};
visitor.reset();
auto aliasExprBits = nextProperty.aliasExpression().split(u'.');
// resolve id first:
resultOwner = scopeForId(aliasExprBits[0], resultOwner);
if (!resultOwner)
return {};
visitor.processResolvedId(resultOwner);
aliasExprBits.removeFirst(); // Note: for simplicity, remove the <id>
result.owner = resultOwner;
result.kind = QQmlJSUtils::AliasTarget_Object;
// reset the property to avoid endless loop when aliasExprBits is empty
nextProperty = QQmlJSMetaProperty {};
for (const QString &bit : qAsConst(aliasExprBits)) {
nextProperty = resultOwner->property(bit);
if (!nextProperty.isValid())
return {};
visitor.processResolvedProperty(nextProperty, resultOwner);
result.property = nextProperty;
result.owner = resultOwner;
result.kind = QQmlJSUtils::AliasTarget_Property;
resultOwner = nextProperty.type();
}
}
return result;
}
QQmlJSUtils::ResolvedAlias QQmlJSUtils::resolveAlias(const QQmlJSTypeResolver *typeResolver,
const QQmlJSMetaProperty &property,
const QQmlJSScope::ConstPtr &owner,
const AliasResolutionVisitor &visitor)
{
return ::resolveAlias(
[&](const QString &id, const QQmlJSScope::ConstPtr &referrer) {
return typeResolver->scopeForId(id, referrer);
},
property, owner, visitor);
}
QQmlJSUtils::ResolvedAlias QQmlJSUtils::resolveAlias(const QQmlJSScopesById &idScopes,
const QQmlJSMetaProperty &property,
const QQmlJSScope::ConstPtr &owner,
const AliasResolutionVisitor &visitor)
{
return ::resolveAlias(
[&](const QString &id, const QQmlJSScope::ConstPtr &referrer) {
return idScopes.scope(id, referrer);
},
property, owner, visitor);
}
std::optional<FixSuggestion> QQmlJSUtils::didYouMean(const QString &userInput,
QStringList candidates,
QQmlJS::SourceLocation location)
{
QString shortestDistanceWord;
int shortestDistance = userInput.length();
// Most of the time the candidates are keys() from QHash, which means that
// running this function in the seemingly same setup might yield different
// best cadidate (e.g. imagine a typo 'thing' with candidates 'thingA' vs
// 'thingB'). This is especially flaky in e.g. test environment where the
// results may differ (even when the global hash seed is fixed!) when
// running one test vs the whole test suite (recall platform-dependent
// QSKIPs). There could be user-visible side effects as well, so just sort
// the candidates to guarantee consistent results
std::sort(candidates.begin(), candidates.end());
for (const QString &candidate : candidates) {
/*
* Calculate the distance between the userInput and candidate using Damerau–Levenshtein
* Roughly based on
* https://en.wikipedia.org/wiki/Levenshtein_distance#Iterative_with_two_matrix_rows.
*/
QList<int> v0(candidate.length() + 1);
QList<int> v1(candidate.length() + 1);
std::iota(v0.begin(), v0.end(), 0);
for (qsizetype i = 0; i < userInput.length(); i++) {
v1[0] = i + 1;
for (qsizetype j = 0; j < candidate.length(); j++) {
int deletionCost = v0[j + 1] + 1;
int insertionCost = v1[j] + 1;
int substitutionCost = userInput[i] == candidate[j] ? v0[j] : v0[j] + 1;
v1[j + 1] = std::min({ deletionCost, insertionCost, substitutionCost });
}
std::swap(v0, v1);
}
int distance = v0[candidate.length()];
if (distance < shortestDistance) {
shortestDistanceWord = candidate;
shortestDistance = distance;
}
}
if (shortestDistance
< std::min(std::max(userInput.length() / 2, qsizetype(3)), userInput.length())) {
return FixSuggestion { { FixSuggestion::Fix {
u"Did you mean \"%1\"?"_s.arg(shortestDistanceWord), location,
shortestDistanceWord } } };
} else {
return {};
}
}
|
