OLD | NEW |
1 // Copyright 2014 PDFium Authors. All rights reserved. | 1 // Copyright 2014 PDFium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com | 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com |
6 // Original code is licensed as follows: | 6 // Original code is licensed as follows: |
7 /* | 7 /* |
8 * Copyright 2008 ZXing authors | 8 * Copyright 2008 ZXing authors |
9 * | 9 * |
10 * Licensed under the Apache License, Version 2.0 (the "License"); | 10 * Licensed under the Apache License, Version 2.0 (the "License"); |
11 * you may not use this file except in compliance with the License. | 11 * you may not use this file except in compliance with the License. |
12 * You may obtain a copy of the License at | 12 * You may obtain a copy of the License at |
13 * | 13 * |
14 * http://www.apache.org/licenses/LICENSE-2.0 | 14 * http://www.apache.org/licenses/LICENSE-2.0 |
15 * | 15 * |
16 * Unless required by applicable law or agreed to in writing, software | 16 * Unless required by applicable law or agreed to in writing, software |
17 * distributed under the License is distributed on an "AS IS" BASIS, | 17 * distributed under the License is distributed on an "AS IS" BASIS, |
18 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | 18 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
19 * See the License for the specific language governing permissions and | 19 * See the License for the specific language governing permissions and |
20 * limitations under the License. | 20 * limitations under the License. |
21 */ | 21 */ |
22 | 22 |
23 #include "../barcode.h" | 23 #include "../barcode.h" |
24 #include "../BC_Reader.h" | 24 #include "../BC_Reader.h" |
25 #include "../common/BC_CommonBitArray.h" | 25 #include "../common/BC_CommonBitArray.h" |
26 #include "BC_OneDReader.h" | 26 #include "BC_OneDReader.h" |
27 #include "BC_OneDimReader.h" | 27 #include "BC_OneDimReader.h" |
28 #include "BC_OnedEAN13Reader.h" | 28 #include "BC_OnedEAN13Reader.h" |
29 const FX_INT32 CBC_OnedEAN13Reader::FIRST_DIGIT_ENCODINGS[10] = { | 29 const int32_t CBC_OnedEAN13Reader::FIRST_DIGIT_ENCODINGS[10] = { |
30 0x00, 0x0B, 0x0D, 0xE, 0x13, 0x19, 0x1C, 0x15, 0x16, 0x1A | 30 0x00, 0x0B, 0x0D, 0xE, 0x13, 0x19, 0x1C, 0x15, 0x16, 0x1A |
31 }; | 31 }; |
32 CBC_OnedEAN13Reader::CBC_OnedEAN13Reader() | 32 CBC_OnedEAN13Reader::CBC_OnedEAN13Reader() |
33 { | 33 { |
34 } | 34 } |
35 CBC_OnedEAN13Reader::~CBC_OnedEAN13Reader() | 35 CBC_OnedEAN13Reader::~CBC_OnedEAN13Reader() |
36 { | 36 { |
37 } | 37 } |
38 void CBC_OnedEAN13Reader::DetermineFirstDigit(CFX_ByteString &result, FX_INT32 l
gPatternFound, FX_INT32 &e) | 38 void CBC_OnedEAN13Reader::DetermineFirstDigit(CFX_ByteString &result, int32_t lg
PatternFound, int32_t &e) |
39 { | 39 { |
40 for (FX_INT32 d = 0; d < 10; d++) { | 40 for (int32_t d = 0; d < 10; d++) { |
41 if (lgPatternFound == FIRST_DIGIT_ENCODINGS[d]) { | 41 if (lgPatternFound == FIRST_DIGIT_ENCODINGS[d]) { |
42 result.Insert(0, (FX_CHAR) ('0' + d)); | 42 result.Insert(0, (FX_CHAR) ('0' + d)); |
43 return; | 43 return; |
44 } | 44 } |
45 } | 45 } |
46 e = BCExceptionNotFound; | 46 e = BCExceptionNotFound; |
47 BC_EXCEPTION_CHECK_ReturnVoid(e); | 47 BC_EXCEPTION_CHECK_ReturnVoid(e); |
48 } | 48 } |
49 FX_INT32 CBC_OnedEAN13Reader::DecodeMiddle(CBC_CommonBitArray *row, CFX_Int32Arr
ay *startRange, CFX_ByteString &resultString, FX_INT32 &e) | 49 int32_t CBC_OnedEAN13Reader::DecodeMiddle(CBC_CommonBitArray *row, CFX_Int32Arra
y *startRange, CFX_ByteString &resultString, int32_t &e) |
50 { | 50 { |
51 CFX_Int32Array counters; | 51 CFX_Int32Array counters; |
52 counters.Add(0); | 52 counters.Add(0); |
53 counters.Add(0); | 53 counters.Add(0); |
54 counters.Add(0); | 54 counters.Add(0); |
55 counters.Add(0); | 55 counters.Add(0); |
56 FX_INT32 end = row->GetSize(); | 56 int32_t end = row->GetSize(); |
57 FX_INT32 rowOffset = (*startRange)[1]; | 57 int32_t rowOffset = (*startRange)[1]; |
58 FX_INT32 lgPatternFound = 0; | 58 int32_t lgPatternFound = 0; |
59 for (FX_INT32 x = 0; x < 6 && rowOffset < end; x++) { | 59 for (int32_t x = 0; x < 6 && rowOffset < end; x++) { |
60 FX_INT32 bestMatch = DecodeDigit(row, &counters, rowOffset, &(CBC_OneDim
Reader::L_AND_G_PATTERNS[0][0]), 20, e); | 60 int32_t bestMatch = DecodeDigit(row, &counters, rowOffset, &(CBC_OneDimR
eader::L_AND_G_PATTERNS[0][0]), 20, e); |
61 BC_EXCEPTION_CHECK_ReturnValue(e, 0); | 61 BC_EXCEPTION_CHECK_ReturnValue(e, 0); |
62 resultString += (FX_CHAR) ('0' + bestMatch % 10); | 62 resultString += (FX_CHAR) ('0' + bestMatch % 10); |
63 for (FX_INT32 i = 0; i < counters.GetSize(); i++) { | 63 for (int32_t i = 0; i < counters.GetSize(); i++) { |
64 rowOffset += counters[i]; | 64 rowOffset += counters[i]; |
65 } | 65 } |
66 if (bestMatch >= 10) { | 66 if (bestMatch >= 10) { |
67 lgPatternFound |= 1 << (5 - x); | 67 lgPatternFound |= 1 << (5 - x); |
68 } | 68 } |
69 } | 69 } |
70 DetermineFirstDigit(resultString, lgPatternFound, e); | 70 DetermineFirstDigit(resultString, lgPatternFound, e); |
71 BC_EXCEPTION_CHECK_ReturnValue(e, 0); | 71 BC_EXCEPTION_CHECK_ReturnValue(e, 0); |
72 CFX_Int32Array result; | 72 CFX_Int32Array result; |
73 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[0]); | 73 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[0]); |
74 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[1]); | 74 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[1]); |
75 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[2]); | 75 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[2]); |
76 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[3]); | 76 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[3]); |
77 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[4]); | 77 result.Add(CBC_OneDimReader::MIDDLE_PATTERN[4]); |
78 CFX_Int32Array *middleRange = FindGuardPattern(row, rowOffset, TRUE, &result
, e); | 78 CFX_Int32Array *middleRange = FindGuardPattern(row, rowOffset, TRUE, &result
, e); |
79 BC_EXCEPTION_CHECK_ReturnValue(e, 0); | 79 BC_EXCEPTION_CHECK_ReturnValue(e, 0); |
80 rowOffset = (*middleRange)[1]; | 80 rowOffset = (*middleRange)[1]; |
81 if(middleRange != NULL) { | 81 if(middleRange != NULL) { |
82 delete middleRange; | 82 delete middleRange; |
83 middleRange = NULL; | 83 middleRange = NULL; |
84 } | 84 } |
85 for (FX_INT32 Y = 0; Y < 6 && rowOffset < end; Y++) { | 85 for (int32_t Y = 0; Y < 6 && rowOffset < end; Y++) { |
86 FX_INT32 bestMatch = DecodeDigit(row, &counters, rowOffset, &(CBC_OneDim
Reader::L_PATTERNS[0][0]), 10, e); | 86 int32_t bestMatch = DecodeDigit(row, &counters, rowOffset, &(CBC_OneDimR
eader::L_PATTERNS[0][0]), 10, e); |
87 BC_EXCEPTION_CHECK_ReturnValue(e, 0); | 87 BC_EXCEPTION_CHECK_ReturnValue(e, 0); |
88 resultString += (FX_CHAR) ('0' + bestMatch); | 88 resultString += (FX_CHAR) ('0' + bestMatch); |
89 for (FX_INT32 k = 0; k < counters.GetSize(); k++) { | 89 for (int32_t k = 0; k < counters.GetSize(); k++) { |
90 rowOffset += counters[k]; | 90 rowOffset += counters[k]; |
91 } | 91 } |
92 } | 92 } |
93 return rowOffset; | 93 return rowOffset; |
94 } | 94 } |
OLD | NEW |