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
|
/*
* HDRMerge - HDR exposure merging software.
* Copyright 2012 Javier Celaya
* jcelaya@gmail.com
*
* This file is part of HDRMerge.
*
* HDRMerge 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.
*
* HDRMerge 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 HDRMerge. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "../src/Bitmap.hpp"
#include <boost/test/unit_test.hpp>
using namespace hdrmerge;
using namespace std;
BOOST_AUTO_TEST_CASE(bitmap_create) {
Bitmap b(100, 200);
b.reset();
b.position(20, 30).set();
b.position(45, 81).set();
b.position(99, 199).set();
BOOST_CHECK(b.position(45, 81).get());
BOOST_CHECK_EQUAL(b.count(), 3);
b.position(20, 30).reset();
BOOST_CHECK_EQUAL(b.count(), 2);
}
static bool checkZeroArea(const Bitmap & b, int i0, int i1, int j0, int j1) {
for (int i = i0; i < i1; ++i) {
for (int j = j0; j < j1; ++j) {
if (b.position(i, j).get()) return false;
}
}
return true;
}
BOOST_AUTO_TEST_CASE(bitmap_shift) {
Bitmap b(100, 100);
for (Bitmap::iterator p = b.position(0, 0); p != b.end(); ++p) {
p.set();
}
b.position(49, 49).reset(); b.position(49, 50).reset(); b.position(50, 49).reset(); b.position(50, 50).reset();
Bitmap s(100, 100);
s.shift(b, 35, 35);
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 35, 0, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 100, 0, 35), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 84, 86, 84, 86), s.dumpInfo());
BOOST_CHECK_MESSAGE(s.count() == 4221, s.dumpInfo());
s.shift(b, -35, 35);
BOOST_CHECK_MESSAGE(checkZeroArea(s, 65, 100, 0, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 100, 0, 35), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 14, 16, 84, 86), s.dumpInfo());
BOOST_CHECK_MESSAGE(s.count() == 4221, s.dumpInfo());
s.shift(b, 35, -35);
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 35, 0, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 100, 65, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 84, 86, 14, 16), s.dumpInfo());
BOOST_CHECK_MESSAGE(s.count() == 4221, s.dumpInfo());
s.shift(b, -35, -35);
BOOST_CHECK_MESSAGE(checkZeroArea(s, 65, 100, 0, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 0, 100, 65, 100), s.dumpInfo());
BOOST_CHECK_MESSAGE(checkZeroArea(s, 14, 16, 14, 16), s.dumpInfo());
BOOST_CHECK_MESSAGE(s.count() == 4221, s.dumpInfo());
}
BOOST_AUTO_TEST_CASE(bitmap_xor) {
Bitmap b1(10, 10), b2(10, 10);
b1.reset();
b2.reset();
for (int i : { 1, 3, 4, 7, 8 }) {
b1.position(i, 3).set();
b2.position(i, 3).set();
}
b1.position(1, 5).set();
b1.position(3, 7).set();
b2.position(6, 6).set();
b2.bitwiseXor(b1);
BOOST_CHECK_EQUAL(b2.count(), 3);
BOOST_CHECK(b2.position(1, 5).get());
BOOST_CHECK(b2.position(3, 7).get());
BOOST_CHECK(b2.position(6, 6).get());
}
BOOST_AUTO_TEST_CASE(bitmap_and) {
Bitmap b1(10, 10), b2(10, 10);
b1.reset();
b2.reset();
for (int i : { 1, 3, 4, 7, 8 }) {
b1.position(i, 3).set();
b2.position(i, 3).set();
}
b1.position(1, 5).set();
b1.position(3, 7).set();
b2.position(6, 6).set();
b2.bitwiseAnd(b1);
BOOST_CHECK_EQUAL(b2.count(), 5);
for (int i : { 1, 3, 4, 7, 8 }) {
BOOST_CHECK(b2.position(i, 3).get());
}
}
BOOST_AUTO_TEST_CASE(bitmap_mtb) {
uint16_t data[] = { 1, 2, 3, 4, 3, 4, 5, 2, 3, 1, 4, 2, 5, 2, 3, 1, 2, 2, 2, 4, 5 };
Bitmap b(3, 7);
b.mtb(data, 3);
BOOST_CHECK_EQUAL(b.count(), 7);
BOOST_CHECK(b.position(0, 1).get());
BOOST_CHECK(b.position(2, 1).get());
BOOST_CHECK(b.position(0, 2).get());
BOOST_CHECK(b.position(1, 3).get());
BOOST_CHECK(b.position(0, 4).get());
BOOST_CHECK(b.position(1, 6).get());
BOOST_CHECK(b.position(2, 6).get());
}
BOOST_AUTO_TEST_CASE(bitmap_exclusion) {
uint16_t data[] = { 1, 2, 3, 4, 3, 4, 5, 2, 3, 1, 4, 3, 5, 2, 3, 1, 3, 4, 2, 4, 5 };
Bitmap b(3, 7);
b.exclusion(data, 3, 1);
BOOST_CHECK_EQUAL(b.count(), 10);
BOOST_CHECK(b.position(0, 0).get());
BOOST_CHECK(b.position(1, 0).get());
BOOST_CHECK(b.position(0, 2).get());
BOOST_CHECK(b.position(1, 2).get());
BOOST_CHECK(b.position(0, 3).get());
BOOST_CHECK(b.position(0, 4).get());
BOOST_CHECK(b.position(1, 4).get());
BOOST_CHECK(b.position(0, 5).get());
BOOST_CHECK(b.position(0, 6).get());
BOOST_CHECK(b.position(2, 6).get());
}
|
