0b3390f33d
Change-Id: Ie4965e3ce3113e9c7a5d5d5eba4cab143ef1c806 Reviewed-by: Thiago Macieira <thiago.macieira@intel.com>
143 lines
3.0 KiB
C++
143 lines
3.0 KiB
C++
// Copyright (C) 2016 The Qt Company Ltd.
|
|
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR BSD-3-Clause
|
|
|
|
/*
|
|
treeitem.cpp
|
|
|
|
A container for items of data supplied by the simple tree model.
|
|
*/
|
|
|
|
#include "treeitem.h"
|
|
|
|
//! [0]
|
|
TreeItem::TreeItem(const QVariantList &data, TreeItem *parent)
|
|
: itemData(data), m_parentItem(parent)
|
|
{}
|
|
//! [0]
|
|
|
|
//! [1]
|
|
TreeItem *TreeItem::child(int number)
|
|
{
|
|
if (number < 0 || number >= qsizetype(m_childItems.size()))
|
|
return nullptr;
|
|
return m_childItems.at(number).get();
|
|
}
|
|
//! [1]
|
|
|
|
//! [2]
|
|
int TreeItem::childCount() const
|
|
{
|
|
return m_childItems.size();
|
|
}
|
|
//! [2]
|
|
|
|
//! [3]
|
|
int TreeItem::row() const
|
|
{
|
|
if (!m_parentItem)
|
|
return 0;
|
|
const auto it = std::find_if(m_parentItem->m_childItems.cbegin(), m_parentItem->m_childItems.cend(),
|
|
[this](const std::unique_ptr<TreeItem> &treeItem) {
|
|
return treeItem.get() == const_cast<TreeItem *>(this);
|
|
});
|
|
|
|
if (it != m_parentItem->m_childItems.cend())
|
|
return std::distance(m_parentItem->m_childItems.cbegin(), it);
|
|
Q_ASSERT(false); // should not happen
|
|
return -1;
|
|
}
|
|
//! [3]
|
|
|
|
//! [4]
|
|
int TreeItem::columnCount() const
|
|
{
|
|
return itemData.count();
|
|
}
|
|
//! [4]
|
|
|
|
//! [5]
|
|
QVariant TreeItem::data(int column) const
|
|
{
|
|
if (column < 0 || column >= itemData.size())
|
|
return QVariant();
|
|
return itemData.at(column);
|
|
}
|
|
//! [5]
|
|
|
|
//! [6]
|
|
bool TreeItem::insertChildren(int position, int count, int columns)
|
|
{
|
|
if (position < 0 || position > qsizetype(m_childItems.size()))
|
|
return false;
|
|
|
|
for (int row = 0; row < count; ++row) {
|
|
QVariantList data(columns);
|
|
m_childItems.insert(m_childItems.cbegin() + position,
|
|
std::make_unique<TreeItem>(data, this));
|
|
}
|
|
|
|
return true;
|
|
}
|
|
//! [6]
|
|
|
|
//! [7]
|
|
bool TreeItem::insertColumns(int position, int columns)
|
|
{
|
|
if (position < 0 || position > itemData.size())
|
|
return false;
|
|
|
|
for (int column = 0; column < columns; ++column)
|
|
itemData.insert(position, QVariant());
|
|
|
|
for (auto &child : std::as_const(m_childItems))
|
|
child->insertColumns(position, columns);
|
|
|
|
return true;
|
|
}
|
|
//! [7]
|
|
|
|
//! [8]
|
|
TreeItem *TreeItem::parent()
|
|
{
|
|
return m_parentItem;
|
|
}
|
|
//! [8]
|
|
|
|
//! [9]
|
|
bool TreeItem::removeChildren(int position, int count)
|
|
{
|
|
if (position < 0 || position + count > qsizetype(m_childItems.size()))
|
|
return false;
|
|
|
|
for (int row = 0; row < count; ++row)
|
|
m_childItems.erase(m_childItems.cbegin() + position);
|
|
|
|
return true;
|
|
}
|
|
//! [9]
|
|
|
|
bool TreeItem::removeColumns(int position, int columns)
|
|
{
|
|
if (position < 0 || position + columns > itemData.size())
|
|
return false;
|
|
|
|
for (int column = 0; column < columns; ++column)
|
|
itemData.remove(position);
|
|
|
|
for (auto &child : std::as_const(m_childItems))
|
|
child->removeColumns(position, columns);
|
|
|
|
return true;
|
|
}
|
|
|
|
//! [10]
|
|
bool TreeItem::setData(int column, const QVariant &value)
|
|
{
|
|
if (column < 0 || column >= itemData.size())
|
|
return false;
|
|
|
|
itemData[column] = value;
|
|
return true;
|
|
}
|
|
//! [10]
|