| 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"); |
| (...skipping 193 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 204 for (int32_t i = 0; i < max; i++) { | 204 for (int32_t i = 0; i < max; i++) { |
| 205 int32_t variance = PatternMatchVariance(counters, &patterns[i * 4], | 205 int32_t variance = PatternMatchVariance(counters, &patterns[i * 4], |
| 206 MAX_INDIVIDUAL_VARIANCE); | 206 MAX_INDIVIDUAL_VARIANCE); |
| 207 if (variance < bestVariance) { | 207 if (variance < bestVariance) { |
| 208 bestVariance = variance; | 208 bestVariance = variance; |
| 209 bestMatch = i; | 209 bestMatch = i; |
| 210 } | 210 } |
| 211 } | 211 } |
| 212 if (bestMatch >= 0) { | 212 if (bestMatch >= 0) { |
| 213 return bestMatch; | 213 return bestMatch; |
| 214 } else { | |
| 215 e = BCExceptionNotFound; | |
| 216 return 0; | |
| 217 } | 214 } |
| 215 e = BCExceptionNotFound; |
| 218 return 0; | 216 return 0; |
| 219 } | 217 } |
| OLD | NEW |