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
|
/*
SPDX-FileCopyrightText: 2015 Laszlo Kis-Adam <laszlo.kis-adam@kdemail.net>
SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include "problemmodelset.h"
#include "problemmodel.h"
namespace KDevelop
{
class ProblemModelSetPrivate
{
public:
QVector<ModelData> data;
};
ProblemModelSet::ProblemModelSet(QObject *parent)
: QObject(parent)
, d_ptr(new ProblemModelSetPrivate())
{
}
ProblemModelSet::~ProblemModelSet() = default;
void ProblemModelSet::addModel(const QString &id, const QString &name, ProblemModel *model)
{
Q_D(ProblemModelSet);
ModelData m{id, name, model};
d->data.push_back(m);
connect(model, &ProblemModel::problemsChanged, this, &ProblemModelSet::problemsChanged);
emit added(m);
}
ProblemModel* ProblemModelSet::findModel(const QString &id) const
{
Q_D(const ProblemModelSet);
auto it = std::find_if(d->data.constBegin(), d->data.constEnd(), [&](const ModelData& data) {
return (data.id == id);
});
return (it != d->data.constEnd()) ? it->model : nullptr;
}
void ProblemModelSet::removeModel(const QString &id)
{
Q_D(ProblemModelSet);
QVector<ModelData>::iterator itr = d->data.begin();
while (itr != d->data.end()) {
if(itr->id == id)
break;
++itr;
}
if(itr != d->data.end()) {
(*itr).model->disconnect(this);
d->data.erase(itr);
emit removed(id);
}
}
void ProblemModelSet::showModel(const QString &id)
{
Q_D(ProblemModelSet);
for (const ModelData &data : qAsConst(d->data)) {
if (data.id == id) {
emit showRequested(data.id);
return;
}
}
}
QVector<ModelData> ProblemModelSet::models() const
{
Q_D(const ProblemModelSet);
return d->data;
}
}
|
