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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* kcmtreeitem.h
*
* Copyright (C) 2010 David Hubner <hubnerd@ntlworld.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
//Local
#include "kcmtreeitem.h"
//KDE
#include <KDebug>
KcmTreeItem::KcmTreeItem(const KService::Ptr module, KcmTreeItem *parent) : m_parent(parent), m_module(module),
m_moduleInfo(new KCModuleInfo(m_module))
{
}
KcmTreeItem::KcmTreeItem() : m_parent(NULL), m_moduleInfo(new KCModuleInfo())
{
}
KcmTreeItem::~KcmTreeItem()
{
qDeleteAll(m_children);
delete m_moduleInfo;
}
void KcmTreeItem::addChild(KcmTreeItem *child)
{
m_children.append(child);
}
KcmTreeItem *KcmTreeItem::child(const int row)
{
if(childCount() > row) return m_children.value(row);
return NULL;
}
int KcmTreeItem::childCount()
{
return m_children.count();
}
int KcmTreeItem::columnCount()
{
// Hard coded, menu should never have more than one column
return 1;
}
KcmTreeItem *KcmTreeItem::parent()
{
return m_parent;
}
int KcmTreeItem::row()
{
if (m_parent)
{
return indexOf(const_cast<KcmTreeItem*>(this));
}
return 0;
}
int KcmTreeItem::indexOf(KcmTreeItem *item)
{
if (m_parent)
{
return m_parent->m_children.indexOf(item);
}
return 0;
}
QString KcmTreeItem::data() const
{
return m_moduleInfo->moduleName();
}
QString KcmTreeItem::category() const
{
return m_module->property("X-KDE-KInfoCenter-Category").toString().trimmed();
}
KcmTreeItem::itemType KcmTreeItem::type() const
{
return KCM;
}
KcmTreeItem *KcmTreeItem::containsCategory(const QString& category)
{
foreach(KcmTreeItem *item, m_children)
{
if(item->type() == CATEGORY)
{
if(item->category().contains(category))
{
return item;
}
else
{
if(item->containsCategory(category))
{
return item;
}
}
}
}
return NULL;
}
KCModuleInfo KcmTreeItem::kcm() const
{
return *m_moduleInfo;
}
int KcmTreeItem::weight()
{
return m_moduleInfo->weight();
}
KIcon KcmTreeItem::icon() const
{
return KIcon(m_moduleInfo->icon());
}
QString KcmTreeItem::whatsThis() const
{
return m_moduleInfo->comment();
}
bool KcmTreeItem::childrenRegExp(const QRegExp& pattern)
{
foreach(KcmTreeItem *item, m_children)
{
if((item->keywords().filter(pattern).count() > 0) == true)
{
return true;
}
}
return false;
}
QStringList KcmTreeItem::keywords() const
{
if(m_moduleInfo->keywords().isEmpty()) return QStringList(data());
return m_moduleInfo->keywords();
}
|
