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
|
/*
Scan Tailor - Interactive post-processing tool for scanned pages.
Copyright (C) Joseph Artsimovich <joseph.artsimovich@gmail.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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "PageSequence.h"
#include <boost/foreach.hpp>
void
PageSequence::append(PageInfo const& page_info)
{
m_pages.push_back(page_info);
}
PageInfo const&
PageSequence::pageAt(size_t const idx) const
{
return m_pages.at(idx); // may throw
}
std::set<PageId>
PageSequence::selectAll() const
{
std::set<PageId> selection;
BOOST_FOREACH(PageInfo const& page_info, m_pages) {
selection.insert(page_info.id());
}
return selection;
}
std::set<PageId>
PageSequence::selectPagePlusFollowers(PageId const& page) const
{
std::set<PageId> selection;
std::vector<PageInfo>::const_iterator it(m_pages.begin());
std::vector<PageInfo>::const_iterator const end(m_pages.end());
for (; it != end && it->id() != page; ++it) {
// Continue until we have a match.
}
for (; it != end; ++it) {
selection.insert(it->id());
}
return selection;
}
std::set<PageId>
PageSequence::selectEveryOther(PageId const& base) const
{
std::set<PageId> selection;
std::vector<PageInfo>::const_iterator it(m_pages.begin());
std::vector<PageInfo>::const_iterator const end(m_pages.end());
for (; it != end && it->id() != base; ++it) {
// Continue until we have a match.
}
if (it == end) {
return selection;
}
int const base_idx = it - m_pages.begin();
int idx = 0;
BOOST_FOREACH(PageInfo const& page_info, m_pages) {
if (((idx - base_idx) & 1) == 0) {
selection.insert(page_info.id());
}
++idx;
}
return selection;
}
|
