1 | /****************************************************************************
|
---|
2 | **
|
---|
3 | ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
---|
4 | ** All rights reserved.
|
---|
5 | ** Contact: Nokia Corporation ([email protected])
|
---|
6 | **
|
---|
7 | ** This file is part of the documentation 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 | /*
|
---|
42 | treeitem.cpp
|
---|
43 |
|
---|
44 | A container for items of data supplied by the simple tree model.
|
---|
45 | */
|
---|
46 |
|
---|
47 | #include <QStringList>
|
---|
48 |
|
---|
49 | #include "treeitem.h"
|
---|
50 |
|
---|
51 | TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)
|
---|
52 | {
|
---|
53 | parentItem = parent;
|
---|
54 | itemData = data;
|
---|
55 | }
|
---|
56 |
|
---|
57 | TreeItem::~TreeItem()
|
---|
58 | {
|
---|
59 | qDeleteAll(childItems);
|
---|
60 | }
|
---|
61 |
|
---|
62 | void TreeItem::appendChild(TreeItem *item)
|
---|
63 | {
|
---|
64 | childItems.append(item);
|
---|
65 | }
|
---|
66 |
|
---|
67 | TreeItem *TreeItem::child(int row)
|
---|
68 | {
|
---|
69 | return childItems.value(row);
|
---|
70 | }
|
---|
71 |
|
---|
72 | int TreeItem::childCount() const
|
---|
73 | {
|
---|
74 | return childItems.count();
|
---|
75 | }
|
---|
76 |
|
---|
77 | int TreeItem::columnCount() const
|
---|
78 | {
|
---|
79 | return itemData.count();
|
---|
80 | }
|
---|
81 |
|
---|
82 | QVariant TreeItem::data(int column) const
|
---|
83 | {
|
---|
84 | return itemData.value(column);
|
---|
85 | }
|
---|
86 |
|
---|
87 | bool TreeItem::insertChild(int row, TreeItem *item)
|
---|
88 | {
|
---|
89 | if (row < 0 || row > childItems.count())
|
---|
90 | return false;
|
---|
91 |
|
---|
92 | childItems.insert(row, item);
|
---|
93 | return true;
|
---|
94 | }
|
---|
95 |
|
---|
96 | TreeItem *TreeItem::parent()
|
---|
97 | {
|
---|
98 | return parentItem;
|
---|
99 | }
|
---|
100 |
|
---|
101 | bool TreeItem::removeChild(int row)
|
---|
102 | {
|
---|
103 | if (row < 0 || row >= childItems.count())
|
---|
104 | return false;
|
---|
105 |
|
---|
106 | delete childItems.takeAt(row);
|
---|
107 | return true;
|
---|
108 | }
|
---|
109 |
|
---|
110 | int TreeItem::row() const
|
---|
111 | {
|
---|
112 | if (parentItem)
|
---|
113 | return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));
|
---|
114 |
|
---|
115 | return 0;
|
---|
116 | }
|
---|
117 |
|
---|
118 | bool TreeItem::setData(int column, const QVariant &data)
|
---|
119 | {
|
---|
120 | if (column < 0 || column >= itemData.count())
|
---|
121 | return false;
|
---|
122 |
|
---|
123 | itemData.replace(column, data);
|
---|
124 | return true;
|
---|
125 | }
|
---|