0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the examples of the Qt Toolkit.
|
|
8 |
**
|
|
9 |
** $QT_BEGIN_LICENSE:LGPL$
|
|
10 |
** No Commercial Usage
|
|
11 |
** This file contains pre-release code and may not be distributed.
|
|
12 |
** You may use this file in accordance with the terms and conditions
|
|
13 |
** contained in the Technology Preview License Agreement accompanying
|
|
14 |
** this package.
|
|
15 |
**
|
|
16 |
** GNU Lesser General Public License Usage
|
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
18 |
** General Public License version 2.1 as published by the Free Software
|
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
20 |
** packaging of this file. Please review the following information to
|
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
23 |
**
|
|
24 |
** In addition, as a special exception, Nokia gives you certain additional
|
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
27 |
**
|
|
28 |
** If you have questions regarding the use of this file, please contact
|
|
29 |
** Nokia at qt-info@nokia.com.
|
|
30 |
**
|
|
31 |
**
|
|
32 |
**
|
|
33 |
**
|
|
34 |
**
|
|
35 |
**
|
|
36 |
**
|
|
37 |
**
|
|
38 |
** $QT_END_LICENSE$
|
|
39 |
**
|
|
40 |
****************************************************************************/
|
|
41 |
|
|
42 |
#include <QtXml>
|
|
43 |
|
|
44 |
#include "domitem.h"
|
|
45 |
|
|
46 |
//! [0]
|
|
47 |
DomItem::DomItem(QDomNode &node, int row, DomItem *parent)
|
|
48 |
{
|
|
49 |
domNode = node;
|
|
50 |
//! [0]
|
|
51 |
// Record the item's location within its parent.
|
|
52 |
//! [1]
|
|
53 |
rowNumber = row;
|
|
54 |
parentItem = parent;
|
|
55 |
}
|
|
56 |
//! [1]
|
|
57 |
|
|
58 |
//! [2]
|
|
59 |
DomItem::~DomItem()
|
|
60 |
{
|
|
61 |
QHash<int,DomItem*>::iterator it;
|
|
62 |
for (it = childItems.begin(); it != childItems.end(); ++it)
|
|
63 |
delete it.value();
|
|
64 |
}
|
|
65 |
//! [2]
|
|
66 |
|
|
67 |
//! [3]
|
|
68 |
QDomNode DomItem::node() const
|
|
69 |
{
|
|
70 |
return domNode;
|
|
71 |
}
|
|
72 |
//! [3]
|
|
73 |
|
|
74 |
//! [4]
|
|
75 |
DomItem *DomItem::parent()
|
|
76 |
{
|
|
77 |
return parentItem;
|
|
78 |
}
|
|
79 |
//! [4]
|
|
80 |
|
|
81 |
//! [5]
|
|
82 |
DomItem *DomItem::child(int i)
|
|
83 |
{
|
|
84 |
if (childItems.contains(i))
|
|
85 |
return childItems[i];
|
|
86 |
|
|
87 |
if (i >= 0 && i < domNode.childNodes().count()) {
|
|
88 |
QDomNode childNode = domNode.childNodes().item(i);
|
|
89 |
DomItem *childItem = new DomItem(childNode, i, this);
|
|
90 |
childItems[i] = childItem;
|
|
91 |
return childItem;
|
|
92 |
}
|
|
93 |
return 0;
|
|
94 |
}
|
|
95 |
//! [5]
|
|
96 |
|
|
97 |
//! [6]
|
|
98 |
int DomItem::row()
|
|
99 |
{
|
|
100 |
return rowNumber;
|
|
101 |
}
|
|
102 |
//! [6]
|