| 1 | /**************************************************************************** | 
|---|
| 2 | ** | 
|---|
| 3 | ** Copyright (C) 2011 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:BSD$ | 
|---|
| 10 | ** You may use this file under the terms of the BSD license as follows: | 
|---|
| 11 | ** | 
|---|
| 12 | ** "Redistribution and use in source and binary forms, with or without | 
|---|
| 13 | ** modification, are permitted provided that the following conditions are | 
|---|
| 14 | ** met: | 
|---|
| 15 | **   * Redistributions of source code must retain the above copyright | 
|---|
| 16 | **     notice, this list of conditions and the following disclaimer. | 
|---|
| 17 | **   * Redistributions in binary form must reproduce the above copyright | 
|---|
| 18 | **     notice, this list of conditions and the following disclaimer in | 
|---|
| 19 | **     the documentation and/or other materials provided with the | 
|---|
| 20 | **     distribution. | 
|---|
| 21 | **   * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor | 
|---|
| 22 | **     the names of its contributors may be used to endorse or promote | 
|---|
| 23 | **     products derived from this software without specific prior written | 
|---|
| 24 | **     permission. | 
|---|
| 25 | ** | 
|---|
| 26 | ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
|---|
| 27 | ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
|---|
| 28 | ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
|---|
| 29 | ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 
|---|
| 30 | ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
|---|
| 31 | ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
|---|
| 32 | ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
|---|
| 33 | ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
|---|
| 34 | ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
|---|
| 35 | ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 
|---|
| 36 | ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." | 
|---|
| 37 | ** $QT_END_LICENSE$ | 
|---|
| 38 | ** | 
|---|
| 39 | ****************************************************************************/ | 
|---|
| 40 |  | 
|---|
| 41 | #include <QtXml> | 
|---|
| 42 |  | 
|---|
| 43 | #include "domitem.h" | 
|---|
| 44 |  | 
|---|
| 45 | //! [0] | 
|---|
| 46 | DomItem::DomItem(QDomNode &node, int row, DomItem *parent) | 
|---|
| 47 | { | 
|---|
| 48 | domNode = node; | 
|---|
| 49 | //! [0] | 
|---|
| 50 | // Record the item's location within its parent. | 
|---|
| 51 | //! [1] | 
|---|
| 52 | rowNumber = row; | 
|---|
| 53 | parentItem = parent; | 
|---|
| 54 | } | 
|---|
| 55 | //! [1] | 
|---|
| 56 |  | 
|---|
| 57 | //! [2] | 
|---|
| 58 | DomItem::~DomItem() | 
|---|
| 59 | { | 
|---|
| 60 | QHash<int,DomItem*>::iterator it; | 
|---|
| 61 | for (it = childItems.begin(); it != childItems.end(); ++it) | 
|---|
| 62 | delete it.value(); | 
|---|
| 63 | } | 
|---|
| 64 | //! [2] | 
|---|
| 65 |  | 
|---|
| 66 | //! [3] | 
|---|
| 67 | QDomNode DomItem::node() const | 
|---|
| 68 | { | 
|---|
| 69 | return domNode; | 
|---|
| 70 | } | 
|---|
| 71 | //! [3] | 
|---|
| 72 |  | 
|---|
| 73 | //! [4] | 
|---|
| 74 | DomItem *DomItem::parent() | 
|---|
| 75 | { | 
|---|
| 76 | return parentItem; | 
|---|
| 77 | } | 
|---|
| 78 | //! [4] | 
|---|
| 79 |  | 
|---|
| 80 | //! [5] | 
|---|
| 81 | DomItem *DomItem::child(int i) | 
|---|
| 82 | { | 
|---|
| 83 | if (childItems.contains(i)) | 
|---|
| 84 | return childItems[i]; | 
|---|
| 85 |  | 
|---|
| 86 | if (i >= 0 && i < domNode.childNodes().count()) { | 
|---|
| 87 | QDomNode childNode = domNode.childNodes().item(i); | 
|---|
| 88 | DomItem *childItem = new DomItem(childNode, i, this); | 
|---|
| 89 | childItems[i] = childItem; | 
|---|
| 90 | return childItem; | 
|---|
| 91 | } | 
|---|
| 92 | return 0; | 
|---|
| 93 | } | 
|---|
| 94 | //! [5] | 
|---|
| 95 |  | 
|---|
| 96 | //! [6] | 
|---|
| 97 | int DomItem::row() | 
|---|
| 98 | { | 
|---|
| 99 | return rowNumber; | 
|---|
| 100 | } | 
|---|
| 101 | //! [6] | 
|---|