/*******************************************************************************
 **
 ** smolbote: yet another qute browser
 ** Copyright (C) 2017  Xian Nox
 **
 ** 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 3 of the License, or
 ** (at your option) any later version.
 **
 ** This program is distributed in the hope that it will be useful,
 ** but WITHOUT ANY WARRANTY; without even the implied warranty of
 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 ** GNU General Public License for more details.
 **
 ** You should have received a copy of the GNU General Public License
 ** along with this program.  If not, see <http://www.gnu.org/licenses/>.
 **
 ******************************************************************************/

#include "filtertree.h"

FilterTree::FilterTree(QObject *parent) :
    QAbstractItemModel(parent)
{
    rootItem = new Filter("", "", Filter::ResourceRules(), false);
}

FilterTree::~FilterTree()
{
    delete rootItem;
}

QModelIndex FilterTree::index(int row, int column, const QModelIndex &parent) const
{
    if(!hasIndex(row, column, parent)) {
        return QModelIndex();
    }

    Filter *parentItem;
    if(!parent.isValid()) {
        parentItem = rootItem;
    } else {
        parentItem = static_cast<Filter*>(parent.internalPointer());
    }

    Filter *childItem = parentItem->child(row);
    if(childItem) {
        return createIndex(row, column, childItem);
    } else {
        return QModelIndex();
    }
}

QModelIndex FilterTree::parent(const QModelIndex &index) const
{
    if(!index.isValid()) {
        return QModelIndex();
    }

    Filter *childItem = static_cast<Filter*>(index.internalPointer());
    Filter *parentItem = childItem->parentItem();

    if(parentItem == rootItem) {
        return QModelIndex();
    }

    return createIndex(parentItem->row(), 0, parentItem);
}

int FilterTree::rowCount(const QModelIndex &parent) const
{
    Filter *parentItem;
    if(parent.column() > 0) {
        return 0;
    }

    if(!parent.isValid()) {
        parentItem = rootItem;
    } else {
        parentItem = static_cast<Filter*>(parent.internalPointer());
    }

    return parentItem->childCount();
}

int FilterTree::columnCount(const QModelIndex &parent) const
{
    Q_UNUSED(parent)
    return 5;
}

QVariant FilterTree::data(const QModelIndex &index, int role) const
{
    if(!index.isValid()) {
        return QVariant();
    }

    if(role != Qt::DisplayRole) {
        return QVariant();
    }

    Filter *n = static_cast<Filter*>(index.internalPointer());
    switch (index.column()) {
    case 0: // domain
        return QVariant(n->domain());
    case 1: // request
        return QVariant(n->request());
    case 2: // should block
        return QVariant(n->isBlocking() ? "true" : "false");
    case 3: // allowed types
        return QVariant(n->allowedTypes());
    case 4: // blocked types
        return QVariant(n->blockedTypes());
    default:
        return QVariant();
    }
}

QVariant FilterTree::headerData(int section, Qt::Orientation orientation, int role) const
{
    if(orientation != Qt::Horizontal) {
        return QVariant();
    }

    if(role != Qt::DisplayRole) {
        return QVariant();
    }

    switch (section) {
    case 0:
        return QVariant(tr("Domain"));
    case 1:
        return QVariant(tr("Request"));
    case 2:
        return QVariant(tr("Should Block"));
    case 3:
        return QVariant(tr("Allowed Types"));
    case 4:
        return QVariant(tr("Blocked Types"));
    default:
        return QVariant();
    }
}

Filter *FilterTree::addFilter(const QString &domain, const QString &request, Filter::ResourceRules rules, bool shouldBlock)
{
    Filter *node = new Filter(domain, request, rules, shouldBlock, rootItem);
    node->enable();
    rootItem->appendChild(node);
    return node;
}

QVector<Filter*> FilterTree::filters(const QString &domain)
{
    QVector<Filter*> nodes;
    for(int i = 0; i < rootItem->childCount(); ++i) {
        nodes.append(rootItem->child(i));
    }
    return nodes;
}