1/****************************************************************************
2**
3** Copyright (C) 2016 The Qt Company Ltd.
4** Contact: https://www.qt.io/licensing/
5**
6** This file is part of the examples of the Qt Toolkit.
7**
8** $QT_BEGIN_LICENSE:BSD$
9** Commercial License Usage
10** Licensees holding valid commercial Qt licenses may use this file in
11** accordance with the commercial license agreement provided with the
12** Software or, alternatively, in accordance with the terms contained in
13** a written agreement between you and The Qt Company. For licensing terms
14** and conditions see https://www.qt.io/terms-conditions. For further
15** information use the contact form at https://www.qt.io/contact-us.
16**
17** BSD License Usage
18** Alternatively, you may use this file under the terms of the BSD license
19** as follows:
20**
21** "Redistribution and use in source and binary forms, with or without
22** modification, are permitted provided that the following conditions are
23** met:
24** * Redistributions of source code must retain the above copyright
25** notice, this list of conditions and the following disclaimer.
26** * Redistributions in binary form must reproduce the above copyright
27** notice, this list of conditions and the following disclaimer in
28** the documentation and/or other materials provided with the
29** distribution.
30** * Neither the name of The Qt Company Ltd nor the names of its
31** contributors may be used to endorse or promote products derived
32** from this software without specific prior written permission.
33**
34**
35** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
38** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
39** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
41** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
42** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
43** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
44** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
45** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
46**
47** $QT_END_LICENSE$
48**
49****************************************************************************/
50
51/*
52 treeitem.cpp
53
54 A container for items of data supplied by the simple tree model.
55*/
56
57#include "treeitem.h"
58
59//! [0]
60TreeItem::TreeItem(const QVector<QVariant> &data, TreeItem *parent)
61 : itemData(data),
62 parentItem(parent)
63{}
64//! [0]
65
66//! [1]
67TreeItem::~TreeItem()
68{
69 qDeleteAll(c: childItems);
70}
71//! [1]
72
73//! [2]
74TreeItem *TreeItem::child(int number)
75{
76 if (number < 0 || number >= childItems.size())
77 return nullptr;
78 return childItems.at(i: number);
79}
80//! [2]
81
82//! [3]
83int TreeItem::childCount() const
84{
85 return childItems.count();
86}
87//! [3]
88
89//! [4]
90int TreeItem::childNumber() const
91{
92 if (parentItem)
93 return parentItem->childItems.indexOf(t: const_cast<TreeItem*>(this));
94 return 0;
95}
96//! [4]
97
98//! [5]
99int TreeItem::columnCount() const
100{
101 return itemData.count();
102}
103//! [5]
104
105//! [6]
106QVariant TreeItem::data(int column) const
107{
108 if (column < 0 || column >= itemData.size())
109 return QVariant();
110 return itemData.at(i: column);
111}
112//! [6]
113
114//! [7]
115bool TreeItem::insertChildren(int position, int count, int columns)
116{
117 if (position < 0 || position > childItems.size())
118 return false;
119
120 for (int row = 0; row < count; ++row) {
121 QVector<QVariant> data(columns);
122 TreeItem *item = new TreeItem(data, this);
123 childItems.insert(i: position, t: item);
124 }
125
126 return true;
127}
128//! [7]
129
130//! [8]
131bool TreeItem::insertColumns(int position, int columns)
132{
133 if (position < 0 || position > itemData.size())
134 return false;
135
136 for (int column = 0; column < columns; ++column)
137 itemData.insert(i: position, t: QVariant());
138
139 for (TreeItem *child : qAsConst(t&: childItems))
140 child->insertColumns(position, columns);
141
142 return true;
143}
144//! [8]
145
146//! [9]
147TreeItem *TreeItem::parent()
148{
149 return parentItem;
150}
151//! [9]
152
153//! [10]
154bool TreeItem::removeChildren(int position, int count)
155{
156 if (position < 0 || position + count > childItems.size())
157 return false;
158
159 for (int row = 0; row < count; ++row)
160 delete childItems.takeAt(i: position);
161
162 return true;
163}
164//! [10]
165
166bool TreeItem::removeColumns(int position, int columns)
167{
168 if (position < 0 || position + columns > itemData.size())
169 return false;
170
171 for (int column = 0; column < columns; ++column)
172 itemData.remove(i: position);
173
174 for (TreeItem *child : qAsConst(t&: childItems))
175 child->removeColumns(position, columns);
176
177 return true;
178}
179
180//! [11]
181bool TreeItem::setData(int column, const QVariant &value)
182{
183 if (column < 0 || column >= itemData.size())
184 return false;
185
186 itemData[column] = value;
187 return true;
188}
189//! [11]
190

source code of qtbase/examples/widgets/itemviews/editabletreemodel/treeitem.cpp