summaryrefslogtreecommitdiffstats
path: root/mappingtreemodel.cpp
blob: a79661e7fb038528d71406cf870dc500316710c9 (plain)
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
/*
  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License
  as published by the Free Software Foundation; either version
  2 of the License, or (at your option) any later version.
*/

#include <QSqlDatabase>
#include <QSqlQuery>

#include "mappingtreemodel.h"
#include "smtreeitem.h"

MappingTreeModel::MappingTreeModel(QStringList &headers, QObject *parent) : SmTreeModel(headers, parent), mType(-1) {
    //init database
    mDb = QSqlDatabase::database("treedb");
    mTypesQ = new QSqlQuery(mDb);
    mTypesQ->prepare("SELECT imappings_type_id, tmappings_type_name FROM mappings_type");
    getMappingTypes();

    //prepare Queries
    mTypeParentsQ = new QSqlQuery(mDb);
    mTypeParentsQ->prepare("SELECT imapping_id, tmapping_name, tscreated FROM mappings WHERE imapping_id NOT IN (SELECT imapping_id FROM mappings_parents) AND imapping_type = :type ORDER BY tmapping_name");
    mUpdateTypeQ = new QSqlQuery(mDb);
    mUpdateTypeQ->prepare("UPDATE mappings_type SET tmappings_type_name = :value WHERE imappings_type_id = :id");
    mUpdateChildQ = new QSqlQuery(mDb);
    mUpdateChildQ->prepare("UPDATE mappings SET tmapping_name = :value WHERE imapping_id = :id");
    mAddMappingTypeQ = new QSqlQuery(mDb);
    mAddMappingTypeQ->prepare("INSERT INTO mappings_type (tmappings_type_name) VALUES(:value)");
    mDeleteMappingTypeQ = new QSqlQuery(mDb);
    mDeleteMappingTypeQ->prepare("DELETE FROM mappings_type WHERE imappings_type_id = :id");
    mAddChildQ = new QSqlQuery(mDb);
    mAddChildQ->prepare("INSERT INTO mappings (tmapping_name, imapping_type) VALUES(:name, :type)");
    mSelectChildQ = new QSqlQuery(mDb);
    mSelectChildQ->prepare("SELECT imapping_id, tmapping_name, tscreated FROM mappings WHERE tmapping_name = :name AND imapping_type = :type");
    mAddParentQ = new QSqlQuery(mDb);
    mAddParentQ->prepare("INSERT INTO mappings_parents (imapping_id, iparent_id) VALUES(:id, :parentid)");
    mDeleteChildQ = new QSqlQuery(mDb);
    mDeleteChildQ->prepare("DELETE FROM mappings WHERE imapping_id = :id");
}

MappingTreeModel::~MappingTreeModel(){
    delete mTypesQ;
    delete mTypeParentsQ;
    delete mUpdateTypeQ;
    delete mUpdateChildQ;
    delete mAddMappingTypeQ;
    delete mDeleteMappingTypeQ;
    delete mAddChildQ;
    delete mSelectChildQ;
    delete mAddParentQ;
    delete mDeleteChildQ;
    mDb = QSqlDatabase();
}

QStringList MappingTreeModel::mappingTypeNames() const {
    QStringList retval;
    foreach(mappingType t, mMappingTypes){
        retval << t.name.toString();
    }
    qSort(retval);
    return retval;
}

int MappingTreeModel::mappingTypeIdFromName(const QVariant &name) const{
    foreach(const mappingType t, mMappingTypes){
        if(t.name == name){
            return t.id.toInt();
        }
    }
    return -1;
}

QString MappingTreeModel::mappingTypeNameFromId(int id) const{
    foreach(const mappingType t, mMappingTypes){
        if(t.id == id){
            return t.name.toString();
        }
    }
    return QString();
}

QVariant MappingTreeModel::data(const QModelIndex &index, int role) const{
    if(!index.isValid()){
        return QVariant();
    }
    SmTreeItem *item = itemAt(index);
    if(role == NameRole){
        return item->data(Name);
    }
    if(role == IdRole){
        return item->data(Id);
    }
    if(role == AddedRole){
        return item->data(Added);
    }
    return SmTreeModel::data(index, role);
}

