|
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 documentation 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 /* |
|
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 TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent) |
|
53 { |
|
54 parentItem = parent; |
|
55 itemData = data; |
|
56 } |
|
57 |
|
58 TreeItem::~TreeItem() |
|
59 { |
|
60 qDeleteAll(childItems); |
|
61 } |
|
62 |
|
63 void TreeItem::appendChild(TreeItem *item) |
|
64 { |
|
65 childItems.append(item); |
|
66 } |
|
67 |
|
68 TreeItem *TreeItem::child(int row) |
|
69 { |
|
70 return childItems.value(row); |
|
71 } |
|
72 |
|
73 int TreeItem::childCount() const |
|
74 { |
|
75 return childItems.count(); |
|
76 } |
|
77 |
|
78 int TreeItem::columnCount() const |
|
79 { |
|
80 return itemData.count(); |
|
81 } |
|
82 |
|
83 QVariant TreeItem::data(int column) const |
|
84 { |
|
85 return itemData.value(column); |
|
86 } |
|
87 |
|
88 bool TreeItem::insertChild(int row, TreeItem *item) |
|
89 { |
|
90 if (row < 0 || row > childItems.count()) |
|
91 return false; |
|
92 |
|
93 childItems.insert(row, item); |
|
94 return true; |
|
95 } |
|
96 |
|
97 TreeItem *TreeItem::parent() |
|
98 { |
|
99 return parentItem; |
|
100 } |
|
101 |
|
102 bool TreeItem::removeChild(int row) |
|
103 { |
|
104 if (row < 0 || row >= childItems.count()) |
|
105 return false; |
|
106 |
|
107 delete childItems.takeAt(row); |
|
108 return true; |
|
109 } |
|
110 |
|
111 int TreeItem::row() const |
|
112 { |
|
113 if (parentItem) |
|
114 return parentItem->childItems.indexOf(const_cast<TreeItem*>(this)); |
|
115 |
|
116 return 0; |
|
117 } |
|
118 |
|
119 bool TreeItem::setData(int column, const QVariant &data) |
|
120 { |
|
121 if (column < 0 || column >= itemData.count()) |
|
122 return false; |
|
123 |
|
124 itemData.replace(column, data); |
|
125 return true; |
|
126 } |