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
|
/*
Copyright 2012-2015 Adam Reichold
This file is part of qpdfview.
qpdfview 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.
qpdfview 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 qpdfview. If not, see <http://www.gnu.org/licenses/>.
*/
#include "searchtask.h"
#include <QtConcurrentMap>
namespace qpdfview
{
namespace
{
struct Search
{
Search(const QString& text, const bool matchCase, const bool wholeWords) :
text(text),
matchCase(matchCase),
wholeWords(wholeWords)
{
}
const QString& text;
const bool matchCase;
const bool wholeWords;
typedef QList< QRectF > result_type;
result_type operator()(const Model::Page* const page) const
{
return page->search(text, matchCase, wholeWords);
}
};
struct FutureWrapper
{
FutureWrapper(const QVector< const Model::Page* >& pages, const Search& search) :
pages(pages),
search(search)
{
}
const QVector< const Model::Page* >& pages;
const Search& search;
void cancel()
{
}
Search::result_type resultAt(int index)
{
return search(pages.at(index));
}
};
}
SearchTask::SearchTask(QObject* parent) : QThread(parent),
m_wasCanceled(NotCanceled),
m_progress(0),
m_pages(),
m_text(),
m_matchCase(false),
m_wholeWords(false),
m_beginAtPage(1),
m_parallelExecution(false)
{
}
void SearchTask::run()
{
QVector< const Model::Page* > pages;
pages.reserve(m_pages.count());
for(int index = 0, count = m_pages.count(); index < count; ++index)
{
const int shiftedIndex = (index + m_beginAtPage - 1) % count;
pages.append(m_pages.at(shiftedIndex));
}
const Search search(m_text, m_matchCase, m_wholeWords);
if(m_parallelExecution)
{
processResults(QtConcurrent::mapped(pages, search));
}
else
{
processResults(FutureWrapper(pages, search));
}
}
void SearchTask::start(const QVector< Model::Page* >& pages,
const QString& text, bool matchCase, bool wholeWords,
int beginAtPage, bool parallelExecution)
{
m_pages = pages;
m_text = text;
m_matchCase = matchCase;
m_wholeWords = wholeWords;
m_beginAtPage = beginAtPage;
m_parallelExecution = parallelExecution;
resetCancellation();
releaseProgress(0);
QThread::start();
}
template< typename Future >
void SearchTask::processResults(Future future)
{
for(int index = 0, count = m_pages.count(); index < count; ++index)
{
if(testCancellation())
{
future.cancel();
break;
}
const int shiftedIndex = (index + m_beginAtPage - 1) % count;
const QList< QRectF > results = future.resultAt(index);
emit resultsReady(shiftedIndex, results);
const int progress = 100 * (index + 1) / m_pages.count();
releaseProgress(progress);
emit progressChanged(progress);
}
releaseProgress(0);
}
} // qpdfview
|