bool MappingTreeModel::setData(const QModelIndex &index, const QVariant &value, int role){
    if(!index.isValid()){
        return false;
    }
    SmTreeItem *item = itemAt(index);
    if(role == Qt::EditRole){
        mDb.transaction();
        QSqlQuery *q = 0;
        if(item == root()){
            q = mUpdateTypeQ;
        }else{
            q = mUpdateChildQ;
        }
        q->bindValue(":value", value);
        q->bindValue(":id", item->data(Id));
        if(q->exec()){
            item->setData(Name, value);
            emit dataChanged(index, index);
            mDb.commit();
            return true;
        }
        mDb.rollback();
    }
    if(role == NameRole){
        item->setData(Name, value);
    }
    if(role == IdRole){
        item->setData(Id, value);
    }
    if(role == AddedRole){
        item->setData(Added, value);
    }
    return true;
}

bool MappingTreeModel::addMappingType(const QString &type){
    mAddMappingTypeQ->bindValue(":value", type);
    mDb.transaction();
    if(mAddMappingTypeQ->exec()){
        mDb.commit();
        getMappingTypes();
        return true;
    }
    mDb.rollback();
    return false;
}

bool MappingTreeModel::deleteMappingType(int typeId){
    mDeleteMappingTypeQ->bindValue(":id", typeId);
    mDb.transaction();
    if(mDeleteMappingTypeQ->exec()){
        mDb.commit();
        getMappingTypes();
        return true;
    }
    mDb.rollback();
    return false;
}

bool MappingTreeModel::addChild(const QVariant &name, const QModelIndex &parent){
    if(!parent.isValid()){
        return false;
    }
    SmTreeItem *pItem = itemAt(parent);
    mAddChildQ->bindValue(":name", name);
    mAddChildQ->bindValue(":type", mType);
    if(mAddChildQ->exec()){
        mSelectChildQ->bindValue(":name", name);
        mSelectChildQ->bindValue(":type", mType);
        mSelectChildQ->exec();
        while(mSelectChildQ->next()){
            int where = lowerBound(pItem, mSelectChildQ->value(1), Name);
            if(insertRows(where, 1, parent)){
                QModelIndex newIdx = index(where, 0, parent);
                setData(newIdx, mSelectChildQ->value(1), NameRole);
                setData(newIdx, mSelectChildQ->value(0), IdRole);
                setData(newIdx, mSelectChildQ->value(2), AddedRole);
            }
            if(pItem->parent() != root()){
                mAddParentQ->bindValue(":id", mSelectChildQ->value(0)); //Id
                mAddParentQ->bindValue(":parentid", pItem->data(Id));
                mAddParentQ->exec();
            }
            return true;
        }
    }
    return false;
}

bool MappingTreeModel::deleteChild(const QModelIndex &idx){
    if(!idx.isValid()){
        return false;
    }
    SmTreeItem *item = itemAt(idx);
    if(item->childCount() > 0){
        return false;
    }
    mDeleteChildQ->bindValue(":id", item->data(Id));
    if(mDeleteChildQ->exec()){
        removeRows(idx.row(), 1, idx.parent());
        return true;
    }
    return false;
}

int MappingTreeModel::childCount(const QModelIndex &idx) const{
    if(!idx.isValid()){
        return 0;
    }
    SmTreeItem *item = itemAt(idx);
    return item->childCount();
}

void MappingTreeModel::populate(){
    if(mType == -1){
        return;
    }
    // get nodes with root as parent
    mTypeParentsQ->bindValue(":type", mType);
    if(mTypeParentsQ->exec()){
        SmTreeItem *rootItem = new SmTreeItem(NumFields);
        SmTreeItem *firstChild = new SmTreeItem(NumFields, rootItem);
        firstChild->setData(Name, mappingTypeNameFromId(mType));
        firstChild->setData(Id, mType);
        rootItem->appendChild(firstChild);
        //collect children recursive
        while(mTypeParentsQ->next()){
            QList<QVariant> childData;
            childData << mTypeParentsQ->value(1) << mTypeParentsQ->value(0) << mTypeParentsQ->value(2);
            SmTreeItem *childItem = new SmTreeItem(childData, firstChild);
            firstChild->appendChild(childItem);
            getChildrenRecursive(childItem);
        }
        setRoot(rootItem);
    }
}

