| 1 | /****************************************************************************
|
|---|
| 2 | **
|
|---|
| 3 | ** Copyright (C) 2010 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 | ** Commercial Usage
|
|---|
| 11 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
|---|
| 12 | ** accordance with the Qt Commercial License Agreement provided with the
|
|---|
| 13 | ** Software or, alternatively, in accordance with the terms contained in
|
|---|
| 14 | ** a written agreement between you and Nokia.
|
|---|
| 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 | ** GNU General Public License Usage
|
|---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
|---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
|---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
|---|
| 32 | ** packaging of this file. Please review the following information to
|
|---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
|---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
|---|
| 35 | **
|
|---|
| 36 | ** If you have questions regarding the use of this file, please contact
|
|---|
| 37 | ** Nokia at qt-info@nokia.com.
|
|---|
| 38 | ** $QT_END_LICENSE$
|
|---|
| 39 | **
|
|---|
| 40 | ****************************************************************************/
|
|---|
| 41 |
|
|---|
| 42 | /*
|
|---|
| 43 | treeitem.cpp
|
|---|
| 44 |
|
|---|
| 45 | A container for items of data supplied by the simple tree model.
|
|---|
| 46 | */
|
|---|
| 47 |
|
|---|
| 48 | #include <QStringList>
|
|---|
| 49 |
|
|---|
| 50 | #include "treeitem.h"
|
|---|
| 51 |
|
|---|
| 52 | //! [0]
|
|---|
| 53 | TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)
|
|---|
| 54 | {
|
|---|
| 55 | parentItem = parent;
|
|---|
| 56 | itemData = data;
|
|---|
| 57 | }
|
|---|
| 58 | //! [0]
|
|---|
| 59 |
|
|---|
| 60 | //! [1]
|
|---|
| 61 | TreeItem::~TreeItem()
|
|---|
| 62 | {
|
|---|
| 63 | qDeleteAll(childItems);
|
|---|
| 64 | }
|
|---|
| 65 | //! [1]
|
|---|
| 66 |
|
|---|
| 67 | //! [2]
|
|---|
| 68 | void TreeItem::appendChild(TreeItem *item)
|
|---|
| 69 | {
|
|---|
| 70 | childItems.append(item);
|
|---|
| 71 | }
|
|---|
| 72 | //! [2]
|
|---|
| 73 |
|
|---|
| 74 | //! [3]
|
|---|
| 75 | TreeItem *TreeItem::child(int row)
|
|---|
| 76 | {
|
|---|
| 77 | return childItems.value(row);
|
|---|
| 78 | }
|
|---|
| 79 | //! [3]
|
|---|
| 80 |
|
|---|
| 81 | //! [4]
|
|---|
| 82 | int TreeItem::childCount() const
|
|---|
| 83 | {
|
|---|
| 84 | return childItems.count();
|
|---|
| 85 | }
|
|---|
| 86 | //! [4]
|
|---|
| 87 |
|
|---|
| 88 | //! [5]
|
|---|
| 89 | int TreeItem::columnCount() const
|
|---|
| 90 | {
|
|---|
| 91 | return itemData.count();
|
|---|
| 92 | }
|
|---|
| 93 | //! [5]
|
|---|
| 94 |
|
|---|
| 95 | //! [6]
|
|---|
| 96 | QVariant TreeItem::data(int column) const
|
|---|
| 97 | {
|
|---|
| 98 | return itemData.value(column);
|
|---|
| 99 | }
|
|---|
| 100 | //! [6]
|
|---|
| 101 |
|
|---|
| 102 | //! [7]
|
|---|
| 103 | TreeItem *TreeItem::parent()
|
|---|
| 104 | {
|
|---|
| 105 | return parentItem;
|
|---|
| 106 | }
|
|---|
| 107 | //! [7]
|
|---|
| 108 |
|
|---|
| 109 | //! [8]
|
|---|
| 110 | int TreeItem::row() const
|
|---|
| 111 | {
|
|---|
| 112 | if (parentItem)
|
|---|
| 113 | return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));
|
|---|
| 114 |
|
|---|
| 115 | return 0;
|
|---|
| 116 | }
|
|---|
| 117 | //! [8]
|
|---|
