| 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 2009 ZXing authors | 8 * Copyright 2009 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/BC_UtilRSS.h" | 23 #include "xfa/src/fxbarcode/BC_UtilRSS.h" |
| 24 | 24 |
| 25 #include <memory> |
| 26 |
| 25 #include "core/include/fxcrt/fx_basic.h" | 27 #include "core/include/fxcrt/fx_basic.h" |
| 26 #include "xfa/src/fxbarcode/utils.h" | 28 #include "xfa/src/fxbarcode/utils.h" |
| 27 | 29 |
| 28 CBC_UtilRSS::CBC_UtilRSS() {} | 30 CBC_UtilRSS::CBC_UtilRSS() {} |
| 29 CBC_UtilRSS::~CBC_UtilRSS() {} | 31 CBC_UtilRSS::~CBC_UtilRSS() {} |
| 30 CFX_Int32Array* CBC_UtilRSS::GetRssWidths(int32_t val, | 32 CFX_Int32Array* CBC_UtilRSS::GetRssWidths(int32_t val, |
| 31 int32_t n, | 33 int32_t n, |
| 32 int32_t elements, | 34 int32_t elements, |
| 33 int32_t maxWidth, | 35 int32_t maxWidth, |
| 34 FX_BOOL noNarrow) { | 36 FX_BOOL noNarrow) { |
| 35 CFX_Int32Array* iTemp = new CFX_Int32Array; | 37 std::unique_ptr<CFX_Int32Array> widths(new CFX_Int32Array); |
| 36 iTemp->SetSize(elements); | 38 widths->SetSize(elements); |
| 37 CBC_AutoPtr<CFX_Int32Array> widths(iTemp); | |
| 38 int32_t bar; | 39 int32_t bar; |
| 39 int32_t narrowMask = 0; | 40 int32_t narrowMask = 0; |
| 40 for (bar = 0; bar < elements - 1; bar++) { | 41 for (bar = 0; bar < elements - 1; bar++) { |
| 41 narrowMask |= (1 << bar); | 42 narrowMask |= (1 << bar); |
| 42 int32_t elmWidth = 1; | 43 int32_t elmWidth = 1; |
| 43 int32_t subVal; | 44 int32_t subVal; |
| 44 while (TRUE) { | 45 while (TRUE) { |
| 45 subVal = Combins(n - elmWidth - 1, elements - bar - 2); | 46 subVal = Combins(n - elmWidth - 1, elements - bar - 2); |
| 46 if (noNarrow && (narrowMask == 0) && | 47 if (noNarrow && (narrowMask == 0) && |
| 47 (n - elmWidth - (elements - bar - 1) >= elements - bar - 1)) { | 48 (n - elmWidth - (elements - bar - 1) >= elements - bar - 1)) { |
| (...skipping 106 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 154 minEven = (*widths)[twoK - 1]; | 155 minEven = (*widths)[twoK - 1]; |
| 155 } | 156 } |
| 156 if (minEven > 1) { | 157 if (minEven > 1) { |
| 157 for (i = 0; i < twoK; i += 2) { | 158 for (i = 0; i < twoK; i += 2) { |
| 158 (*widths)[i] += minEven - 1; | 159 (*widths)[i] += minEven - 1; |
| 159 (*widths)[i + 1] -= minEven - 1; | 160 (*widths)[i + 1] -= minEven - 1; |
| 160 } | 161 } |
| 161 } | 162 } |
| 162 return widths; | 163 return widths; |
| 163 } | 164 } |
| OLD | NEW |