void MappingTreeModel::getMappingTypes(){
    bool qRes = mTypesQ->exec();
    if(qRes){
        mMappingTypes.clear();
        while(mTypesQ->next()){
            mappingType t;
            t.id = mTypesQ->value(0);
            t.name = mTypesQ->value(1);
            mMappingTypes << t;
        }
        emit mappingTypesChanged();
    }
}

void MappingTreeModel::getChildrenRecursive(SmTreeItem *item){
    QSqlQuery cq(mDb);
    cq.prepare("SELECT mappings.imapping_id, mappings.tmapping_name, mappings.tscreated FROM mappings, mappings_parents WHERE mappings_parents.iparent_id = :id AND mappings.imapping_id = mappings_parents.imapping_id ORDER BY mappings.tmapping_name");
    cq.bindValue(":id", item->data(Id));
    if(cq.exec()){
        while(cq.next()){
            QList<QVariant> childData;
            childData << cq.value(1) << cq.value(0) << cq.value(2);
            SmTreeItem *child = new SmTreeItem(childData, item);
            item->appendChild(child);
            getChildrenRecursive(child);
        }
    }
}

int MappingTreeModel::lowerBound(SmTreeItem *item, const QVariant &value, int column) const {
    for(int i = 0; i < item->childCount(); ++i){
        SmTreeItem *child = item->child(i);
        if(child->data(column).toString() > value.toString()){
            return i;
        }
    }
    return item->childCount();
}

MappingTreeResultModel::MappingTreeResultModel(const QStringList &headers, QObject *parent) : SmTreeModel(headers, parent) { }

Qt::ItemFlags MappingTreeResultModel::flags(const QModelIndex &index) const {
    Q_UNUSED(index);
    return (Qt::ItemIsEnabled | Qt::ItemIsSelectable);
}

bool MappingTreeResultModel::setData(const QModelIndex &index, const QVariant &value, int role){
    SmTreeItem *item = itemAt(index);
    if(role == NameRole){
        item->setData(Name, value);
        return true;
    }
    if(role == IdRole){
        item->setData(Id, value);
        return true;
    }
    return SmTreeModel::setData(index, value, role);
}

void MappingTreeResultModel::addItem(const MappingData &data){
    SmTreeItem *curItem = root();
    for(int i = 0; i < data.path.count(); ++i){
        int childPos = hasChild(curItem, data.path.at(i));
        if(childPos != -1){
            //child already exists
            curItem = curItem->child(childPos);
            continue;
        }else{
            //insert child
            int id = -1;
            if(i == data.path.count() - 1){
                id = data.id;
            }
            QModelIndex curIdx = insertChild(data.path.at(i), id, curItem);
            curItem = itemAt(curIdx);
        }
    }
}

QModelIndex MappingTreeResultModel::insertChild(const QVariant &data, int id, SmTreeItem *parent){
    QModelIndex parentIdx;
    int row = parent->childCount();
    if(parent != root()){
        for(int i = 0; i < parent->childCount(); ++i){
            if(parent->child(i)->data(0).toString() > data.toString()){
                row = i;
            }
        }
        parentIdx = createIndex(0, 0, parent);
    }
    insertRows(row, 1, parentIdx);
    QModelIndex newIdx = index(row, 0, parentIdx);
    setData(newIdx, data, NameRole);
    setData(newIdx, id, IdRole);
    return newIdx;
}

QList<int> MappingTreeResultModel::mappingsIds() const {
    return mappingIdsRecursive(root());
}

int MappingTreeResultModel::hasChild(SmTreeItem *item, const QVariant &name, int column) const{
    for(int i = 0; i < item->childCount(); ++i){
        if(item->child(i)->data(column) == name){
            return i;
        }
    }
    return -1;
}

QList<int> MappingTreeResultModel::mappingIdsRecursive(SmTreeItem *parent) const {
    QList<int> retval;
    if(!parent->childCount()){
        return retval;
    }
    for(int i = 0; i < parent->childCount(); ++i){
        SmTreeItem *child = parent->child(i);
        int id = child->data(Id).toInt();
        if(id != -1){
            retval << id;
        }
        retval << mappingIdsRecursive(child);
    }
    return retval;
}