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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
|
/*
* Copyright 2017 Huy Cuong Nguyen
* Copyright 2014 ZXing authors
*/
// SPDX-License-Identifier: Apache-2.0
#include "aztec/AZDecoder.h"
#include "BitArray.h"
#include "BitMatrixIO.h"
#include "DecoderResult.h"
#include "aztec/AZDetectorResult.h"
#include "gtest/gtest.h"
#include <string_view>
#include <utility>
namespace ZXing::Aztec {
DecoderResult Decode(const BitArray& bits);
}
using namespace ZXing;
// Shorthand to call Decode()
static DecoderResult parse(BitMatrix&& bits, bool compact, int nbDatablocks, int nbLayers)
{
return Aztec::Decode({{std::move(bits), {}}, compact, nbDatablocks, nbLayers, false /*readerInit*/, false /*isMirrored*/, 0 /*runeValue*/});
}
TEST(AZDecoderTest, AztecResult)
{
auto bits = ParseBitMatrix(
"X X X X X X X X X X X X X X \n"
"X X X X X X X X X X X X X X X \n"
" X X X X X X X X X X X X \n"
" X X X X X X X X X X \n"
" X X X X X X X X \n"
" X X X X X X X X X X X X X X X X X X \n"
" X X X X X X X X X \n"
" X X X X X X X X X X X X X X X X X \n"
" X X X X X X X X X \n"
" X X X X X X X X X X X X X X X X \n"
" X X X X X X X X X X X X \n"
" X X X X X X X X X X X \n"
" X X X X X X X X X X X X \n"
" X X X X X X X X X X X X X X X X X \n"
"X X X X X X X X X X X \n"
" X X X X X X X X X X X X X X \n"
" X X X X X X X X \n"
" X X X X X X X X X X X X X X X X X X X \n"
"X X X X X X X X X \n"
"X X X X X X X X X X X X X X X \n"
"X X X X X X X X X X X X \n"
"X X X X X X X X X X X X X X \n"
" X X X X X X X X X X X X X \n"
, 'X', true);
DecoderResult result = parse(std::move(bits), false, 30, 2);
EXPECT_EQ(result.isValid(), true);
EXPECT_EQ(result.text(), L"88888TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT");
EXPECT_EQ(result.symbologyIdentifier(), "]z0");
}
TEST(AZDecoderTest, DecodeTooManyErrors)
{
auto bits = ParseBitMatrix(
"X X . X . . . X X . . . X . . X X X . X . X X X X X . \n"
"X X . . X X . . . . . X X . . . X X . . . X . X . . X \n"
"X . . . X X . . X X X . X X . X X X X . X X . . X . . \n"
". . . . X . X X . . X X . X X . X . X X X X . X . . X \n"
"X X X . . X X X X X . . . . . X X . . . X . X . X . X \n"
"X X . . . . . . . . X . . . X . X X X . X . . X . . . \n"
"X X . . X . . . . . X X . . . . . X . . . . X . . X X \n"
". . . X . X . X . . . . . X X X X X X . . . . . . X X \n"
"X . . . X . X X X X X X . . X X X . X . X X X X X X . \n"
"X . . X X X . X X X X X X X X X X X X X . . . X . X X \n"
". . . . X X . . . X . . . . . . . X X . . . X X . X . \n"
". . . X X X . . X X . X X X X X . X . . X . . . . . . \n"
"X . . . . X . X . X . X . . . X . X . X X . X X . X X \n"
"X . X . . X . X . X . X . X . X . X . . . . . X . X X \n"
"X . X X X . . X . X . X . . . X . X . X X X . . . X X \n"
"X X X X X X X X . X . X X X X X . X . X . X . X X X . \n"
". . . . . . . X . X . . . . . . . X X X X . . . X X X \n"
"X X . . X . . X . X X X X X X X X X X X X X . . X . X \n"
"X X X . X X X X . . X X X X . . X . . . . X . . X X X \n"
". . . . X . X X X . . . . X X X X . . X X X X . . . . \n"
". . X . . X . X . . . X . X X . X X . X . . . X . X . \n"
"X X . . X . . X X X X X X X . . X . X X X X X X X . . \n"
"X . X X . . X X . . . . . X . . . . . . X X . X X X . \n"
"X . . X X . . X X . X . X . . . . X . X . . X . . X . \n"
"X . X . X . . X . X X X X X X X X . X X X X . . X X . \n"
"X X X X . . . X . . X X X . X X . . X . . . . X X X . \n"
"X X . X . X . . . X . X . . . . X X . X . . X X . . . \n"
, 'X', true);
DecoderResult result = parse(std::move(bits), true, 16, 4);
EXPECT_EQ(result.error(), Error::Checksum);
}
TEST(AZDecoderTest, DecodeTooManyErrors2)
{
auto bits = ParseBitMatrix(
". X X . . X . X X . . . X . . X X X . . . X X . X X . \n"
"X X . X X . . X . . . X X . . . X X . X X X . X . X X \n"
". . . . X . . . X X X . X X . X X X X . X X . . X . . \n"
"X . X X . . X . . . X X . X X . X . X X . . . . . X . \n"
"X X . X . . X . X X . . . . . X X . . . . . X . . . X \n"
"X . . X . . . . . . X . . . X . X X X X X X X . . . X \n"
"X . . X X . . X . . X X . . . . . X . . . . . X X X . \n"
". . X X X X . X . . . . . X X X X X X . . . . . . X X \n"
"X . . . X . X X X X X X . . X X X . X . X X X X X X . \n"
"X . . X X X . X X X X X X X X X X X X X . . . X . X X \n"
". . . . X X . . . X . . . . . . . X X . . . X X . X . \n"
". . . X X X . . X X . X X X X X . X . . X . . . . . . \n"
"X . . . . X . X . X . X . . . X . X . X X . X X . X X \n"
"X . X . . X . X . X . X . X . X . X . . . . . X . X X \n"
"X . X X X . . X . X . X . . . X . X . X X X . . . X X \n"
"X X X X X X X X . X . X X X X X . X . X . X . X X X . \n"
". . . . . . . X . X . . . . . . . X X X X . . . X X X \n"
"X X . . X . . X . X X X X X X X X X X X X X . . X . X \n"
"X X X . X X X X . . X X X X . . X . . . . X . . X X X \n"
". . X X X X X . X . . . . X X X X . . X X X . X . X . \n"
". . X X . X . X . . . X . X X . X X . . . . X X . . . \n"
"X . . . X . X . X X X X X X . . X . X X X X X . X . . \n"
". X . . . X X X . . . . . X . . . . . X X X X X . X . \n"
"X . . X . X X X X . X . X . . . . X . X X . X . . X . \n"
"X . . . X X . X . X X X X X X X X . X X X X . . X X . \n"
". X X X X . . X . . X X X . X X . . X . . . . X X X . \n"
"X X . . . X X . . X . X . . . . X X . X . . X . X . X \n"
, 'X', true);
DecoderResult result = parse(std::move(bits), true, 16, 4);
EXPECT_EQ(result.error(), Error::Checksum);
}
// Helper taking bit string to call GetEncodedData()
static DecoderResult getData(std::string_view bitStr)
{
BitArray bits;
for (auto b : bitStr)
bits.appendBit(b == '1');
return Aztec::Decode(bits);
}
TEST(AZDecoderTest, SymbologyIdentifier)
{
{
// Plain
auto data = getData("00010");
EXPECT_EQ(data.symbologyIdentifier(), "]z0");
EXPECT_EQ(data.text(), L"A");
}
{
// GS1 ("PS FLGN(0) DL (20)01")
auto data = getData("0000000000000111100100001000100011");
EXPECT_EQ(data.symbologyIdentifier(), "]z1");
EXPECT_EQ(data.text(), L"2001");
}
{
// AIM ("A PS FLGN(0) B")
auto data = getData("00010000000000000000011");
EXPECT_EQ(data.symbologyIdentifier(), "]z2");
EXPECT_EQ(data.text(), L"AB");
}
{
// AIM ("DL 99 UL PS FLGN(0) B")
auto data = getData("11110101110111110000000000000000011");
EXPECT_EQ(data.symbologyIdentifier(), "]z2");
EXPECT_EQ(data.text(), L"99B");
}
{
// Structured Append ("UL ML A D A")
auto data = getData("1110111101000100010100010");
EXPECT_EQ(data.symbologyIdentifier(), "]z6");
EXPECT_EQ(data.text(), L"A");
EXPECT_EQ(data.structuredAppend().index, 0);
EXPECT_EQ(data.structuredAppend().count, 4);
}
{
// Structured Append with GS1 ("UL ML A D PS FLGN(0) DL (20)01")
auto data = getData("111011110100010001010000000000000111100100001000100011");
EXPECT_EQ(data.symbologyIdentifier(), "]z7");
EXPECT_EQ(data.text(), L"2001");
EXPECT_EQ(data.structuredAppend().index, 0);
EXPECT_EQ(data.structuredAppend().count, 4);
}
{
// Structured Append with AIM ("UL ML A D A PS FLGN(0) B")
auto data = getData("1110111101000100010100010000000000000000011");
EXPECT_EQ(data.symbologyIdentifier(), "]z8");
EXPECT_EQ(data.text(), L"AB");
EXPECT_EQ(data.structuredAppend().index, 0);
EXPECT_EQ(data.structuredAppend().count, 4);
}
{
// Plain with FNC1 not in first/second position ("A B PS FLGN(0) C")
auto data = getData("0001000011000000000000000100");
EXPECT_EQ(data.symbologyIdentifier(), "]z0");
EXPECT_EQ(data.text(), L"AB\u001DC"); // "AB<GS>C"
}
{
// Plain with FNC1 not in first/second position ("A B C PS FLGN(0) D")
auto data = getData("000100001100100000000000000000101");
EXPECT_EQ(data.symbologyIdentifier(), "]z0");
EXPECT_EQ(data.text(), L"ABC\u001DD"); // "ABC<GS>D"
}
{
// Plain with FNC1 not in first/second position ("DL 1 UL PS FLGN(0) A")
auto data = getData("1111000111110000000000000000010");
EXPECT_EQ(data.symbologyIdentifier(), "]z0");
EXPECT_EQ(data.text(), L"1\u001DA"); // "1<GS>D"
}
}
// Helper taking 5-bit word array to call GetEncodedData()
static DecoderResult getData(const ByteArray& bytes)
{
BitArray bits; // 5-bit words (assuming no digits/binary)
for (auto b : bytes)
bits.appendBits(b, 5);
return Aztec::Decode(bits);
}
// Shorthand to return Structured Append given 5-bit word array
static StructuredAppendInfo sai(const ByteArray& bytes)
{
return getData(bytes).structuredAppend();
}
// Shorthand to return string result given 5-bit word array
static std::wstring text(const ByteArray& bytes)
{
return getData(bytes).text();
}
TEST(AZDecoderTest, StructuredAppend)
{
// Null
EXPECT_EQ(sai({2}).index, -1);
EXPECT_EQ(sai({2}).count, -1);
EXPECT_TRUE(sai({2}).id.empty());
EXPECT_EQ(text({2}), L"A");
// Example from ISO/IEC 24778:2008 Section 8
EXPECT_EQ(sai({29, 29, 2, 5, 2}).index, 0); // AD
EXPECT_EQ(sai({29, 29, 2, 5, 2}).count, 4);
EXPECT_TRUE(sai({29, 29, 2, 5, 2}).id.empty());
EXPECT_EQ(text({29, 29, 2, 5, 2}), L"A");
EXPECT_EQ(sai({29, 29, 3, 5, 2}).index, 1); // BD
EXPECT_EQ(sai({29, 29, 3, 5, 2}).count, 4);
EXPECT_TRUE(sai({29, 29, 3, 5, 2}).id.empty());
EXPECT_EQ(text({29, 29, 3, 5, 2}), L"A");
EXPECT_EQ(sai({29, 29, 4, 5, 2}).index, 2); // CD
EXPECT_EQ(sai({29, 29, 4, 5, 2}).count, 4);
EXPECT_TRUE(sai({29, 29, 4, 5, 2}).id.empty());
EXPECT_EQ(text({29, 29, 4, 5, 2}), L"A");
EXPECT_EQ(sai({29, 29, 5, 5, 2}).index, 3); // DD
EXPECT_EQ(sai({29, 29, 5, 5, 2}).count, 4);
EXPECT_TRUE(sai({29, 29, 5, 5, 2}).id.empty());
EXPECT_EQ(text({29, 29, 5, 5, 2}), L"A");
// Sequencing field
EXPECT_EQ(sai({29, 29, 2, 27, 2}).index, 0); // AZ
EXPECT_EQ(sai({29, 29, 2, 27, 2}).count, 26);
EXPECT_EQ(sai({29, 29, 14, 27, 2}).index, 12); // MZ
EXPECT_EQ(sai({29, 29, 14, 27, 2}).count, 26);
EXPECT_EQ(sai({29, 29, 27, 27, 2}).index, 25); // ZZ
EXPECT_EQ(sai({29, 29, 27, 27, 2}).count, 26);
// Id
EXPECT_EQ(sai({29, 29, 1, 10, 5, 1, 2, 5, 2}).id, "ID");
EXPECT_EQ(text({29, 29, 1, 10, 5, 1, 2, 5, 2}), L"A");
// Invalid sequencing
EXPECT_EQ(sai({29, 29, 2, 2, 2}).index, 0); // AA
EXPECT_EQ(sai({29, 29, 2, 2, 2}).count, 0); // Count 1 so set to 0
EXPECT_EQ(text({29, 29, 2, 2, 2}), L"A");
EXPECT_EQ(sai({29, 29, 6, 5, 2}).index, 4); // ED
EXPECT_EQ(sai({29, 29, 6, 5, 2}).count, 0); // Count 4 <= index 4 so set to 0
EXPECT_EQ(text({29, 29, 6, 5, 2}), L"A");
EXPECT_EQ(sai({29, 29, 1, 5, 2}).index, -1); // Index < 'A'
EXPECT_EQ(sai({29, 29, 1, 5, 2}).count, -1);
EXPECT_EQ(text({29, 29, 1, 5, 2}), L" DA"); // Bad sequencing left in result
EXPECT_EQ(sai({29, 29, 28, 5, 2}).index, -1); // Index > 'Z' (LL)
EXPECT_EQ(sai({29, 29, 28, 5, 2}).count, -1);
EXPECT_EQ(text({29, 29, 28, 5, 2}), L"da");
EXPECT_EQ(sai({29, 29, 2, 1, 2}).index, -1); // Count < 'A'
EXPECT_EQ(sai({29, 29, 2, 1, 2}).count, -1);
EXPECT_EQ(text({29, 29, 2, 1, 2}), L"A A");
EXPECT_EQ(sai({29, 29, 2, 28, 2}).index, -1); // Count > 'Z'
EXPECT_EQ(sai({29, 29, 2, 28, 2}).count, -1);
EXPECT_EQ(text({29, 29, 2, 28, 2}), L"Aa");
EXPECT_EQ(sai({29, 29, 2, 5}).index, -1); // Sequencing but no data
EXPECT_EQ(sai({29, 29, 2, 5}).count, -1);
EXPECT_EQ(text({29, 29, 2, 5}), L"AD");
// Invalid Ids
{
auto data = getData({29, 29, 1, 10, 5, 2, 5, 2}); // No terminating space
EXPECT_TRUE(data.structuredAppend().id.empty());
EXPECT_EQ(data.structuredAppend().index, -1); // Not recognized as sequence
EXPECT_EQ(data.structuredAppend().count, -1);
EXPECT_EQ(data.text(), L" IDADA"); // Bad ID and sequencing left in result
}
{
auto data = getData({29, 29, 1, 1, 2, 5, 2}); // Blank
EXPECT_TRUE(data.structuredAppend().id.empty());
EXPECT_EQ(data.structuredAppend().index, 0); // Recognized as sequence
EXPECT_EQ(data.structuredAppend().count, 4);
EXPECT_EQ(data.text(), L"A");
}
{
auto data = getData({29, 29, 1, 10, 1, 5, 1, 2, 5, 2}); // Space in "I D"
EXPECT_TRUE(data.structuredAppend().id.empty());
EXPECT_EQ(data.structuredAppend().index, -1); // Not recognized as sequence as sequence count invalid (space)
EXPECT_EQ(data.structuredAppend().count, -1);
EXPECT_EQ(data.text(), L" I D ADA"); // Bad ID and sequencing left in result
}
{
auto data = getData({29, 29, 1, 10, 1, 2, 5, 1, 2, 5, 2}); // "I AD" (happens to have valid sequencing at end)
EXPECT_EQ(data.structuredAppend().id, "I");
EXPECT_EQ(data.structuredAppend().index, 0);
EXPECT_EQ(data.structuredAppend().count, 4);
EXPECT_EQ(data.text(), L" ADA"); // Trailing space and "real" sequencing left in result
}
}
|
