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
|
// -*- indent-tabs-mode:nil -*-
// vim: set ts=4 sts=4 sw=4 et:
/* This file is part of the KDE project
Copyright (C) 2000 David Faure <faure@kde.org>
Copyright (C) 2002-2003 Alexander Kellett <lypanov@kde.org>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License version 2 as published by the Free Software Foundation.
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; see the file COPYING. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "bookmarkiterator.h"
#include "toplevel.h"
#include "listview.h"
#include <kdebug.h>
#include <tqtimer.h>
BookmarkIterator::BookmarkIterator(TQValueList<KBookmark> bks) : m_btdelist(bks) {
connect(this, TQT_SIGNAL( deleteSelf(BookmarkIterator *) ),
TQT_SLOT( slotCancelTest(BookmarkIterator *) ));
delayedEmitNextOne();
}
BookmarkIterator::~BookmarkIterator() {
;
}
void BookmarkIterator::delayedEmitNextOne() {
TQTimer::singleShot(1, this, TQT_SLOT( nextOne() ));
}
void BookmarkIterator::slotCancelTest(BookmarkIterator *test) {
holder()->removeItr(test);
}
KEBListViewItem* BookmarkIterator::curItem() const {
if (!m_bk.hasParent())
return 0;
return ListView::self()->getItemAtAddress(m_bk.address());
}
const KBookmark BookmarkIterator::curBk() const {
assert(m_bk.hasParent());
return m_bk;
}
void BookmarkIterator::nextOne() {
// kdDebug() << "BookmarkIterator::nextOne" << endl;
if (m_btdelist.isEmpty()) {
emit deleteSelf(this);
return;
}
TQValueListIterator<KBookmark> head = m_btdelist.begin();
KBookmark bk = (*head);
bool viable = bk.hasParent() && isApplicable(bk);
if (viable) {
m_bk = bk;
doAction();
}
m_btdelist.remove(head);
if (!viable)
delayedEmitNextOne();
}
/* --------------------------- */
BookmarkIteratorHolder::BookmarkIteratorHolder() {
m_itrs.setAutoDelete(true);
}
void BookmarkIteratorHolder::insertItr(BookmarkIterator *itr) {
m_itrs.insert(0, itr);
doItrListChanged();
}
void BookmarkIteratorHolder::removeItr(BookmarkIterator *itr) {
m_itrs.remove(itr);
doItrListChanged();
}
void BookmarkIteratorHolder::cancelAllItrs() {
m_itrs.clear();
doItrListChanged();
}
#include "bookmarkiterator.moc"
|
