forked from ted-ross/qmf-explorer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
agent-model.cpp
329 lines (272 loc) · 8.93 KB
/
agent-model.cpp
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
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
#include "agent-model.h"
#include <iostream>
using std::cout;
using std::endl;
AgentModel::AgentModel(QObject* parent) : QAbstractItemModel(parent), nextId(1)
{
// Intentionally Left Blank
qmf::Agent a;
a.getInstance();
}
void AgentModel::renumber(IndexList& list)
{
int sequence = 0;
for (IndexList::iterator iter = list.begin(); iter != list.end(); iter++)
(*iter)->row = sequence++;
}
AgentModel::AgentIndexPtr
AgentModel::findOrInsertNode(IndexList& list, NodeType nodeType, AgentIndexPtr parent,
const std::string& text, const qmf::Agent& agent, QModelIndex parentIndex,
IndexList::iterator& listPosition)
{
AgentIndexPtr node;
int rowCount;
std::string insertText(text.empty() ? agent.getInstance() : text);
IndexList::iterator iter(list.begin());
rowCount = 0;
while (iter != list.end() && insertText > (*iter)->text) {
iter++;
rowCount++;
}
if (iter == list.end() || insertText != (*iter)->text) {
//
// A new data record needs to be inserted in-order in the list.
//
beginInsertRows(parentIndex, rowCount, rowCount);
node.reset(new AgentIndex());
node->id = nextId++;
node->nodeType = nodeType;
node->text = insertText;
node->parent = parent;
node->agent = agent;
linkage[node->id] = node;
if (iter == list.end())
list.push_back(node);
else
list.insert(iter, node);
renumber(list);
endInsertRows();
} else
node = *iter;
for (iter = list.begin(); iter != list.end(); iter++)
if ((*iter)->text == insertText) {
listPosition = iter;
break;
}
return node;
}
void AgentModel::addAgent(const qmf::Agent& agent)
{
const std::string& vendor(agent.getVendor());
const std::string& product(agent.getProduct());
const std::string& instance(agent.getInstance());
IndexList::iterator unused;
AgentIndexPtr vptr(findOrInsertNode(vendors, NODE_VENDOR, AgentIndexPtr(),
vendor, agent, QModelIndex(), unused));
AgentIndexPtr pptr(findOrInsertNode(vptr->children, NODE_PRODUCT, vptr,
product, agent, createIndex(vptr->row, 0, vptr->id), unused));
AgentIndexPtr iptr(findOrInsertNode(pptr->children, NODE_INSTANCE, pptr,
instance, agent, createIndex(pptr->row, 0, pptr->id), unused));
}
void AgentModel::delAgent(const qmf::Agent& agent)
{
const std::string& vendor(agent.getVendor());
const std::string& product(agent.getProduct());
const std::string& instance(agent.getInstance());
IndexList::iterator viter;
IndexList::iterator piter;
IndexList::iterator iiter;
AgentIndexPtr vptr(findOrInsertNode(vendors, NODE_VENDOR, AgentIndexPtr(), vendor, agent, QModelIndex(), viter));
QModelIndex pindex(createIndex(vptr->row, 0, vptr->id));
AgentIndexPtr pptr(findOrInsertNode(vptr->children, NODE_PRODUCT, vptr, product, agent, pindex, piter));
QModelIndex iindex(createIndex(pptr->row, 0, pptr->id));
AgentIndexPtr iptr(findOrInsertNode(pptr->children, NODE_INSTANCE, pptr, instance, agent, iindex, iiter));
beginRemoveRows(iindex, iptr->row, iptr->row);
pptr->children.erase(iiter);
linkage.erase(linkage.find(iptr->id));
renumber(pptr->children);
endRemoveRows();
if (pptr->children.size() == 0) {
beginRemoveRows(pindex, pptr->row, pptr->row);
vptr->children.erase(piter);
linkage.erase(linkage.find(pptr->id));
renumber(vptr->children);
endRemoveRows();
if (vptr->children.size() == 0) {
beginRemoveRows(QModelIndex(), vptr->row, vptr->row);
vendors.erase(viter);
linkage.erase(linkage.find(vptr->id));
renumber(vendors);
endRemoveRows();
}
}
}
void AgentModel::clear()
{
beginRemoveRows(QModelIndex(), 0, vendors.size() - 1);
vendors.clear();
linkage.clear();
endRemoveRows();
}
void AgentModel::selected(const QModelIndex& index)
{
//
// Get the data record linked to the ID.
//
quint32 id(index.internalId());
IndexMap::const_iterator iter(linkage.find(id));
if (iter == linkage.end())
return;
const AgentIndexPtr ptr(iter->second);
//
// The selected tree row is a valid instance. Relay it outbound.
//
if (ptr->nodeType == NODE_INSTANCE)
emit instSelected(ptr->agent);
}
int AgentModel::rowCount(const QModelIndex &parent) const
{
//
// If the parent is invalid (top-level), return the number of vendors.
//
if (!parent.isValid())
return (int) vendors.size();
//
// Get the data record linked to the ID.
//
quint32 id(parent.internalId());
IndexMap::const_iterator iter(linkage.find(id));
if (iter == linkage.end())
return 0;
const AgentIndexPtr ptr(iter->second);
//
// For parents that are vendor or product, return the number of children.
//
switch (ptr->nodeType) {
case NODE_INSTANCE:
// For instance nodes, return 0 because there are no children.
return 0;
case NODE_VENDOR:
case NODE_PRODUCT:
return (int) ptr->children.size();
}
return 0;
}
int AgentModel::columnCount(const QModelIndex &parent) const
{
QModelIndex p = parent;
return 1;
}
QVariant AgentModel::data(const QModelIndex &index, int role) const
{
if (role != Qt::DisplayRole)
return QVariant();
if (!index.isValid())
return QVariant();
//
// Note that we don't look at the row number in this function. The index structure
// is defined such that the internalId is sufficient to identify the data record being
// interrogated.
//
//
// Get the data record linked to the ID.
//
quint32 id(index.internalId());
IndexMap::const_iterator liter(linkage.find(id));
if (liter == linkage.end())
return QVariant();
const AgentIndexPtr ptr(liter->second);
return QString(ptr->text.c_str());
}
QVariant AgentModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if (section == 0 && role == Qt::DisplayRole && orientation == Qt::Horizontal)
return QString("Agents");
return QVariant();
}
QModelIndex AgentModel::parent(const QModelIndex& index) const
{
if (!index.isValid())
return QModelIndex();
quint32 id(index.internalId());
//
// Get the linked record
//
IndexMap::const_iterator iter(linkage.find(id));
if (iter == linkage.end())
return QModelIndex();
AgentIndexPtr ptr(iter->second);
//
// Handle the vendor case
//
if (ptr->nodeType == NODE_VENDOR)
return QModelIndex();
//
// Handle the product and instance level cases
//
return createIndex(ptr->parent->row, 0, ptr->parent->id);
}
QModelIndex AgentModel::index(int row, int column, const QModelIndex &parent) const
{
int count;
IndexList::const_iterator iter;
if (!parent.isValid()) {
//
// Handle the vendor-level case
//
count = 0;
iter = vendors.begin();
while (iter != vendors.end() && count < row) {
count++;
iter++;
}
if (iter == vendors.end())
return QModelIndex();
return createIndex(row, 0, (*iter)->id);
}
//
// Get the data record linked to the ID.
//
quint32 id(parent.internalId());
IndexMap::const_iterator link = linkage.find(id);
if (link == linkage.end())
return QModelIndex();
AgentIndexPtr ptr(link->second);
//
// Create an index for the child data record.
//
switch (ptr->nodeType) {
case NODE_INSTANCE:
return QModelIndex();
case NODE_VENDOR:
case NODE_PRODUCT:
count = 0;
iter = ptr->children.begin();
while (count < row) {
iter++;
count++;
}
if (iter == vendors.end())
return QModelIndex();
return createIndex(row, 0, (*iter)->id);
}
return QModelIndex();
}