48e0c4df23
Change-Id: Ic804938fc352291d011800d21e549c10acac66fb Reviewed-by: Lars Knoll <lars.knoll@digia.com>
189 lines
5.1 KiB
C++
189 lines
5.1 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
|
|
** Contact: http://www.qt-project.org/legal
|
|
**
|
|
** This file is part of the examples of the Qt Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:BSD$
|
|
** You may use this file under the terms of the BSD license as follows:
|
|
**
|
|
** "Redistribution and use in source and binary forms, with or without
|
|
** modification, are permitted provided that the following conditions are
|
|
** met:
|
|
** * Redistributions of source code must retain the above copyright
|
|
** notice, this list of conditions and the following disclaimer.
|
|
** * Redistributions in binary form must reproduce the above copyright
|
|
** notice, this list of conditions and the following disclaimer in
|
|
** the documentation and/or other materials provided with the
|
|
** distribution.
|
|
** * Neither the name of Digia Plc and its Subsidiary(-ies) nor the names
|
|
** of its contributors may be used to endorse or promote products derived
|
|
** from this software without specific prior written permission.
|
|
**
|
|
**
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#include "domitem.h"
|
|
#include "dommodel.h"
|
|
|
|
#include <QtXml>
|
|
|
|
//! [0]
|
|
DomModel::DomModel(QDomDocument document, QObject *parent)
|
|
: QAbstractItemModel(parent), domDocument(document)
|
|
{
|
|
rootItem = new DomItem(domDocument, 0);
|
|
}
|
|
//! [0]
|
|
|
|
//! [1]
|
|
DomModel::~DomModel()
|
|
{
|
|
delete rootItem;
|
|
}
|
|
//! [1]
|
|
|
|
//! [2]
|
|
int DomModel::columnCount(const QModelIndex &/*parent*/) const
|
|
{
|
|
return 3;
|
|
}
|
|
//! [2]
|
|
|
|
//! [3]
|
|
QVariant DomModel::data(const QModelIndex &index, int role) const
|
|
{
|
|
if (!index.isValid())
|
|
return QVariant();
|
|
|
|
if (role != Qt::DisplayRole)
|
|
return QVariant();
|
|
|
|
DomItem *item = static_cast<DomItem*>(index.internalPointer());
|
|
|
|
QDomNode node = item->node();
|
|
//! [3] //! [4]
|
|
QStringList attributes;
|
|
QDomNamedNodeMap attributeMap = node.attributes();
|
|
|
|
switch (index.column()) {
|
|
case 0:
|
|
return node.nodeName();
|
|
case 1:
|
|
for (int i = 0; i < attributeMap.count(); ++i) {
|
|
QDomNode attribute = attributeMap.item(i);
|
|
attributes << attribute.nodeName() + "=\""
|
|
+attribute.nodeValue() + "\"";
|
|
}
|
|
return attributes.join(' ');
|
|
case 2:
|
|
return node.nodeValue().split("\n").join(' ');
|
|
default:
|
|
return QVariant();
|
|
}
|
|
}
|
|
//! [4]
|
|
|
|
//! [5]
|
|
Qt::ItemFlags DomModel::flags(const QModelIndex &index) const
|
|
{
|
|
if (!index.isValid())
|
|
return 0;
|
|
|
|
return QAbstractItemModel::flags(index);
|
|
}
|
|
//! [5]
|
|
|
|
//! [6]
|
|
QVariant DomModel::headerData(int section, Qt::Orientation orientation,
|
|
int role) const
|
|
{
|
|
if (orientation == Qt::Horizontal && role == Qt::DisplayRole) {
|
|
switch (section) {
|
|
case 0:
|
|
return tr("Name");
|
|
case 1:
|
|
return tr("Attributes");
|
|
case 2:
|
|
return tr("Value");
|
|
default:
|
|
return QVariant();
|
|
}
|
|
}
|
|
|
|
return QVariant();
|
|
}
|
|
//! [6]
|
|
|
|
//! [7]
|
|
QModelIndex DomModel::index(int row, int column, const QModelIndex &parent)
|
|
const
|
|
{
|
|
if (!hasIndex(row, column, parent))
|
|
return QModelIndex();
|
|
|
|
DomItem *parentItem;
|
|
|
|
if (!parent.isValid())
|
|
parentItem = rootItem;
|
|
else
|
|
parentItem = static_cast<DomItem*>(parent.internalPointer());
|
|
//! [7]
|
|
|
|
//! [8]
|
|
DomItem *childItem = parentItem->child(row);
|
|
if (childItem)
|
|
return createIndex(row, column, childItem);
|
|
else
|
|
return QModelIndex();
|
|
}
|
|
//! [8]
|
|
|
|
//! [9]
|
|
QModelIndex DomModel::parent(const QModelIndex &child) const
|
|
{
|
|
if (!child.isValid())
|
|
return QModelIndex();
|
|
|
|
DomItem *childItem = static_cast<DomItem*>(child.internalPointer());
|
|
DomItem *parentItem = childItem->parent();
|
|
|
|
if (!parentItem || parentItem == rootItem)
|
|
return QModelIndex();
|
|
|
|
return createIndex(parentItem->row(), 0, parentItem);
|
|
}
|
|
//! [9]
|
|
|
|
//! [10]
|
|
int DomModel::rowCount(const QModelIndex &parent) const
|
|
{
|
|
if (parent.column() > 0)
|
|
return 0;
|
|
|
|
DomItem *parentItem;
|
|
|
|
if (!parent.isValid())
|
|
parentItem = rootItem;
|
|
else
|
|
parentItem = static_cast<DomItem*>(parent.internalPointer());
|
|
|
|
return parentItem->node().childNodes().count();
|
|
}
|
|
//! [10]
|