aboutsummaryrefslogtreecommitdiff
path: root/libs/preview_bsa/src/simplefiletreeitem.cpp
blob: 23d124136d523e7d0296c7822b58f9588f8850e1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84


/*
    simplefiletreeitem.cpp

    A container for items of data supplied by the simple file tree model.
*/

#include "simplefiletreeitem.h"

SimpleFileTreeItem::SimpleFileTreeItem(const QVector<QVariant>& data,
                                       SimpleFileTreeItem* parent)
    : m_itemData(data), m_parentItem(parent)
{}

SimpleFileTreeItem::~SimpleFileTreeItem()
{
  qDeleteAll(m_childItems);
}

void SimpleFileTreeItem::appendChild(const QString& name, SimpleFileTreeItem* item)
{
  m_childItems.append(item);
  m_childItemsByName.insert(name, item);
}

SimpleFileTreeItem* SimpleFileTreeItem::child(int row)
{
  if (row < 0 || row >= m_childItems.size())
    return nullptr;
  return m_childItems.at(row);
}

SimpleFileTreeItem* SimpleFileTreeItem::childByName(const QString& name)
{
  return m_childItemsByName.value(name);
}

QVector<SimpleFileTreeItem*> SimpleFileTreeItem::children()
{
  return m_childItems;
}

int SimpleFileTreeItem::childCount() const
{
  return m_childItems.count();
}

int SimpleFileTreeItem::columnCount() const
{
  return m_itemData.count();
}

QVariant SimpleFileTreeItem::data(int column) const
{
  if (column < 0 || column >= m_itemData.size())
    return QVariant();
  return m_itemData.at(column);
}

SimpleFileTreeItem* SimpleFileTreeItem::parentItem()
{
  return m_parentItem;
}

int SimpleFileTreeItem::row() const
{
  if (m_parentItem)
    return m_parentItem->m_childItems.indexOf(const_cast<SimpleFileTreeItem*>(this));

  return 0;
}

QString SimpleFileTreeItem::fullPath(QChar separator) const
{
  // Walk up, collecting names. Skip the root sentinel (parent == nullptr).
  QStringList parts;
  const SimpleFileTreeItem* node = this;
  while (node && node->m_parentItem) {
    parts.prepend(node->m_itemData.value(0).toString());
    node = node->m_parentItem;
  }
  return parts.join(separator);
}