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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
|
/* ============================================================
*
* This file is a part of the rekonq project
*
* Copyright (C) 2009 by Nils Weigel <nehlsen at gmail dot com>
* Copyright (C) 2010-2011 by Andrea Diamantini <adjam7 at gmail dot 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) version 3 or any later version
* accepted by the membership of KDE e.V. (or its successor approved
* by the membership of KDE e.V.), which shall act as a proxy
* defined in Section 14 of version 3 of the license.
*
* 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, see <http://www.gnu.org/licenses/>.
*
* ============================================================ */
// Self Includes
#include "bookmarkstreemodel.h"
#include "bookmarkstreemodel.moc"
// Local Includes
#include "application.h"
#include "bookmarkprovider.h"
#include "iconmanager.h"
// KDE Includes
#include <KBookmarkManager>
#include <KLocalizedString>
#include <KIcon>
// Qt Includes
#include <QtCore/QMimeData>
BtmItem::BtmItem(const KBookmark &bm)
: m_parent(0)
, m_kbm(bm)
{
}
BtmItem::~BtmItem()
{
qDeleteAll(m_children);
}
QVariant BtmItem::data(int role) const
{
if (m_kbm.isNull())
return QVariant(); // should only happen for root item
if (role == Qt::DisplayRole)
return m_kbm.text();
if (role == Qt::DecorationRole)
{
// NOTE
// this should be:
// return KIcon(m_kbm.icon());
// but I cannot let it work :(
// I really cannot understand how let this work properly...
if (m_kbm.isGroup() || m_kbm.isSeparator())
return KIcon(m_kbm.icon());
else
return rApp->iconManager()->iconForUrl(KUrl(m_kbm.url()));
}
if (role == Qt::UserRole)
return m_kbm.url();
if (role == Qt::ToolTipRole)
{
QString tooltip = m_kbm.fullText();
if (m_kbm.isGroup())
tooltip += i18ncp("%1=Number of items in bookmark folder", " (1 item)", " (%1 items)", childCount());
QString url = m_kbm.url().url();
if (!url.isEmpty())
{
if (!tooltip.isEmpty())
tooltip += '\n';
tooltip += url;
}
return tooltip;
}
return QVariant();
}
int BtmItem::row() const
{
if (m_parent)
return m_parent->m_children.indexOf(const_cast< BtmItem* >(this));
return 0;
}
int BtmItem::childCount() const
{
return m_children.count();
}
BtmItem* BtmItem::child(int n)
{
Q_ASSERT(n >= 0);
Q_ASSERT(n < childCount());
return m_children.at(n);
}
BtmItem* BtmItem::parent() const
{
return m_parent;
}
void BtmItem::appendChild(BtmItem *child)
{
if (!child)
return;
child->m_parent = this;
m_children << child;
}
void BtmItem::clear()
{
qDeleteAll(m_children);
m_children.clear();
}
KBookmark BtmItem::getBkm() const
{
return m_kbm;
}
// -------------------------------------------------------------------------------------
BookmarksTreeModel::BookmarksTreeModel(QObject *parent)
: QAbstractItemModel(parent)
, m_root(0)
{
resetModel();
connect(rApp->bookmarkProvider()->bookmarkManager(), SIGNAL(changed(const QString &, const QString &)), this, SLOT(bookmarksChanged(const QString &)));
}
BookmarksTreeModel::~BookmarksTreeModel()
{
delete m_root;
}
int BookmarksTreeModel::rowCount(const QModelIndex &parent) const
{
BtmItem *parentItem = 0;
if (!parent.isValid())
{
parentItem = m_root;
}
else
{
parentItem = static_cast<BtmItem*>(parent.internalPointer());
}
return parentItem->childCount();
}
int BookmarksTreeModel::columnCount(const QModelIndex& /*parent*/) const
{
return 1;
}
Qt::ItemFlags BookmarksTreeModel::flags(const QModelIndex &index) const
{
Qt::ItemFlags flags = QAbstractItemModel::flags(index);
if (!index.isValid())
return flags | Qt::ItemIsDropEnabled;
flags = Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsDragEnabled;
if (bookmarkForIndex(index).isGroup())
flags |= Qt::ItemIsDropEnabled;
return flags;
}
QModelIndex BookmarksTreeModel::index(int row, int column, const QModelIndex &parent) const
{
if (!hasIndex(row, column, parent))
return QModelIndex();
BtmItem *parentItem;
if (!parent.isValid())
parentItem = m_root;
else
parentItem = static_cast<BtmItem*>(parent.internalPointer());
BtmItem *childItem = parentItem->child(row);
if (childItem)
return createIndex(row, column, childItem);
return QModelIndex();
}
QModelIndex BookmarksTreeModel::parent(const QModelIndex &index) const
{
if (!index.isValid())
return QModelIndex();
BtmItem *childItem = static_cast<BtmItem*>(index.internalPointer());
BtmItem *parentItem = childItem->parent();
if (parentItem == m_root)
return QModelIndex();
return createIndex(parentItem->row(), 0, parentItem);
}
QVariant BookmarksTreeModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid())
return QVariant();
BtmItem *node = static_cast<BtmItem*>(index.internalPointer());
if (node && node == m_root)
{
if (role == Qt::DisplayRole)
return i18n("Bookmarks");
if (role == Qt::DecorationRole)
return KIcon("bookmarks");
}
else
{
if (node)
return node->data(role);
}
return QVariant();
}
QStringList BookmarksTreeModel::mimeTypes() const
{
return QStringList("application/rekonq-bookmark");
}
bool BookmarksTreeModel::dropMimeData(const QMimeData *data, Qt::DropAction action, int row, int column, const QModelIndex &parent)
{
if (action != Qt::MoveAction || !data->hasFormat("application/rekonq-bookmark"))
return false;
QByteArray addresses = data->data("application/rekonq-bookmark");
KBookmark bookmark = rApp->bookmarkProvider()->bookmarkManager()->findByAddress(QString::fromLatin1(addresses.data()));
KBookmarkGroup root;
if (parent.isValid())
root = bookmarkForIndex(parent).toGroup();
else
root = rApp->bookmarkProvider()->rootGroup();
QModelIndex destIndex = index(row, column, parent);
if (destIndex.isValid() && row != -1)
{
root.moveBookmark(bookmark, root.previous(bookmarkForIndex(destIndex)));
}
else
{
root.deleteBookmark(bookmark);
root.addBookmark(bookmark);
}
rApp->bookmarkProvider()->bookmarkManager()->emitChanged();
return true;
}
Qt::DropActions BookmarksTreeModel::supportedDropActions() const
{
return Qt::MoveAction;
}
QMimeData* BookmarksTreeModel::mimeData(const QModelIndexList &indexes) const
{
QMimeData *mimeData = new QMimeData;
QByteArray address = bookmarkForIndex(indexes.first()).address().toLatin1();
mimeData->setData("application/rekonq-bookmark", address);
bookmarkForIndex(indexes.first()).populateMimeData(mimeData);
return mimeData;
}
void BookmarksTreeModel::bookmarksChanged(const QString &groupAddress)
{
if (groupAddress.isEmpty())
{
resetModel();
}
else
{
beginResetModel();
BtmItem *node = m_root;
QModelIndex nodeIndex;
QStringList indexChain( groupAddress.split('/', QString::SkipEmptyParts) );
bool ok;
int i;
foreach (const QString &sIndex, indexChain)
{
i = sIndex.toInt( &ok );
if( !ok )
break;
if( i < 0 || i >= node->childCount() )
break;
node = node->child( i );
nodeIndex = index( i, 0, nodeIndex );
}
populate(node, rApp->bookmarkProvider()->bookmarkManager()->findByAddress(groupAddress).toGroup());
endResetModel();
}
emit bookmarksUpdated();
}
void BookmarksTreeModel::resetModel()
{
setRoot(rApp->bookmarkProvider()->rootGroup());
}
void BookmarksTreeModel::setRoot(KBookmarkGroup bmg)
{
beginResetModel();
delete m_root;
m_root = new BtmItem(KBookmark());
populate(m_root, bmg);
endResetModel();
}
void BookmarksTreeModel::populate(BtmItem *node, KBookmarkGroup bmg)
{
node->clear();
if (bmg.isNull())
return;
KBookmark bm = bmg.first();
while (!bm.isNull())
{
BtmItem *newChild = new BtmItem(bm);
if (bm.isGroup())
populate(newChild, bm.toGroup());
node->appendChild(newChild);
bm = bmg.next(bm);
}
}
KBookmark BookmarksTreeModel::bookmarkForIndex(const QModelIndex &index) const
{
return static_cast<BtmItem*>(index.internalPointer())->getBkm();
}
|