/*
  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 <QHash>

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

MappingTreeModel::MappingTreeModel(QStringList &headers, QObject *parent) : SmTreeModel(headers, parent), mForbidden("/"), mType(-1) {
    //init database
    mDb = QSqlDatabase::database("treedb");
    getMappingTypes();

    mSParentsQ = "SELECT mapping_parents.imapping_parents_id, mapping_parents.idescription_id, mapping_description.tdescription_name, mapping_description.tscreated, mapping_parents.iparent_id FROM mapping_parents, mapping_description WHERE  mapping_parents.iparent_id = :pid AND mapping_description.idescription_type = :type AND mapping_parents.idescription_id = mapping_description.idescription_id ORDER BY mapping_description.tdescription_name";
}

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;
}

//caller has ownership of this item!
SmTreeItem *MappingTreeModel::treeFromPaths(const QStringList &paths){
    if(paths.isEmpty()){
        return 0;
    }
    QHash<QString, SmTreeItem*> partsHash;
    SmTreeItem *root = new SmTreeItem(1);
    partsHash.insert(QString(), root);
    SmTreeItem *pItem = root;

    // create tree
    for(int i = 0; i < paths.count(); ++i){
        //split the paths
        QStringList parts = paths.at(i).split(forbidden());
        //process path items
        for(int j = 0; j < parts.count(); ++j){
            if(partsHash.contains(parts.at(j))){
                pItem = partsHash.value(parts.at(j)); //we've already seen this item, set it as new parent
            }else{
                //create a new item, save old root
                SmTreeItem *oldRoot = pItem;
                pItem = new SmTreeItem(QList<QVariant>() << parts.at(j), partsHash.value(parts.at(j)));
                oldRoot->appendChild(pItem);
                partsHash.insert(parts.at(j), pItem);
            }
        }
        pItem = root;
    }
    return root;
}

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 == MappingIdRole){
        return item->data(MappingId);
    }
    if(role == DescAddedRole){
        return item->data(DescAdded);
    }
    if(role == DescIdRole){
        return item->data(DescId);
    }
    if(role == MappingParentIdRole){
        return item->data(MappingParentId);
    }
    return SmTreeModel::data(index, role);
}

QList<QVariant> MappingTreeModel::childList(const QVariant &value, int column) const{
    QModelIndex itemIdx = findRecursive(value, column, createIndex(0, column, root()));
    SmTreeItem *item = static_cast<SmTreeItem*>(itemIdx.internalPointer());
    if(item){
        if(item->childCount()){
            return getChildListRecursive(item, column);
        }
    }
    return QList<QVariant>() << value;
}

QStringList MappingTreeModel::path(QModelIndex &idx) const{
    if(!idx.isValid()){
        return QStringList();
    }
    QStringList retval;
    SmTreeItem *item = static_cast<SmTreeItem*>(idx.internalPointer());
    do {
        QString d = item->data(MappingTreeModel::Name).toString();
        if(!d.isEmpty()){
            retval << d;
        }
        item = item->parent();
    }while(item);
    std::reverse(retval.begin(), retval.end());
    return retval;
}

QModelIndex MappingTreeModel::indexFromPath(const QString &path, int column) const{
    if(path == "/"){
        return rootIndex();
    }
    QStringList items = path.split("/");
    if(items.isEmpty() || column >= NumFields){
        return QModelIndex();
    }
    QModelIndex retval;
    for(int i = 0; i < items.count(); ++i){
        retval = find(items.at(i), column, retval);
    }
    return retval;
}

bool MappingTreeModel::setData(const QModelIndex &idx, const QVariant &value, int role){
    if(!idx.isValid()){
        return false;
    }
    SmTreeItem *item = itemAt(idx);
    if(role == Qt::EditRole){
        if(idx.column() == Name){
            if(value.toString().contains(mForbidden)){
                return false;
            }
        }
        updateChild(item, value);
    }
    if(role == NameRole){
        if(value.toString().contains(mForbidden)){
            return false;
        }
        item->setData(Name, value);
    }
    if(role == MappingIdRole){
        item->setData(MappingId, value);
    }
    if(role == DescAddedRole){
        item->setData(DescAdded, value);
    }
    if(role == DescIdRole){
        item->setData(DescId, value);
    }
    return true;
}

bool MappingTreeModel::move(const QModelIndex &source, const QModelIndex &dest){
    QVariant sourceId = source.data(MappingIdRole);
    QVariant destId = dest.data(MappingIdRole);
    QSqlQuery updateParentQ(mDb);
    updateParentQ.prepare("UPDATE mapping_parents SET iparent_id = :id where imapping_parents_id = :sid");
    updateParentQ.bindValue(":id", destId);
    updateParentQ.bindValue(":sid", sourceId);
    if(updateParentQ.exec()){
        // well, well, I tried to make this work with removeRows and insertRows,
        // but qt has a mind of its own there. So take the easy way out. Also,
        // it's way faster!
        populate();
        return true;
    }
    mLastError = updateParentQ.lastError();
    return false;
}

bool MappingTreeModel::addMappingType(const QString &type){
    QSqlQuery addMappingTypeQ(mDb);
    addMappingTypeQ.prepare("INSERT INTO mappings_type (tmappings_type_name) VALUES(:value)");
    addMappingTypeQ.bindValue(":value", type);
    if(addMappingTypeQ.exec()){
        getMappingTypes();
        return true;
    }
    mLastError = addMappingTypeQ.lastError();
    return false;
}

bool MappingTreeModel::deleteMappingType(int typeId){
    QSqlQuery deleteMappingTypeQ(mDb);
    deleteMappingTypeQ.prepare("DELETE FROM mappings_type WHERE imappings_type_id = :id");
    deleteMappingTypeQ.bindValue(":id", typeId);
    if(deleteMappingTypeQ.exec()){
        getMappingTypes();
        return true;
    }
    mLastError = deleteMappingTypeQ.lastError();
    return false;
}

bool MappingTreeModel::addChild(const QVariant &name, const QModelIndex &parent){
    if(!parent.isValid()){
        return false;
    }
    if(name.toString().contains(mForbidden)){
        return false;
    }
    //check if we already have a mapping with this name
    int id = mMappings.value(name.toString(), -1);
    if(id == -1){
        id = addDescription(name.toString(), mType);
    }
    QSqlQuery addParentQ(mDb);
    addParentQ.prepare("INSERT INTO mapping_parents (idescription_id, iparent_id) VALUES(:id, :parentid)");
    addParentQ.bindValue(":id", id);
    addParentQ.bindValue(":parentid", parent.data(MappingIdRole));
    if(addParentQ.exec()){
        populate();
        return true;
    }
    mLastError = addParentQ.lastError();
    return false;
}

bool MappingTreeModel::renameChild(const QModelIndex &idx, const QString newName){
    if(!idx.isValid()){
        return false;
    }
    int descId = idx.data(DescIdRole).toInt();
    QSqlQuery renameQ(mDb);
    renameQ.prepare("UPDATE mapping_description SET tdescription_name = :name WHERE idescription_id = :id");
    renameQ.bindValue(":id", descId);
    renameQ.bindValue(":name", newName);
    if(renameQ.exec()){
        populate();
        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;
    }
    QSqlQuery deleteChildQ(mDb);
    deleteChildQ.prepare("DELETE FROM mapping_parents WHERE imapping_parents_id = :id");
    deleteChildQ.bindValue(":id", item->data(MappingId));
    if(deleteChildQ.exec()){
        removeRows(idx.row(), 1, idx.parent());
        return true;
    }
    mLastError = deleteChildQ.lastError();
    return false;
}

MappingData MappingTreeModel::mappingDataFromIndex(QModelIndex &idx) const{
    MappingData retval;
    if(!idx.isValid()){
        return retval;
    }
    retval.mappingId = idx.data(MappingTreeModel::MappingIdRole).toInt();
    retval.parentId = idx.data(MappingTreeModel::MappingParentIdRole).toInt();
    retval.descId = idx.data(MappingTreeModel::DescIdRole).toInt();
    retval.name = idx.data(MappingTreeModel::NameRole).toString();
    retval.path << path(idx);
    return retval;
}

QStringList MappingTreeModel::paths() const{
    QStringList retval = QStringList() << "/";
    retval << getPathsRecursive(root());
    return retval;
}

void MappingTreeModel::populate(){
    if(mType == -1){
        return;
    }
    // get nodes with root as parent
    QSqlQuery rootQ(mDb);
    rootQ.prepare(mSParentsQ);
    rootQ.bindValue(":type", mType);
    rootQ.bindValue(":pid", -1);
    if(rootQ.exec()){
        SmTreeItem *rootItem = new SmTreeItem(NumFields);
        rootItem->setData(DescId, -1);
        rootItem->setData(MappingId, -1);
        rootItem->setData(MappingParentId, -1);
        while(rootQ.next()){
            QList<QVariant> childData;
            childData << rootQ.value(2) << rootQ.value(0) << rootQ.value(3) << rootQ.value(1) << rootQ.value(4);
            SmTreeItem *childItem = new SmTreeItem(childData, rootItem);
            rootItem->appendChild(childItem);
            getChildrenRecursive(childItem);
        }
        setRoot(rootItem);
        emit needExpansion();
    }
}

void MappingTreeModel::setType(int type){
    mType = type;
    getMappings();
}

void MappingTreeModel::getMappings(){
    QSqlQuery descriptionQ(mDb);
    descriptionQ.prepare("SELECT tdescription_name, idescription_id FROM mapping_description WHERE idescription_type = :type");
    descriptionQ.bindValue(":type", mType);
    if(descriptionQ.exec()){
        mMappings.clear();
        while(descriptionQ.next()){
            mMappings.insert(descriptionQ.value(0).toString(), descriptionQ.value(1).toInt());
        }
    }
}

int MappingTreeModel::addDescription(const QString &name, int type){
    mDb.transaction();
    QSqlQuery addDescriptionQ(mDb);
    addDescriptionQ.prepare("INSERT INTO mapping_description (tdescription_name, idescription_type) VALUES(:name, :type)");
    addDescriptionQ.bindValue(":name", name);
    addDescriptionQ.bindValue(":type", type);
    if(addDescriptionQ.exec()){
        int currval = -1;
        QSqlQuery curval("SELECT currval('mapping_id__seq')", mDb);
        while(curval.next()){
            currval = curval.value(0).toInt();
        }
        mMappings.insert(name, currval);
        mDb.commit();
        return currval;;
    }
    mDb.rollback();
    return -1;
}

void MappingTreeModel::getMappingTypes(){
    QSqlQuery typesQ(mDb);
    typesQ.prepare("SELECT imappings_type_id, tmappings_type_name FROM mappings_type");
    bool qRes = typesQ.exec();
    if(qRes){
        mMappingTypes.clear();
        while(typesQ.next()){
            mappingType t;
            t.id = typesQ.value(0);
            t.name = typesQ.value(1);
            mMappingTypes << t;
        }
        emit mappingTypesChanged();
    }
}

void MappingTreeModel::getChildrenRecursive(SmTreeItem *item){
    QSqlQuery cq(mDb);
    cq.prepare(mSParentsQ);
    cq.bindValue(":type", mType);
    cq.bindValue(":pid", item->data(MappingId));
    if(cq.exec()){
        while(cq.next()){
            QList<QVariant> childData;
            childData << cq.value(2) << cq.value(0) << cq.value(3) << cq.value(1) << cq.value(4);
            SmTreeItem *child = new SmTreeItem(childData, item);
            item->appendChild(child);
            getChildrenRecursive(child);
        }
    }
}

bool MappingTreeModel::updateChild(SmTreeItem *item, const QVariant &value){
    QSqlQuery updateMapping(mDb);
    updateMapping.prepare("UPDATE mapping_description SET tdescription_name = :new WHERE idescription_id = :id");
    updateMapping.bindValue(":id", item->data(DescId));
    updateMapping.bindValue(":new", value);
    if(updateMapping.exec()){
        populate();
        return true;
    }
    return false;
}

QStringList MappingTreeModel::getPathsRecursive(SmTreeItem *parent) const{
    QStringList retval;
    if(!basePath(parent).isEmpty()){
        retval << basePath(parent);
    }
    for(int i = 0; i < parent->childCount(); ++i){
        if(parent->child(i)->childCount()){
            retval << getPathsRecursive(parent->child(i));
        }else{
            retval << QString("%1/%2").arg(basePath(parent)).arg(parent->child(i)->data(Name).toString());
        }
    }
    return retval;
}

QList<QVariant> MappingTreeModel::getChildListRecursive(SmTreeItem *item, int column) const{
    QList<QVariant> retval;
    if(!item){
        return retval;
    }
    for(int i = 0; i < item->childCount(); ++i){
        if(item->child(i)->childCount()){
            retval << getChildListRecursive(item->child(i), column);
        }else{
            retval << item->child(i)->data(column);
        }
    }
    return retval;
}

QString MappingTreeModel::basePath(SmTreeItem *item) const{
    QStringList pItems;
    SmTreeItem *cur = item;
    while(cur != root()){
        pItems << cur->data(Name).toString();
        cur = cur->parent();
    }
    if(pItems.isEmpty()){
        return QString();
    }
    std::reverse(pItems.begin(), pItems.end());
    return pItems.join("/");
}

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 == MappingIdRole){
        item->setData(MappingId, value);
        return true;
    }
    if(role == ParentIdRole){
        item->setData(ParentId, value);
        return true;
    }
    if(role == DescIdRole){
        item->setData(DescId, value);
        return true;
    }
    return SmTreeModel::setData(index, value, role);
}

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

QModelIndex MappingTreeResultModel::insertChild(const QVariant &data, int mappingId, int parentId, int descId, 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, mappingId, MappingIdRole);
    setData(newIdx, descId, DescIdRole);
    setData(newIdx, parentId, ParentIdRole);
    return newIdx;
}

QList<QVariant> MappingTreeResultModel::columnValues(int column) const {
    return columnValuesRecursive(root(), column);
}

void MappingTreeResultModel::clearData(){
    setRoot(new SmTreeItem(NumFields));
}

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<QVariant> MappingTreeResultModel::columnValuesRecursive(SmTreeItem *parent, int column) const {
    QList<QVariant> retval;
    if(!parent->childCount()){
        return retval;
    }
    for(int i = 0; i < parent->childCount(); ++i){
        SmTreeItem *child = parent->child(i);
        QVariant value = child->data(column);
        if(value.canConvert(QVariant::Int) && (value.toInt() != -1)){
            retval << value;
        }
        retval << columnValuesRecursive(child, column);
    }
    return retval;
}

MappingData::MappingData() : mappingId(-1), parentId(-1), descId(-1) {}

bool MappingData::isValid(){
    return !(mappingId == -1 && parentId == -1 && descId == -1);
}