mirror of
https://github.com/starovoid/rxing.git
synced 2026-07-27 04:42:35 +00:00
Cleanup of many components of the code.
Many unwraps, expects, and panics removed or handled. More rustification of the codebase. Squashed commit of the following: commit 80c6483cf8c819496a7b781f9e3a149d1f18d5fe Author: Henry <henry@azule.info> Date: Fri Feb 10 20:36:57 2023 -0600 add other parsed result option commit 412d92ae585e7bf194697f5282dbc045e448bace Author: Henry <henry@azule.info> Date: Fri Feb 10 19:06:34 2023 -0600 fix some panics commit 9108d3e931aadec00fc0bf346ebc52d24e5d8146 Author: Henry <henry@azule.info> Date: Fri Feb 10 18:56:30 2023 -0600 clippy --fix commit 8cd89d314323f54f342f15fc73297b62d418ac79 Author: Henry <henry@azule.info> Date: Fri Feb 10 18:55:45 2023 -0600 some more cleanup in aztec commit fb7f9242e273b85a4bb212f22a185a0dcbfafc36 Author: Henry <henry@azule.info> Date: Fri Feb 10 18:19:54 2023 -0600 cleanup root commit 4fb7c0639830869149332b29be789e891eade3e7 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 16:50:15 2023 -0600 format commit 3ac271af657b25fbe5ee39cbdf8859e5aa38ea41 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 16:43:14 2023 -0600 clippy --fix commit 0c5b4c1477159db93a9da9645039f51cd1a7c574 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 16:04:31 2023 -0600 qrcode cleanup complete commit 70c1d107cc672e45d46567c650c46fece7e7da9c Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 13:28:25 2023 -0600 clippy --fix commit e13263d0f1f2a13dbb59b6e60d8b871a32babc92 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 13:27:44 2023 -0600 qrcode detector cleanup commit f7f2855099e469fe1091868c6099196705d0ae83 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 11:48:13 2023 -0600 qrcode decoder commit bdbaaba597b3479639c2ed3726465a69e3004471 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 11:13:18 2023 -0600 clippy --fix commit fd6dbcaeb1f45dc91ae98f0e7c58aad48d67df78 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 11:12:28 2023 -0600 pdf417 cleanup complete commit 7bbd47604c2639a5eb61bdb5533e71be3bce95a1 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 10:39:28 2023 -0600 clippy --fix commit 8f4962b7bb5f133524fe4d3d4948e5672a88c545 Author: Henry Schimke <henry@azule.info> Date: Fri Feb 10 10:39:00 2023 -0600 cleanup on pdf417 hie commit 254c8243953776d3c8704dd81529aadd05d5a94e Author: Henry <henry@azule.info> Date: Fri Feb 10 02:51:21 2023 +0000 partway through pdf417 hle commit d4a5b00fde8c0282b0c6e4175a21c1e111b11533 Author: Henry <henry@azule.info> Date: Wed Feb 8 21:35:25 2023 +0000 clippy --fix commit 2bd4a8e218aa963a88997b50bc5a198f9a88205e Author: Henry <henry@azule.info> Date: Wed Feb 8 21:31:55 2023 +0000 pdf417 decode and detect cleanup commit 05130ac54a72c2303045d64507bf6185aa74e531 Author: Henry Schimke <henry@azule.info> Date: Tue Feb 7 08:06:25 2023 -0600 at decodeTextCompaction in decoded_bit_straem_parser commit 924c023a7d2339dfffa6ef0c4a805fb192576796 Author: Henry Schimke <henry@azule.info> Date: Mon Feb 6 18:22:02 2023 -0600 clippy --fix commit 5cfb81a885c22b4b5ec937a79be31d0815def211 Author: Henry Schimke <henry@azule.info> Date: Mon Feb 6 18:20:22 2023 -0600 oned cleanup commit 0649b64854baf56a8e3314728d4f6cf4063db8b2 Author: Henry Schimke <henry@azule.info> Date: Mon Feb 6 11:47:28 2023 -0600 rss cleanup commit 2d3127898fc11f7e65d590e983cda799b798b646 Author: Henry Schimke <henry@azule.info> Date: Mon Feb 6 10:19:56 2023 -0600 multi cleanup commit 7e8b43a159083a2096123e6204d4d1d359c59981 Author: Henry <henry@azule.info> Date: Sun Feb 5 21:41:59 2023 -0600 cargo fmt commit df8285e8da07b4bffd48ca6e596de3f010eb8d9e Author: Henry <henry@azule.info> Date: Sun Feb 5 21:41:29 2023 -0600 maxicode cleanup commit a51f923a14016eb416ca202b2194258808dde3e7 Author: Henry <henry@azule.info> Date: Sun Feb 5 21:27:57 2023 -0600 cargo fmt commit 332d7eef4a25318611025a3fcb0b70c604d917be Author: Henry <henry@azule.info> Date: Sun Feb 5 21:27:48 2023 -0600 cleanup datamatrix commit eb2311c476a9c9993f271ab6cf9fd359aedca26f Author: Henry <henry@azule.info> Date: Sun Feb 5 21:27:26 2023 -0600 cargo clippy --fix commit 2abaa4c51d287f619d4c7a438f85ba2a30f159cf Author: Henry <henry@azule.info> Date: Sun Feb 5 19:13:02 2023 -0600 finish cleanup in parsers commit 716aa2fbf728716cff36657a5fd80e7bca5276b7 Author: Henry Schimke <henry@azule.info> Date: Sun Feb 5 17:44:56 2023 -0600 cleanup continues commit 7d843788a49fa9cc82c4616d226c0f882e73612b Author: Henry Schimke <henry@azule.info> Date: Sun Feb 5 15:15:09 2023 -0600 common cleanup commit fd251866c68f22d450dd428c93d7a3620bf1be27 Author: Henry Schimke <henry@azule.info> Date: Sun Feb 5 10:24:54 2023 -0600 cleanup reedsolomon commit 132e27ed1468f5c1ce998516ff5a00687217c3e6 Author: Henry Schimke <henry@azule.info> Date: Sun Feb 5 09:52:04 2023 -0600 make MathUtils more generic commit d8352b7fff4cb4f9ecc8e8a969710d26ef410e8b Author: Henry Schimke <henry@azule.info> Date: Sun Feb 5 09:29:33 2023 -0600 cleanup some string handling in ResultParser There may still be some edge cases where multi-byte characters break the parser
This commit is contained in:
@@ -67,22 +67,18 @@ pub const L_PATTERNS: [[u32; 4]; 10] = [
|
||||
* As above but also including the "even", or "G" patterns used to encode UPC/EAN digits.
|
||||
*/
|
||||
pub const L_AND_G_PATTERNS: [[u32; 4]; 20] = {
|
||||
let mut new_array = [[0_u32; 4]; 20]; //new int[20][];
|
||||
let mut new_array = [[0_u32; 4]; 20];
|
||||
let mut i = 0;
|
||||
while i < 10 {
|
||||
new_array[i] = L_PATTERNS[i];
|
||||
i += 1;
|
||||
}
|
||||
// new_array[0..10].copy_from_slice(&L_PATTERNS[0..10]);
|
||||
// System.arraycopy(L_PATTERNS, 0, L_AND_G_PATTERNS, 0, 10);
|
||||
let mut i = 10;
|
||||
while i < 20 {
|
||||
// for (int i = 10; i < 20; i++) {
|
||||
let widths = &L_PATTERNS[i - 10];
|
||||
let mut reversedWidths = [0_u32; 4]; //new int[widths.length];
|
||||
let mut reversedWidths = [0_u32; 4];
|
||||
let mut j = 0;
|
||||
while j < 4 {
|
||||
// for (int j = 0; j < widths.length; j++) {
|
||||
reversedWidths[j] = widths[4 - j - 1];
|
||||
|
||||
j += 1;
|
||||
@@ -104,24 +100,14 @@ pub const L_AND_G_PATTERNS: [[u32; 4]; 20] = {
|
||||
* @author alasdair@google.com (Alasdair Mackintosh)
|
||||
*/
|
||||
pub trait UPCEANReader: OneDReader {
|
||||
// private final StringBuilder decodeRowStringBuffer;
|
||||
// private final UPCEANExtensionSupport extensionReader;
|
||||
// private final EANManufacturerOrgSupport eanManSupport;
|
||||
|
||||
// protected UPCEANReader() {
|
||||
// decodeRowStringBuffer = new StringBuilder(20);
|
||||
// extensionReader = new UPCEANExtensionSupport();
|
||||
// eanManSupport = new EANManufacturerOrgSupport();
|
||||
// }
|
||||
|
||||
fn findStartGuardPattern(&self, row: &BitArray) -> Result<[usize; 2], Exceptions> {
|
||||
let mut foundStart = false;
|
||||
let mut startRange = [0; 2]; //= null;
|
||||
let mut startRange = [0; 2];
|
||||
let mut nextStart = 0;
|
||||
let mut counters = [0_u32; 3]; //vec![0_u32;START_END_PATTERN.len()];
|
||||
let mut counters = [0_u32; 3];
|
||||
while !foundStart {
|
||||
counters.fill(0);
|
||||
// Arrays.fill(counters, 0, START_END_PATTERN.len(), 0);
|
||||
|
||||
startRange = self.findGuardPatternWithCounters(
|
||||
row,
|
||||
nextStart,
|
||||
@@ -131,6 +117,7 @@ pub trait UPCEANReader: OneDReader {
|
||||
)?;
|
||||
let start = startRange[0];
|
||||
nextStart = startRange[1];
|
||||
|
||||
// Make sure there is a quiet zone at least as big as the start pattern before the barcode.
|
||||
// If this check would run off the left edge of the image, do not accept this barcode,
|
||||
// as it is very likely to be a false positive.
|
||||
@@ -143,12 +130,6 @@ pub trait UPCEANReader: OneDReader {
|
||||
Ok(startRange)
|
||||
}
|
||||
|
||||
// @Override
|
||||
// public RXingResult decodeRow(int rowNumber, BitArray row, Map<DecodeHintType,?> hints)
|
||||
// throws NotFoundException, ChecksumException, FormatException {
|
||||
// return decodeRow(rowNumber, row, findStartGuardPattern(row), hints);
|
||||
// }
|
||||
|
||||
/**
|
||||
* <p>Like {@link #decodeRow(int, BitArray, Map)}, but
|
||||
* allows caller to inform method about where the UPC/EAN start pattern is
|
||||
@@ -180,7 +161,7 @@ pub trait UPCEANReader: OneDReader {
|
||||
));
|
||||
}
|
||||
|
||||
let mut result = String::new(); //decodeRowStringBuffer;
|
||||
let mut result = String::new();
|
||||
let endStart = self.decodeMiddle(row, startGuardRange, &mut result)?;
|
||||
|
||||
if let Some(DecodeHintValue::NeedResultPointCallback(cb)) = resultPointCallback {
|
||||
@@ -205,10 +186,12 @@ pub trait UPCEANReader: OneDReader {
|
||||
}
|
||||
|
||||
let resultString = result;
|
||||
|
||||
// UPC/EAN should never be less than 8 chars anyway
|
||||
if resultString.chars().count() < 8 {
|
||||
return Err(Exceptions::FormatException(None));
|
||||
}
|
||||
|
||||
if !self.checkChecksum(&resultString)? {
|
||||
return Err(Exceptions::ChecksumException(None));
|
||||
}
|
||||
@@ -234,7 +217,9 @@ pub trait UPCEANReader: OneDReader {
|
||||
|
||||
decodeRXingResult.putMetadata(
|
||||
RXingResultMetadataType::UPC_EAN_EXTENSION,
|
||||
RXingResultMetadataValue::UpcEanExtension(extensionRXingResult.getText().clone()),
|
||||
RXingResultMetadataValue::UpcEanExtension(
|
||||
extensionRXingResult.getText().to_owned(),
|
||||
),
|
||||
);
|
||||
decodeRXingResult.putAllMetadata(extensionRXingResult.getRXingResultMetadata().clone());
|
||||
decodeRXingResult
|
||||
@@ -244,27 +229,12 @@ pub trait UPCEANReader: OneDReader {
|
||||
};
|
||||
|
||||
let _try_result = attempt();
|
||||
// if let Err(Exceptions::ReaderException(_)) = try_result {
|
||||
// } else if try_result.is_err() {
|
||||
// return Err(try_result.err().unwrap());
|
||||
// }
|
||||
|
||||
// try {
|
||||
// RXingResult extensionRXingResult = extensionReader.decodeRow(rowNumber, row, endRange[1]);
|
||||
// decodeRXingResult.putMetadata(RXingResultMetadataType.UPC_EAN_EXTENSION, extensionRXingResult.getText());
|
||||
// decodeRXingResult.putAllMetadata(extensionRXingResult.getRXingResultMetadata());
|
||||
// decodeRXingResult.addRXingResultPoints(extensionRXingResult.getRXingResultPoints());
|
||||
// extensionLength = extensionRXingResult.getText().length();
|
||||
// } catch (ReaderException re) {
|
||||
// // continue
|
||||
// }
|
||||
|
||||
if let Some(DecodeHintValue::AllowedEanExtensions(allowedExtensions)) =
|
||||
hints.get(&DecodeHintType::ALLOWED_EAN_EXTENSIONS)
|
||||
{
|
||||
let mut valid = false;
|
||||
for length in allowedExtensions {
|
||||
// for (int length : allowedExtensions) {
|
||||
if extensionLength == *length as usize {
|
||||
valid = true;
|
||||
break;
|
||||
@@ -274,20 +244,6 @@ pub trait UPCEANReader: OneDReader {
|
||||
return Err(Exceptions::NotFoundException(None));
|
||||
}
|
||||
}
|
||||
// let allowedExtensions =
|
||||
// hints == null ? null : (int[]) hints.get(DecodeHintType.ALLOWED_EAN_EXTENSIONS);
|
||||
// if (allowedExtensions != null) {
|
||||
// let valid = false;
|
||||
// for (int length : allowedExtensions) {
|
||||
// if (extensionLength == length) {
|
||||
// valid = true;
|
||||
// break;
|
||||
// }
|
||||
// }
|
||||
// if (!valid) {
|
||||
// return Err(Exceptions::NotFoundException(None));
|
||||
// }
|
||||
// }
|
||||
|
||||
if format == BarcodeFormat::EAN_13 || format == BarcodeFormat::UPC_A {
|
||||
let countryID = EAN_MANUFACTURER_SUPPORT.lookupCountryIdentifier(&resultString);
|
||||
@@ -298,6 +254,7 @@ pub trait UPCEANReader: OneDReader {
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
if format == BarcodeFormat::EAN_8 {
|
||||
symbologyIdentifier = 4;
|
||||
}
|
||||
@@ -332,16 +289,20 @@ pub trait UPCEANReader: OneDReader {
|
||||
if length == 0 {
|
||||
return Ok(false);
|
||||
}
|
||||
let char_in_question = s.chars().nth(length - 1).unwrap();
|
||||
let char_in_question = s
|
||||
.chars()
|
||||
.nth(length - 1)
|
||||
.ok_or(Exceptions::IndexOutOfBoundsException(None))?;
|
||||
let check = char_in_question.is_ascii_digit();
|
||||
// let check = Character.digit(s.charAt(length - 1), 10);
|
||||
|
||||
let check_against = &s[..length - 1]; //s.subSequence(0, length - 1);
|
||||
let calculated_checksum = self.getStandardUPCEANChecksum(check_against)?;
|
||||
|
||||
Ok(calculated_checksum
|
||||
== if check {
|
||||
char_in_question.to_digit(10).unwrap()
|
||||
char_in_question
|
||||
.to_digit(10)
|
||||
.ok_or(Exceptions::ParseException(None))?
|
||||
} else {
|
||||
u32::MAX
|
||||
})
|
||||
@@ -353,7 +314,11 @@ pub trait UPCEANReader: OneDReader {
|
||||
let mut i = length as isize - 1;
|
||||
while i >= 0 {
|
||||
// for (int i = length - 1; i >= 0; i -= 2) {
|
||||
let digit = (s.chars().nth(i as usize).unwrap() as i32) - ('0' as i32);
|
||||
let digit =
|
||||
(s.chars()
|
||||
.nth(i as usize)
|
||||
.ok_or(Exceptions::IndexOutOfBoundsException(None))? as i32)
|
||||
- ('0' as i32);
|
||||
if !(0..=9).contains(&digit) {
|
||||
return Err(Exceptions::FormatException(None));
|
||||
}
|
||||
@@ -365,7 +330,11 @@ pub trait UPCEANReader: OneDReader {
|
||||
let mut i = length as isize - 2;
|
||||
while i >= 0 {
|
||||
// for (int i = length - 2; i >= 0; i -= 2) {
|
||||
let digit = (s.chars().nth(i as usize).unwrap() as i32) - ('0' as i32);
|
||||
let digit =
|
||||
(s.chars()
|
||||
.nth(i as usize)
|
||||
.ok_or(Exceptions::IndexOutOfBoundsException(None))? as i32)
|
||||
- ('0' as i32);
|
||||
if !(0..=9).contains(&digit) {
|
||||
return Err(Exceptions::FormatException(None));
|
||||
}
|
||||
@@ -442,7 +411,7 @@ pub trait UPCEANReader: OneDReader {
|
||||
patternStart += (counters[0] + counters[1]) as usize;
|
||||
|
||||
counters.copy_within(2..(counterPosition - 1 + 2), 0);
|
||||
// System.arraycopy(counters, 2, counters, 0, counterPosition - 1);
|
||||
|
||||
counters[counterPosition - 1] = 0;
|
||||
counters[counterPosition] = 0;
|
||||
counterPosition -= 1;
|
||||
@@ -481,7 +450,6 @@ pub trait UPCEANReader: OneDReader {
|
||||
let mut bestMatch = -1_isize;
|
||||
let max = patterns.len();
|
||||
for (i, pattern) in patterns.iter().enumerate().take(max) {
|
||||
// for (int i = 0; i < max; i++) {
|
||||
let variance: f32 =
|
||||
one_d_reader::patternMatchVariance(counters, pattern, MAX_INDIVIDUAL_VARIANCE);
|
||||
if variance < bestVariance {
|
||||
|
||||
Reference in New Issue
Block a user