mirror of
https://github.com/HifiExperiments/overte.git
synced 2025-04-05 20:36:28 +02:00
91 lines
1.9 KiB
C++
91 lines
1.9 KiB
C++
//
|
|
// TreeItem
|
|
//
|
|
// Created by Anthony Thibault on 6/5/2019
|
|
// Copyright 2019 High Fidelity, Inc.
|
|
//
|
|
// Distributed under the Apache License, Version 2.0.
|
|
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
|
|
//
|
|
|
|
#include "treeitem.h"
|
|
#include <QDebug>
|
|
#include <QStringList>
|
|
|
|
TreeItem::TreeItem(const QList<QVariant>& data) {
|
|
m_parentItem = nullptr;
|
|
m_itemData = data;
|
|
}
|
|
|
|
TreeItem::~TreeItem() {
|
|
qDeleteAll(m_childItems);
|
|
}
|
|
|
|
void TreeItem::appendChild(TreeItem *item) {
|
|
item->m_parentItem = this;
|
|
m_childItems.append(item);
|
|
}
|
|
|
|
int TreeItem::findChild(TreeItem* child) {
|
|
for (int i = 0; i < m_childItems.size(); i++) {
|
|
if (m_childItems[i] == child) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
void TreeItem::removeChild(int index) {
|
|
// TODO: delete TreeItem
|
|
m_childItems.removeAt(index);
|
|
}
|
|
|
|
void TreeItem::insertChild(int index, TreeItem* child) {
|
|
child->m_parentItem = this;
|
|
m_childItems.insert(index, child);
|
|
}
|
|
|
|
TreeItem* TreeItem::child(int row) {
|
|
return m_childItems.value(row);
|
|
}
|
|
|
|
int TreeItem::childCount() const {
|
|
return m_childItems.count();
|
|
}
|
|
|
|
int TreeItem::columnCount() const {
|
|
return m_itemData.count();
|
|
}
|
|
|
|
QVariant TreeItem::data(int column) const {
|
|
return m_itemData.value(column);
|
|
}
|
|
|
|
bool TreeItem::setData(int column, const QVariant& value) {
|
|
m_itemData[column] = QVariant(value);
|
|
return true;
|
|
}
|
|
|
|
TreeItem* TreeItem::parentItem() {
|
|
return m_parentItem;
|
|
}
|
|
|
|
int TreeItem::row() const {
|
|
if (m_parentItem) {
|
|
return m_parentItem->m_childItems.indexOf(const_cast<TreeItem*>(this));
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
TreeItem* TreeItem::cloneNode() const {
|
|
return new TreeItem(m_itemData);
|
|
}
|
|
|
|
TreeItem* TreeItem::cloneNodeAndChildren() const {
|
|
TreeItem* newNode = new TreeItem(m_itemData);
|
|
for (int i = 0; i < m_childItems.size(); ++i) {
|
|
newNode->appendChild(m_childItems[i]->cloneNodeAndChildren());
|
|
}
|
|
return newNode;
|
|
}
|