Menu

[efa3d9]: / src / findresultitem.cpp  Maximize  Restore  History

Download this file

121 lines (89 with data), 2.9 kB

  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
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <QStringList>
#include "findresultitem.h"
#include "treeitem.h"
#include "vymmodel.h"
FindResultItem::FindResultItem(const QVector<QVariant> &data,
FindResultItem *parent)
{
parentItem = parent;
itemData = data;
orgID = -1;
orgIndex = -1;
orgModel = nullptr;
if (data.isEmpty())
itemData.append(QVariant("empty"));
}
FindResultItem::~FindResultItem() { qDeleteAll(childItems); }
FindResultItem *FindResultItem::child(int number)
{
return childItems.value(number);
}
int FindResultItem::childCount() const { return childItems.count(); }
int FindResultItem::columnCount() const { return itemData.count(); }
QVariant FindResultItem::data(int column) const
{
return itemData.value(column);
}
int FindResultItem::row() const
{
if (parentItem)
return parentItem->childItems.indexOf(
const_cast<FindResultItem *>(this));
return -1;
}
bool FindResultItem::insertChildren(int position, int count, int columns)
{
if (position < 0 || position > childItems.size())
return false;
for (int row = 0; row < count; ++row) {
QVector<QVariant> data(columns);
FindResultItem *item = new FindResultItem(data, this);
childItems.insert(position, item);
}
return true;
}
bool FindResultItem::insertColumns(int position, int columns)
{
if (position < 0 || position > itemData.size())
return false;
for (int column = 0; column < columns; ++column)
itemData.insert(position, QVariant());
foreach (FindResultItem *child, childItems)
child->insertColumns(position, columns);
return true;
}
FindResultItem *FindResultItem::parent() { return parentItem; }
bool FindResultItem::removeChildren(int position, int count)
{
if (position < 0 || position + count > childItems.size())
return false;
for (int row = 0; row < count; ++row)
delete childItems.takeAt(position);
return true;
}
bool FindResultItem::removeColumns(int position, int columns)
{
if (position < 0 || position + columns > itemData.size())
return false;
for (int column = 0; column < columns; ++column)
itemData.remove(position);
foreach (FindResultItem *child, childItems)
child->removeColumns(position, columns);
return true;
}
bool FindResultItem::setData(int column, const QVariant &value)
{
if (column < 0 || column >= itemData.size())
return false;
itemData[column] = value;
return true;
}
void FindResultItem::setOriginal(TreeItem *ti)
{
orgModel = ti->getModel();
orgID = ti->getID();
}
int FindResultItem::getOriginalID() { return orgID; }
void FindResultItem::setOriginalIndex(int i) { orgIndex = i; }
int FindResultItem::getOriginalIndex() { return orgIndex; }
VymModel *FindResultItem::getOrgModel() { return orgModel; }
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.