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] |
60 | TreeItem::TreeItem(const QVector<QVariant> &data, TreeItem *parent) |
61 | : m_itemData(data), m_parentItem(parent) |
62 | {} |
63 | //! [0] |
64 | |
65 | //! [1] |
66 | TreeItem::~TreeItem() |
67 | { |
68 | qDeleteAll(c: m_childItems); |
69 | } |
70 | //! [1] |
71 | |
72 | //! [2] |
73 | void TreeItem::appendChild(TreeItem *item) |
74 | { |
75 | m_childItems.append(t: item); |
76 | } |
77 | //! [2] |
78 | |
79 | //! [3] |
80 | TreeItem *TreeItem::child(int row) |
81 | { |
82 | if (row < 0 || row >= m_childItems.size()) |
83 | return nullptr; |
84 | return m_childItems.at(i: row); |
85 | } |
86 | //! [3] |
87 | |
88 | //! [4] |
89 | int TreeItem::childCount() const |
90 | { |
91 | return m_childItems.count(); |
92 | } |
93 | //! [4] |
94 | |
95 | //! [5] |
96 | int TreeItem::columnCount() const |
97 | { |
98 | return m_itemData.count(); |
99 | } |
100 | //! [5] |
101 | |
102 | //! [6] |
103 | QVariant TreeItem::data(int column) const |
104 | { |
105 | if (column < 0 || column >= m_itemData.size()) |
106 | return QVariant(); |
107 | return m_itemData.at(i: column); |
108 | } |
109 | //! [6] |
110 | |
111 | //! [7] |
112 | TreeItem *TreeItem::parentItem() |
113 | { |
114 | return m_parentItem; |
115 | } |
116 | //! [7] |
117 | |
118 | //! [8] |
119 | int TreeItem::row() const |
120 | { |
121 | if (m_parentItem) |
122 | return m_parentItem->m_childItems.indexOf(t: const_cast<TreeItem*>(this)); |
123 | |
124 | return 0; |
125 | } |
126 | //! [8] |
127 | |