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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
/*
This file is part of Akregator.
Copyright (C) 2005 Frank Osterfeld <frank.osterfeld at kdemail.net>
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.
As a special exception, permission is given to link this program
with any edition of TQt, and distribute the resulting executable,
without including the source code for TQt in the source distribution.
*/
#include "folder.h"
#include "nodelist.h"
#include "treenode.h"
#include "treenodevisitor.h"
#include <kapplication.h>
#include <tqmap.h>
#include <tqstring.h>
#include <tqvaluelist.h>
namespace Akregator {
class NodeList::NodeListPrivate
{
public:
TQValueList<TreeNode*> flatList;
Folder* rootNode;
TQString title;
TQMap<int, TreeNode*> idMap;
AddNodeVisitor* addNodeVisitor;
RemoveNodeVisitor* removeNodeVisitor;
};
class NodeList::AddNodeVisitor : public TreeNodeVisitor
{
public:
AddNodeVisitor(NodeList* list) : m_list(list) {}
virtual bool visitTreeNode(TreeNode* node)
{
if (!m_preserveID)
node->setId(m_list->generateID());
m_list->d->idMap[node->id()] = node;
m_list->d->flatList.append(node);
connect(node, TQT_SIGNAL(signalDestroyed(TreeNode*)), m_list, TQT_SLOT(slotNodeDestroyed(TreeNode*) ));
m_list->signalNodeAdded(node); // emit
return true;
}
virtual bool visitFolder(Folder* node)
{
connect(node, TQT_SIGNAL(signalChildAdded(TreeNode*)), m_list, TQT_SLOT(slotNodeAdded(TreeNode*) ));
connect(node, TQT_SIGNAL(signalChildRemoved(Folder*, TreeNode*)), m_list, TQT_SLOT(slotNodeRemoved(Folder*, TreeNode*) ));
visitTreeNode(node);
for (TreeNode* i = node->firstChild(); i && i != node; i = i->next() )
m_list->slotNodeAdded(i);
return true;
}
virtual void visit(TreeNode* node, bool preserveID)
{
m_preserveID = preserveID;
TreeNodeVisitor::visit(node);
}
private:
NodeList* m_list;
bool m_preserveID;
};
class NodeList::RemoveNodeVisitor : public TreeNodeVisitor
{
public:
RemoveNodeVisitor(NodeList* list) : m_list(list) {}
virtual bool visitTreeNode(TreeNode* node)
{
m_list->d->idMap.remove(node->id());
m_list->d->flatList.remove(node);
disconnect(node, TQT_SIGNAL(signalDestroyed(TreeNode*)), m_list, TQT_SLOT(slotNodeDestroyed(TreeNode*) ));
m_list->signalNodeRemoved(node); // emit signal
return true;
}
virtual bool visitFolder(Folder* node)
{
disconnect(node, TQT_SIGNAL(signalChildAdded(TreeNode*)), m_list, TQT_SLOT(slotNodeAdded(TreeNode*) ));
disconnect(node, TQT_SIGNAL(signalChildRemoved(Folder*, TreeNode*)), m_list, TQT_SLOT(slotNodeRemoved(Folder*, TreeNode*) ));
visitTreeNode(node);
return true;
}
private:
NodeList* m_list;
};
NodeList::NodeList(TQObject *tqparent, const char *name) : d(new NodeListPrivate)
{
d->rootNode = 0;
d->addNodeVisitor = new AddNodeVisitor(this);
d->removeNodeVisitor = new RemoveNodeVisitor(this);
}
const TQString& NodeList::title() const
{
return d->title;
}
TreeNode* NodeList::findByID(int id) const
{
return d->idMap[id];
}
void NodeList::setTitle(const TQString& title)
{
d->title = title;
}
Folder* NodeList::rootNode() const
{
return d->rootNode;
}
const TQValueList<TreeNode*>& NodeList::asFlatList() const
{
return d->flatList;
}
bool NodeList::isEmpty() const
{
return d->rootNode->firstChild() == 0;
}
TQValueList<TreeNode*>* NodeList::flatList() const
{
return &(d->flatList);
}
void NodeList::clear()
{
Q_ASSERT(rootNode());
TQValueList<TreeNode*> tqchildren = rootNode()->tqchildren();
for (TQValueList<TreeNode*>::ConstIterator it = tqchildren.begin(); it != tqchildren.end(); ++it)
delete *it; // emits signal "emitSignalDestroyed"
}
TQMap<int, TreeNode*>* NodeList::idMap() const
{
return &(d->idMap);
}
void NodeList::setRootNode(Folder* folder)
{
delete d->rootNode;
d->rootNode = folder;
if (d->rootNode)
{
d->rootNode->setOpen(true);
connect(d->rootNode, TQT_SIGNAL(signalChildAdded(TreeNode*)), this, TQT_SLOT(slotNodeAdded(TreeNode*)));
connect(d->rootNode, TQT_SIGNAL(signalChildRemoved(Folder*, TreeNode*)), this, TQT_SLOT(slotNodeRemoved(Folder*, TreeNode*)));
}
}
void NodeList::addNode(TreeNode* node, bool preserveID)
{
d->addNodeVisitor->visit(node, preserveID);
}
void NodeList::removeNode(TreeNode* node)
{
d->removeNodeVisitor->visit(node);
}
NodeList::~NodeList()
{
emit signalDestroyed(this);
delete d->addNodeVisitor;
delete d->removeNodeVisitor;
delete d;
d = 0;
}
int NodeList::generateID()
{
return KApplication::random();
}
void NodeList::slotNodeAdded(TreeNode* node)
{
Folder* tqparent = node->tqparent();
if ( !node || !d->flatList.contains(tqparent) || d->flatList.contains(node) )
return;
addNode(node, false);
}
void NodeList::slotNodeDestroyed(TreeNode* node)
{
if ( !node || !d->flatList.contains(node) )
return;
removeNode(node);
}
void NodeList::slotNodeRemoved(Folder* /*tqparent*/, TreeNode* node)
{
if ( !node || !d->flatList.contains(node) )
return;
removeNode(node);
}
}
#include "nodelist.moc"
|
