102 lines
2.9 KiB
C++
102 lines
2.9 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2012 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 <QtXml>
|
|
|
|
//! [0]
|
|
DomItem::DomItem(QDomNode &node, int row, DomItem *parent)
|
|
{
|
|
domNode = node;
|
|
//! [0]
|
|
// Record the item's location within its parent.
|
|
//! [1]
|
|
rowNumber = row;
|
|
parentItem = parent;
|
|
}
|
|
//! [1]
|
|
|
|
//! [2]
|
|
DomItem::~DomItem()
|
|
{
|
|
QHash<int,DomItem*>::iterator it;
|
|
for (it = childItems.begin(); it != childItems.end(); ++it)
|
|
delete it.value();
|
|
}
|
|
//! [2]
|
|
|
|
//! [3]
|
|
QDomNode DomItem::node() const
|
|
{
|
|
return domNode;
|
|
}
|
|
//! [3]
|
|
|
|
//! [4]
|
|
DomItem *DomItem::parent()
|
|
{
|
|
return parentItem;
|
|
}
|
|
//! [4]
|
|
|
|
//! [5]
|
|
DomItem *DomItem::child(int i)
|
|
{
|
|
if (childItems.contains(i))
|
|
return childItems[i];
|
|
|
|
if (i >= 0 && i < domNode.childNodes().count()) {
|
|
QDomNode childNode = domNode.childNodes().item(i);
|
|
DomItem *childItem = new DomItem(childNode, i, this);
|
|
childItems[i] = childItem;
|
|
return childItem;
|
|
}
|
|
return 0;
|
|
}
|
|
//! [5]
|
|
|
|
//! [6]
|
|
int DomItem::row()
|
|
{
|
|
return rowNumber;
|
|
}
|
|
//! [6]
|