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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
|
/**************************************************************************
**
** This file is part of Qt Creator
**
** Copyright (c) 2012 Nokia Corporation and/or its subsidiary(-ies).
**
** Contact: Nokia Corporation (qt-info@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 "taskmodel.h"
#include "task.h"
#include "taskhub.h"
#include <utils/qtcassert.h>
#include <QFontMetrics>
namespace ProjectExplorer {
namespace Internal {
/////
// TaskModel
/////
TaskModel::TaskModel(QObject *parent) :
QAbstractItemModel(parent),
m_maxSizeOfFileName(0),
m_lastMaxSizeIndex(0),
m_errorIcon(QLatin1String(":/projectexplorer/images/compile_error.png")),
m_warningIcon(QLatin1String(":/projectexplorer/images/compile_warning.png")),
m_sizeOfLineNumber(0)
{
m_categories.insert(Core::Id(), CategoryData());
}
int TaskModel::taskCount(const Core::Id &categoryId)
{
return m_categories.value(categoryId).count;
}
int TaskModel::errorTaskCount(const Core::Id &categoryId)
{
return m_categories.value(categoryId).errors;
}
int TaskModel::warningTaskCount(const Core::Id &categoryId)
{
return m_categories.value(categoryId).warnings;
}
bool TaskModel::hasFile(const QModelIndex &index) const
{
int row = index.row();
if (!index.isValid() || row < 0 || row >= m_tasks.count())
return false;
return !m_tasks.at(row).file.isEmpty();
}
QIcon TaskModel::taskTypeIcon(Task::TaskType t) const
{
switch (t) {
case Task::Warning:
return m_warningIcon;
case Task::Error:
return m_errorIcon;
case Task::Unknown:
break;
}
return QIcon();
}
void TaskModel::addCategory(const Core::Id &categoryId, const QString &categoryName)
{
QTC_ASSERT(categoryId.uniqueIdentifier(), return);
CategoryData data;
data.displayName = categoryName;
m_categories.insert(categoryId, data);
}
QList<Task> TaskModel::tasks(const Core::Id &categoryId) const
{
if (categoryId.uniqueIdentifier() == 0)
return m_tasks;
QList<Task> taskList;
foreach (const Task &t, m_tasks) {
if (t.category.uniqueIdentifier() == categoryId.uniqueIdentifier())
taskList.append(t);
}
return taskList;
}
void TaskModel::addTask(const Task &task)
{
Q_ASSERT(m_categories.keys().contains(task.category));
CategoryData &data = m_categories[task.category];
CategoryData &global = m_categories[Core::Id()];
beginInsertRows(QModelIndex(), m_tasks.count(), m_tasks.count());
m_tasks.append(task);
data.addTask(task);
global.addTask(task);
endInsertRows();
}
void TaskModel::removeTask(const Task &task)
{
int index = m_tasks.indexOf(task);
if (index >= 0) {
const Task &t = m_tasks.at(index);
beginRemoveRows(QModelIndex(), index, index);
m_categories[task.category].removeTask(t);
m_categories[Core::Id()].removeTask(t);
m_tasks.removeAt(index);
endRemoveRows();
}
}
void TaskModel::updateTaskLineNumber(unsigned int id, int line)
{
for (int i = 0; i < m_tasks.count(); ++i) {
if (m_tasks.at(i).taskId == id) {
m_tasks[i].movedLine = line;
emit dataChanged(index(i, 0), index(i, 0));
return;
}
}
}
void TaskModel::clearTasks(const Core::Id &categoryId)
{
if (categoryId.uniqueIdentifier() == 0) {
if (m_tasks.count() == 0)
return;
beginRemoveRows(QModelIndex(), 0, m_tasks.count() -1);
m_tasks.clear();
foreach (const Core::Id &key, m_categories.keys())
m_categories[key].clear();
endRemoveRows();
} else {
int index = 0;
int start = 0;
CategoryData &global = m_categories[Core::Id()];
CategoryData &cat = m_categories[categoryId];
while (index < m_tasks.count()) {
while (index < m_tasks.count() && m_tasks.at(index).category != categoryId) {
++start;
++index;
}
if (index == m_tasks.count())
break;
while (index < m_tasks.count() && m_tasks.at(index).category == categoryId)
++index;
// Index is now on the first non category
beginRemoveRows(QModelIndex(), start, index - 1);
for (int i = start; i < index; ++i) {
global.removeTask(m_tasks.at(i));
cat.removeTask(m_tasks.at(i));
}
m_tasks.erase(m_tasks.begin() + start, m_tasks.begin() + index);
endRemoveRows();
index = start;
}
}
m_maxSizeOfFileName = 0;
m_lastMaxSizeIndex = 0;
}
QModelIndex TaskModel::index(int row, int column, const QModelIndex &parent) const
{
if (parent.isValid())
return QModelIndex();
return createIndex(row, column);
}
QModelIndex TaskModel::parent(const QModelIndex &child) const
{
Q_UNUSED(child)
return QModelIndex();
}
int TaskModel::rowCount(const QModelIndex &parent) const
{
return parent.isValid() ? 0 : m_tasks.count();
}
int TaskModel::columnCount(const QModelIndex &parent) const
{
return parent.isValid() ? 0 : 1;
}
QVariant TaskModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid() || index.row() >= m_tasks.count() || index.column() != 0)
return QVariant();
if (role == TaskModel::File) {
return m_tasks.at(index.row()).file.toString();
} else if (role == TaskModel::Line) {
return m_tasks.at(index.row()).line;
} else if (role == TaskModel::MovedLine) {
return m_tasks.at(index.row()).movedLine;
} else if (role == TaskModel::Description) {
return m_tasks.at(index.row()).description;
} else if (role == TaskModel::FileNotFound) {
return m_fileNotFound.value(m_tasks.at(index.row()).file.toString());
} else if (role == TaskModel::Type) {
return (int)m_tasks.at(index.row()).type;
} else if (role == TaskModel::Category) {
return m_tasks.at(index.row()).category.uniqueIdentifier();
} else if (role == TaskModel::Icon) {
return taskTypeIcon(m_tasks.at(index.row()).type);
} else if (role == TaskModel::Task_t) {
return QVariant::fromValue(task(index));
}
return QVariant();
}
Task TaskModel::task(const QModelIndex &index) const
{
if (!index.isValid())
return Task();
return m_tasks.at(index.row());
}
QList<Core::Id> TaskModel::categoryIds() const
{
QList<Core::Id> categories = m_categories.keys();
categories.removeAll(Core::Id()); // remove global category we added for bookkeeping
return categories;
}
QString TaskModel::categoryDisplayName(const Core::Id &categoryId) const
{
return m_categories.value(categoryId).displayName;
}
int TaskModel::sizeOfFile(const QFont &font)
{
int count = m_tasks.count();
if (count == 0)
return 0;
if (m_maxSizeOfFileName > 0 && font == m_fileMeasurementFont && m_lastMaxSizeIndex == count - 1)
return m_maxSizeOfFileName;
QFontMetrics fm(font);
m_fileMeasurementFont = font;
for (int i = m_lastMaxSizeIndex; i < count; ++i) {
QString filename = m_tasks.at(i).file.toString();
const int pos = filename.lastIndexOf(QLatin1Char('/'));
if (pos != -1)
filename = filename.mid(pos +1);
m_maxSizeOfFileName = qMax(m_maxSizeOfFileName, fm.width(filename));
}
m_lastMaxSizeIndex = count - 1;
return m_maxSizeOfFileName;
}
int TaskModel::sizeOfLineNumber(const QFont &font)
{
if (m_sizeOfLineNumber == 0 || font != m_lineMeasurementFont) {
QFontMetrics fm(font);
m_lineMeasurementFont = font;
m_sizeOfLineNumber = fm.width(QLatin1String("88888"));
}
return m_sizeOfLineNumber;
}
void TaskModel::setFileNotFound(const QModelIndex &idx, bool b)
{
if (idx.isValid() && idx.row() < m_tasks.count()) {
m_fileNotFound.insert(m_tasks[idx.row()].file.toUserOutput(), b);
emit dataChanged(idx, idx);
}
}
/////
// TaskFilterModel
/////
TaskFilterModel::TaskFilterModel(TaskModel *sourceModel, QObject *parent) : TaskModel(parent),
m_sourceModel(sourceModel)
{
Q_ASSERT(m_sourceModel);
connect(m_sourceModel, SIGNAL(rowsInserted(QModelIndex,int,int)),
this, SLOT(handleNewRows(QModelIndex,int,int)));
connect(m_sourceModel, SIGNAL(rowsRemoved(QModelIndex,int,int)),
this, SLOT(handleRemovedRows(QModelIndex,int,int)));
connect(m_sourceModel, SIGNAL(modelReset()),
this, SLOT(handleReset()));
connect(m_sourceModel, SIGNAL(dataChanged(QModelIndex,QModelIndex)),
this, SLOT(handleDataChanged(QModelIndex,QModelIndex)));
m_includeUnknowns = m_includeWarnings = m_includeErrors = true;
}
QModelIndex TaskFilterModel::index(int row, int column, const QModelIndex &parent) const
{
if (parent.isValid())
return QModelIndex();
return createIndex(row, column, 0);
}
QModelIndex TaskFilterModel::parent(const QModelIndex &child) const
{
Q_UNUSED(child)
return QModelIndex();
}
int TaskFilterModel::rowCount(const QModelIndex &parent) const
{
if (parent.isValid())
return 0;
updateMapping();
return m_mapping.count();
}
int TaskFilterModel::columnCount(const QModelIndex &parent) const
{
if (parent.isValid())
return 0;
return m_sourceModel->columnCount(parent);
}
QVariant TaskFilterModel::data(const QModelIndex &index, int role) const
{
return m_sourceModel->data(mapToSource(index), role);
}
static QPair<int, int> findFilteredRange(int first, int last, const QList<int> &list)
{
QList<int>::const_iterator filteredFirst = qLowerBound(list, first);
QList<int>::const_iterator filteredLast = qUpperBound(filteredFirst, list.constEnd(), last);
return qMakePair(filteredFirst - list.constBegin(), filteredLast - list.constBegin() - 1);
}
void TaskFilterModel::handleNewRows(const QModelIndex &index, int first, int last)
{
if (index.isValid())
return;
QList<int> newMapping;
for (int i = first; i <= last; ++i) {
const Task &task = m_sourceModel->task(m_sourceModel->index(i, 0));
if (filterAcceptsTask(task))
newMapping.append(i);
}
const int newItems = newMapping.count();
if (!newItems)
return;
int filteredFirst = -1;
if (last == m_sourceModel->rowCount() - 1)
filteredFirst = m_mapping.count();
else
filteredFirst = qLowerBound(m_mapping, first) - m_mapping.constBegin();
const int filteredLast = filteredFirst + newItems - 1;
beginInsertRows(QModelIndex(), filteredFirst, filteredLast);
if (filteredFirst == m_mapping.count()) {
m_mapping.append(newMapping);
} else {
QList<int> rest = m_mapping.mid(filteredFirst);
m_mapping.reserve(m_mapping.count() + newItems);
m_mapping.erase(m_mapping.begin() + filteredFirst, m_mapping.end());
m_mapping.append(newMapping);
foreach (int pos, rest)
m_mapping.append(pos + newItems);
}
endInsertRows();
}
void TaskFilterModel::handleRemovedRows(const QModelIndex &index, int first, int last)
{
if (index.isValid())
return;
const QPair<int, int> range = findFilteredRange(first, last, m_mapping);
if (range.first > range.second)
return;
beginRemoveRows(QModelIndex(), range.first, range.second);
m_mapping.erase(m_mapping.begin() + range.first, m_mapping.begin() + range.second + 1);
for (int i = range.first; i < m_mapping.count(); ++i)
m_mapping[i] = m_mapping.at(i) - (last - first) - 1;
endRemoveRows();
}
void TaskFilterModel::handleDataChanged(QModelIndex top, QModelIndex bottom)
{
const QPair<int, int> range = findFilteredRange(top.row(), bottom.row(), m_mapping);
if (range.first > range.second)
return;
emit dataChanged(index(range.first, top.column()), index(range.second, bottom.column()));
}
void TaskFilterModel::handleReset()
{
invalidateFilter();
}
QModelIndex TaskFilterModel::mapToSource(const QModelIndex &index) const
{
updateMapping();
int row = index.row();
if (row >= m_mapping.count())
return QModelIndex();
return m_sourceModel->index(m_mapping.at(row), index.column(), index.parent());
}
void TaskFilterModel::invalidateFilter()
{
beginResetModel();
m_mappingUpToDate = false;
endResetModel();
}
void TaskFilterModel::updateMapping() const
{
if (m_mappingUpToDate)
return;
m_mapping.clear();
for (int i = 0; i < m_sourceModel->rowCount(); ++i) {
QModelIndex index = m_sourceModel->index(i, 0);
const Task &task = m_sourceModel->task(index);
if (filterAcceptsTask(task))
m_mapping.append(i);
}
m_mappingUpToDate = true;
}
bool TaskFilterModel::filterAcceptsTask(const Task &task) const
{
bool accept = true;
switch (task.type) {
case Task::Unknown:
accept = m_includeUnknowns;
break;
case Task::Warning:
accept = m_includeWarnings;
break;
case Task::Error:
accept = m_includeErrors;
break;
}
if (m_categoryIds.contains(task.category))
accept = false;
return accept;
}
} // namespace Internal
} // namespace ProjectExplorer
|