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 2007 ZXing authors | 8 * Copyright 2007 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 "xfa/src/fxbarcode/barcode.h" | 23 #include "xfa/src/fxbarcode/barcode.h" |
| 24 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomon.h" |
24 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomonGF256.h" | 25 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomonGF256.h" |
25 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomonGF256Poly.h" | 26 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomonGF256Poly.h" |
26 #include "xfa/src/fxbarcode/common/reedsolomon/BC_ReedSolomon.h" | |
27 CBC_ReedSolomonEncoder::CBC_ReedSolomonEncoder(CBC_ReedSolomonGF256* field) { | 27 CBC_ReedSolomonEncoder::CBC_ReedSolomonEncoder(CBC_ReedSolomonGF256* field) { |
28 m_field = field; | 28 m_field = field; |
29 } | 29 } |
30 void CBC_ReedSolomonEncoder::Init() { | 30 void CBC_ReedSolomonEncoder::Init() { |
31 m_cachedGenerators.Add(new CBC_ReedSolomonGF256Poly(m_field, 1)); | 31 m_cachedGenerators.Add(new CBC_ReedSolomonGF256Poly(m_field, 1)); |
32 } | 32 } |
33 CBC_ReedSolomonGF256Poly* CBC_ReedSolomonEncoder::BuildGenerator(int32_t degree, | 33 CBC_ReedSolomonGF256Poly* CBC_ReedSolomonEncoder::BuildGenerator(int32_t degree, |
34 int32_t& e) { | 34 int32_t& e) { |
35 if (degree >= m_cachedGenerators.GetSize()) { | 35 if (degree >= m_cachedGenerators.GetSize()) { |
36 CBC_ReedSolomonGF256Poly* lastGenerator = | 36 CBC_ReedSolomonGF256Poly* lastGenerator = |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
93 } | 93 } |
94 for (int32_t k = 0; k < temp->GetSize(); k++) { | 94 for (int32_t k = 0; k < temp->GetSize(); k++) { |
95 delete (CBC_ReedSolomonGF256Poly*)(*temp)[k]; | 95 delete (CBC_ReedSolomonGF256Poly*)(*temp)[k]; |
96 } | 96 } |
97 } | 97 } |
98 CBC_ReedSolomonEncoder::~CBC_ReedSolomonEncoder() { | 98 CBC_ReedSolomonEncoder::~CBC_ReedSolomonEncoder() { |
99 for (int32_t i = 0; i < m_cachedGenerators.GetSize(); i++) { | 99 for (int32_t i = 0; i < m_cachedGenerators.GetSize(); i++) { |
100 delete (CBC_ReedSolomonGF256Poly*)m_cachedGenerators[i]; | 100 delete (CBC_ReedSolomonGF256Poly*)m_cachedGenerators[i]; |
101 } | 101 } |
102 } | 102 } |
OLD | NEW |