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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include "qmljsfunctionfilter.h"
#include "qmljslocatordata.h"
#include "qmljstoolstr.h"
#include <extensionsystem/pluginmanager.h>
#include <utils/algorithm.h>
#include <utils/async.h>
#include <QRegularExpression>
using namespace Core;
using namespace QmlJSTools::Internal;
using namespace Utils;
Q_DECLARE_METATYPE(LocatorData::Entry)
QmlJSFunctionsFilter::QmlJSFunctionsFilter(LocatorData *data)
: m_data(data)
{
setId("Functions");
setDisplayName(Tr::tr("QML Functions"));
setDescription(Tr::tr("Locates QML functions in any open project."));
setDefaultShortcutString("m");
}
static void matches(QPromise<void> &promise, const LocatorStorage &storage,
const QHash<FilePath, QList<LocatorData::Entry>> &locatorEntries)
{
const QString input = storage.input();
const Qt::CaseSensitivity caseSensitivityForPrefix = ILocatorFilter::caseSensitivity(input);
const QRegularExpression regexp = ILocatorFilter::createRegExp(input);
if (!regexp.isValid())
return;
LocatorFilterEntries entries[int(ILocatorFilter::MatchLevel::Count)];
for (const QList<LocatorData::Entry> &items : locatorEntries) {
for (const LocatorData::Entry &info : items) {
if (promise.isCanceled())
return;
if (info.type != LocatorData::Function)
continue;
const QRegularExpressionMatch match = regexp.match(info.symbolName);
if (match.hasMatch()) {
LocatorFilterEntry filterEntry;
filterEntry.displayName = info.displayName;
filterEntry.linkForEditor = {info.fileName, info.line, info.column};
filterEntry.extraInfo = info.extraInfo;
filterEntry.highlightInfo = ILocatorFilter::highlightInfo(match);
if (filterEntry.displayName.startsWith(input, caseSensitivityForPrefix))
entries[int(ILocatorFilter::MatchLevel::Best)].append(filterEntry);
else if (filterEntry.displayName.contains(input, caseSensitivityForPrefix))
entries[int(ILocatorFilter::MatchLevel::Better)].append(filterEntry);
else
entries[int(ILocatorFilter::MatchLevel::Good)].append(filterEntry);
}
}
}
for (auto &entry : entries) {
if (promise.isCanceled())
return;
if (entry.size() < 1000)
Utils::sort(entry, LocatorFilterEntry::compareLexigraphically);
}
storage.reportOutput(std::accumulate(std::begin(entries), std::end(entries),
LocatorFilterEntries()));
}
LocatorMatcherTasks QmlJSFunctionsFilter::matchers()
{
using namespace Tasking;
TreeStorage<LocatorStorage> storage;
const auto onSetup = [storage, entries = m_data->entries()](Async<void> &async) {
async.setFutureSynchronizer(ExtensionSystem::PluginManager::futureSynchronizer());
async.setConcurrentCallData(matches, *storage, entries);
};
return {{AsyncTask<void>(onSetup), storage}};
}
|
