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
|
/*
Copyright (c) 2009 Tobias Koenig <tokoe@kde.org>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at your
option) any later version.
This library 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 Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "recursiveitemfetchjob.h"
#include <akonadi/collectionfetchjob.h>
#include <akonadi/collectionfetchscope.h>
#include <akonadi/itemfetchjob.h>
#include <akonadi/itemfetchscope.h>
#include <QtCore/QStringList>
#include <QtCore/QVariant>
using namespace Akonadi;
class RecursiveItemFetchJob::Private
{
public:
Private( const Collection &collection, const QStringList &mimeTypes, RecursiveItemFetchJob *parent )
: mParent( parent ), mCollection( collection ), mMimeTypes( mimeTypes ), mFetchCount( 0 )
{
}
void collectionFetchResult( KJob *job )
{
if ( job->error() ) {
mParent->emitResult();
return;
}
const CollectionFetchJob *fetchJob = qobject_cast<CollectionFetchJob*>( job );
Collection::List collections = fetchJob->collections();
collections.prepend( mCollection );
foreach ( const Collection &collection, collections ) {
ItemFetchJob *itemFetchJob = new ItemFetchJob( collection, mParent );
itemFetchJob->setFetchScope( mFetchScope );
mParent->connect( itemFetchJob, SIGNAL(result(KJob*)),
mParent, SLOT(itemFetchResult(KJob*)) );
mFetchCount++;
}
}
void itemFetchResult( KJob *job )
{
if ( !job->error() ) {
const ItemFetchJob *fetchJob = qobject_cast<ItemFetchJob*>( job );
if ( !mMimeTypes.isEmpty() ) {
foreach ( const Item &item, fetchJob->items() ) {
if ( mMimeTypes.contains( item.mimeType() ) )
mItems << item;
}
} else {
mItems << fetchJob->items();
}
}
mFetchCount--;
if ( mFetchCount == 0 )
mParent->emitResult();
}
RecursiveItemFetchJob *mParent;
Collection mCollection;
Item::List mItems;
ItemFetchScope mFetchScope;
QStringList mMimeTypes;
int mFetchCount;
};
RecursiveItemFetchJob::RecursiveItemFetchJob( const Collection &collection,
const QStringList &mimeTypes,
QObject * parent )
: KJob( parent ), d( new Private( collection, mimeTypes, this ) )
{
}
RecursiveItemFetchJob::~RecursiveItemFetchJob()
{
delete d;
}
void RecursiveItemFetchJob::setFetchScope( const ItemFetchScope &fetchScope )
{
d->mFetchScope = fetchScope;
}
ItemFetchScope &RecursiveItemFetchJob::fetchScope()
{
return d->mFetchScope;
}
void RecursiveItemFetchJob::start()
{
CollectionFetchJob *job = new CollectionFetchJob( d->mCollection, CollectionFetchJob::Recursive, this );
if ( !d->mMimeTypes.isEmpty() )
job->fetchScope().setContentMimeTypes( d->mMimeTypes );
connect( job, SIGNAL(result(KJob*)), this, SLOT(collectionFetchResult(KJob*)) );
}
Akonadi::Item::List RecursiveItemFetchJob::items() const
{
return d->mItems;
}
#include "recursiveitemfetchjob.moc"
|