29c99bddbf
Task-number: QTBUG-84469 Change-Id: Id14119168bb1bf11f99bda7ef6ee9cf51bcfab2e Reviewed-by: Sona Kurazyan <sona.kurazyan@qt.io>
127 lines
3.5 KiB
C++
127 lines
3.5 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
** Contact: https://www.qt.io/licensing/
|
|
**
|
|
** This file is part of the examples of the Qt Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:BSD$
|
|
** Commercial License Usage
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
** accordance with the commercial license agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
**
|
|
** BSD License Usage
|
|
** Alternatively, you may use this file under the terms of the BSD license
|
|
** as follows:
|
|
**
|
|
** "Redistribution and use in source and binary forms, with or without
|
|
** modification, are permitted provided that the following conditions are
|
|
** met:
|
|
** * Redistributions of source code must retain the above copyright
|
|
** notice, this list of conditions and the following disclaimer.
|
|
** * Redistributions in binary form must reproduce the above copyright
|
|
** notice, this list of conditions and the following disclaimer in
|
|
** the documentation and/or other materials provided with the
|
|
** distribution.
|
|
** * Neither the name of The Qt Company Ltd nor the names of its
|
|
** contributors may be used to endorse or promote products derived
|
|
** from this software without specific prior written permission.
|
|
**
|
|
**
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
/*
|
|
treeitem.cpp
|
|
|
|
A container for items of data supplied by the simple tree model.
|
|
*/
|
|
|
|
#include "treeitem.h"
|
|
|
|
//! [0]
|
|
TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)
|
|
: m_itemData(data), m_parentItem(parent)
|
|
{}
|
|
//! [0]
|
|
|
|
//! [1]
|
|
TreeItem::~TreeItem()
|
|
{
|
|
qDeleteAll(m_childItems);
|
|
}
|
|
//! [1]
|
|
|
|
//! [2]
|
|
void TreeItem::appendChild(TreeItem *item)
|
|
{
|
|
m_childItems.append(item);
|
|
}
|
|
//! [2]
|
|
|
|
//! [3]
|
|
TreeItem *TreeItem::child(int row)
|
|
{
|
|
if (row < 0 || row >= m_childItems.size())
|
|
return nullptr;
|
|
return m_childItems.at(row);
|
|
}
|
|
//! [3]
|
|
|
|
//! [4]
|
|
int TreeItem::childCount() const
|
|
{
|
|
return m_childItems.count();
|
|
}
|
|
//! [4]
|
|
|
|
//! [5]
|
|
int TreeItem::columnCount() const
|
|
{
|
|
return m_itemData.count();
|
|
}
|
|
//! [5]
|
|
|
|
//! [6]
|
|
QVariant TreeItem::data(int column) const
|
|
{
|
|
if (column < 0 || column >= m_itemData.size())
|
|
return QVariant();
|
|
return m_itemData.at(column);
|
|
}
|
|
//! [6]
|
|
|
|
//! [7]
|
|
TreeItem *TreeItem::parentItem()
|
|
{
|
|
return m_parentItem;
|
|
}
|
|
//! [7]
|
|
|
|
//! [8]
|
|
int TreeItem::row() const
|
|
{
|
|
if (m_parentItem)
|
|
return m_parentItem->m_childItems.indexOf(const_cast<TreeItem*>(this));
|
|
|
|
return 0;
|
|
}
|
|
//! [8]
|