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
|
/**************************************************************************
**
** This file is part of Qt Creator
**
** Copyright (c) 2011 Nokia Corporation and/or its subsidiary(-ies).
**
** Contact: Nokia Corporation (info@qt.nokia.com)
**
**
** GNU Lesser General Public License Usage
**
** 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, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** Other Usage
**
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**************************************************************************/
#include "icompletioncollector.h"
#include "completionsettings.h"
#include "itexteditor.h"
#include <QtCore/QRegExp>
#include <algorithm>
using namespace TextEditor;
using namespace TextEditor::Internal;
namespace TextEditor {
namespace Internal {
class ICompletionCollectorPrivate
{
public:
CompletionSettings m_completionSettings;
};
} // namespace Internal
} // namespace TextEditor
bool ICompletionCollector::compareChar(const QChar &l, const QChar &r)
{
if (l == QLatin1Char('_'))
return false;
else if (r == QLatin1Char('_'))
return true;
else
return l < r;
}
bool ICompletionCollector::lessThan(const QString &l, const QString &r)
{
return std::lexicographical_compare(l.begin(), l.end(),
r.begin(), r.end(),
compareChar);
}
bool ICompletionCollector::completionItemLessThan(const CompletionItem &i1, const CompletionItem &i2)
{
// The order is case-insensitive in principle, but case-sensitive when this would otherwise mean equality
const QString lower1 = i1.text.toLower();
const QString lower2 = i2.text.toLower();
if (lower1 == lower2)
return lessThan(i1.text, i2.text);
else
return lessThan(lower1, lower2);
}
ICompletionCollector::ICompletionCollector(QObject *parent)
: QObject(parent)
, m_d(new Internal::ICompletionCollectorPrivate)
{
}
ICompletionCollector::~ICompletionCollector()
{
delete m_d;
}
void ICompletionCollector::setCompletionSettings(const CompletionSettings &settings)
{
m_d->m_completionSettings = settings;
}
const CompletionSettings &ICompletionCollector::completionSettings() const
{
return m_d->m_completionSettings;
}
QList<CompletionItem> ICompletionCollector::getCompletions()
{
QList<CompletionItem> completionItems;
completions(&completionItems);
qStableSort(completionItems.begin(), completionItems.end(), completionItemLessThan);
// Remove duplicates
QString lastKey;
QList<CompletionItem> uniquelist;
foreach (const CompletionItem &item, completionItems) {
if (item.text != lastKey) {
uniquelist.append(item);
lastKey = item.text;
} else {
uniquelist.last().duplicateCount++;
}
}
return uniquelist;
}
bool ICompletionCollector::partiallyComplete(const QList<TextEditor::CompletionItem> &items)
{
if (! m_d->m_completionSettings.m_partiallyComplete)
return false;
if (items.size() >= 100)
return false;
QList<TextEditor::CompletionItem> completionItems = items;
sortCompletion(completionItems);
// Compute common prefix
QString firstKey = completionItems.first().text;
QString lastKey = completionItems.last().text;
const int length = qMin(firstKey.length(), lastKey.length());
firstKey.truncate(length);
lastKey.truncate(length);
while (firstKey != lastKey) {
firstKey.chop(1);
lastKey.chop(1);
}
if (ITextEditor *ed = editor()) {
const int typedLength = ed->position() - startPosition();
if (!firstKey.isEmpty() && firstKey.length() > typedLength) {
ed->setCursorPosition(startPosition());
ed->replace(typedLength, firstKey);
}
}
return false;
}
void ICompletionCollector::sortCompletion(QList<TextEditor::CompletionItem> &completionItems)
{
qStableSort(completionItems.begin(), completionItems.end(),
&ICompletionCollector::completionItemLessThan);
}
void ICompletionCollector::filter(const QList<TextEditor::CompletionItem> &items,
QList<TextEditor::CompletionItem> *filteredItems,
const QString &key)
{
const TextEditor::CaseSensitivity caseSensitivity = m_d->m_completionSettings.m_caseSensitivity;
/*
* This code builds a regular expression in order to more intelligently match
* camel-case style. This means upper-case characters will be rewritten as follows:
*
* A => [a-z0-9_]*A (for any but the first capital letter)
*
* Meaning it allows any sequence of lower-case characters to preceed an
* upper-case character. So for example gAC matches getActionController.
*
* It also implements the first-letter-only case sensitivity.
*/
QString keyRegExp;
keyRegExp += QLatin1Char('^');
bool first = true;
const QLatin1String wordContinuation("[a-z0-9_]*");
foreach (const QChar &c, key) {
if (caseSensitivity == TextEditor::CaseInsensitive ||
(caseSensitivity == TextEditor::FirstLetterCaseSensitive && !first)) {
keyRegExp += QLatin1String("(?:");
if (c.isUpper() && !first)
keyRegExp += wordContinuation;
keyRegExp += QRegExp::escape(c.toUpper());
keyRegExp += QLatin1Char('|');
keyRegExp += QRegExp::escape(c.toLower());
keyRegExp += QLatin1Char(')');
} else {
if (c.isUpper() && !first)
keyRegExp += wordContinuation;
keyRegExp += QRegExp::escape(c);
}
first = false;
}
const QRegExp regExp(keyRegExp);
foreach (const TextEditor::CompletionItem &item, items)
if (regExp.indexIn(item.text) == 0)
filteredItems->append(item);
}
bool ICompletionCollector::shouldRestartCompletion()
{
return true;
}
|
