| 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 "core/include/fxcrt/fx_basic.h" |
| 23 #include "xfa/src/fxbarcode/BC_ResultPoint.h" | 24 #include "xfa/src/fxbarcode/BC_ResultPoint.h" |
| 24 #include "xfa/src/fxbarcode/barcode.h" | |
| 25 #include "xfa/src/fxbarcode/common/BC_CommonBitMatrix.h" | 25 #include "xfa/src/fxbarcode/common/BC_CommonBitMatrix.h" |
| 26 #include "xfa/src/fxbarcode/qrcode/BC_FinderPatternInfo.h" | 26 #include "xfa/src/fxbarcode/qrcode/BC_FinderPatternInfo.h" |
| 27 #include "xfa/src/fxbarcode/qrcode/BC_QRFinderPattern.h" | 27 #include "xfa/src/fxbarcode/qrcode/BC_QRFinderPattern.h" |
| 28 #include "xfa/src/fxbarcode/qrcode/BC_QRFinderPatternFinder.h" | 28 #include "xfa/src/fxbarcode/qrcode/BC_QRFinderPatternFinder.h" |
| 29 #include "xfa/src/fxbarcode/utils.h" |
| 30 |
| 29 const int32_t CBC_QRFinderPatternFinder::CENTER_QUORUM = 2; | 31 const int32_t CBC_QRFinderPatternFinder::CENTER_QUORUM = 2; |
| 30 const int32_t CBC_QRFinderPatternFinder::MIN_SKIP = 3; | 32 const int32_t CBC_QRFinderPatternFinder::MIN_SKIP = 3; |
| 31 const int32_t CBC_QRFinderPatternFinder::MAX_MODULES = 57; | 33 const int32_t CBC_QRFinderPatternFinder::MAX_MODULES = 57; |
| 32 const int32_t CBC_QRFinderPatternFinder::INTEGER_MATH_SHIFT = 8; | 34 const int32_t CBC_QRFinderPatternFinder::INTEGER_MATH_SHIFT = 8; |
| 35 |
| 33 CBC_QRFinderPatternFinder::CBC_QRFinderPatternFinder( | 36 CBC_QRFinderPatternFinder::CBC_QRFinderPatternFinder( |
| 34 CBC_CommonBitMatrix* image) { | 37 CBC_CommonBitMatrix* image) { |
| 35 m_image = image; | 38 m_image = image; |
| 36 m_crossCheckStateCount.SetSize(5); | 39 m_crossCheckStateCount.SetSize(5); |
| 37 m_hasSkipped = FALSE; | 40 m_hasSkipped = FALSE; |
| 38 } | 41 } |
| 39 CBC_QRFinderPatternFinder::~CBC_QRFinderPatternFinder() { | 42 CBC_QRFinderPatternFinder::~CBC_QRFinderPatternFinder() { |
| 40 for (int32_t i = 0; i < m_possibleCenters.GetSize(); i++) { | 43 for (int32_t i = 0; i < m_possibleCenters.GetSize(); i++) { |
| 41 delete (CBC_QRFinderPattern*)m_possibleCenters[i]; | 44 delete (CBC_QRFinderPattern*)m_possibleCenters[i]; |
| 42 } | 45 } |
| (...skipping 420 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 463 if (m_possibleCenters.GetSize() > 3) { | 466 if (m_possibleCenters.GetSize() > 3) { |
| 464 BC_FX_PtrArray_Sort(m_possibleCenters, centerComparator); | 467 BC_FX_PtrArray_Sort(m_possibleCenters, centerComparator); |
| 465 } | 468 } |
| 466 CFX_PtrArray* vec = new CFX_PtrArray(); | 469 CFX_PtrArray* vec = new CFX_PtrArray(); |
| 467 vec->SetSize(3); | 470 vec->SetSize(3); |
| 468 (*vec)[0] = ((CBC_QRFinderPattern*)m_possibleCenters[0])->Clone(); | 471 (*vec)[0] = ((CBC_QRFinderPattern*)m_possibleCenters[0])->Clone(); |
| 469 (*vec)[1] = ((CBC_QRFinderPattern*)m_possibleCenters[1])->Clone(); | 472 (*vec)[1] = ((CBC_QRFinderPattern*)m_possibleCenters[1])->Clone(); |
| 470 (*vec)[2] = ((CBC_QRFinderPattern*)m_possibleCenters[2])->Clone(); | 473 (*vec)[2] = ((CBC_QRFinderPattern*)m_possibleCenters[2])->Clone(); |
| 471 return vec; | 474 return vec; |
| 472 } | 475 } |
| OLD | NEW |