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
|
/**************************************************************************
**
** 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 info@qt.nokia.com.
**
**************************************************************************/
#include "quickfixassistprocessor.h"
#include "quickfixassistprovider.h"
#include "iassistinterface.h"
#include "basicproposalitemlistmodel.h"
#include "basicproposalitem.h"
#include "genericproposal.h"
// @TODO: Move...
#include <texteditor/quickfix.h>
#include <QtCore/QMap>
#include <QtCore/QDebug>
using namespace TextEditor;
QuickFixAssistProcessor::QuickFixAssistProcessor()
{}
QuickFixAssistProcessor::~QuickFixAssistProcessor()
{}
IAssistProposal *QuickFixAssistProcessor::perform(const IAssistInterface *interface)
{
if (!interface)
return 0;
QSharedPointer<const IAssistInterface> assistInterface(interface);
const QuickFixAssistProvider *quickFixProvider =
static_cast<const QuickFixAssistProvider *>(provider());
QMap<int, QList<QuickFixOperation::Ptr> > matchedOps;
foreach (QuickFixFactory *factory, quickFixProvider->quickFixFactories()) {
QList<QuickFixOperation::Ptr> ops = factory->matchingOperations(assistInterface);
foreach (QuickFixOperation::Ptr op, ops) {
const int priority = op->priority();
if (priority != -1)
matchedOps[priority].append(op);
}
}
QList<QuickFixOperation::Ptr> quickFixes;
// ### As the list of quick fixes grows, introduce some way of only showing relevant ones.
// The old priority-based way where the priority is the matching ast-node depth does not
// work well.
foreach (const QList<QuickFixOperation::Ptr> &fixes, matchedOps)
quickFixes += fixes;
#if 0
QMapIterator<int, QList<QuickFixOperation::Ptr> > it(matchedOps);
it.toBack();
if (it.hasPrevious()) {
it.previous();
quickFixes = it.value();
}
#endif
if (!quickFixes.isEmpty()) {
QList<BasicProposalItem *> items;
foreach (const QuickFixOperation::Ptr &op, quickFixes) {
QVariant v;
v.setValue(op);
BasicProposalItem *item = new BasicProposalItem;
item->setText(op->description());
item->setData(v);
items.append(item);
}
return new GenericProposal(interface->position(), new BasicProposalItemListModel(items));
}
return 0;
}
|
