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
|
/*
This file is part of Akregator.
Copyright (C) 2004 Sashmit Bhaduri <[email protected]>
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.
*/
#ifndef AKREGATOR_FETCHQUEUE_H
#define AKREGATOR_FETCHQUEUE_H
#include <tqobject.h>
namespace Akregator {
class Feed;
class TreeNode;
class FetchQueue : public TQObject
{
TQ_OBJECT
public:
FetchQueue(TQObject* parent=0, const char* name=0);
virtual ~FetchQueue();
/** returns true when no feeds are neither fetching nor queued */
bool isEmpty() const;
/** adds a feed to the queue */
void addFeed(Feed *f);
public slots:
/** aborts currently fetching feeds and empties the queue */
void slotAbort();
signals:
void signalStarted();
void signalStopped();
void fetched(Feed*);
void fetchError(Feed*);
protected:
/** fetches the next feed in the queue, unless the maximum of concurrent fetches is reached */
void fetchNextFeed();
void feedDone(Feed *f);
void connectToFeed(Feed* feed);
void disconnectFromFeed(Feed* feed);
protected slots:
void slotNodeDestroyed(TreeNode* node);
void slotFeedFetched(Feed *);
void slotFetchError(Feed *);
void slotFetchAborted(Feed *);
private:
class FetchQueuePrivate;
FetchQueuePrivate* d;
};
} // namespace Akregator
#endif
|
