able/qrcode-rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

rustup.

Browse source
This commit is contained in:
kennytm 2014-09-24 16:02:36 +08:00
parent b7214af165
commit fa40eec147
2 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/bits.rs
View file

@ -835,7 +835,7 @@ pub fn encode_auto(data: &[u8], ec_level: ErrorCorrectionLevel) -> QrResult<Bits
let min_version = find_min_version(total_len, ec_level); let min_version = find_min_version(total_len, ec_level);
let mut bits = Bits::new(min_version); let mut bits = Bits::new(min_version);
bits.reserve_additional(total_len); bits.reserve_additional(total_len);
try!(bits.push_segments(data, opt_segments.move_iter())); try!(bits.push_segments(data, opt_segments.into_iter()));
try!(bits.push_terminator(ec_level)); try!(bits.push_terminator(ec_level));
return Ok(bits); return Ok(bits);
} }

4
src/ec.rs
View file

@ -15,8 +15,8 @@ use types::{QrResult, QrVersion, ErrorCorrectionLevel};
/// GF(256), and then computes the polynomial modulus with a generator /// GF(256), and then computes the polynomial modulus with a generator
/// polynomial of degree N. /// polynomial of degree N.
pub fn create_error_correction_code(data: &[u8], ec_code_size: uint) -> Vec<u8> { pub fn create_error_correction_code(data: &[u8], ec_code_size: uint) -> Vec<u8> {
let mut res = Vec::from_slice(data); let mut res = data.to_vec();
res.grow(ec_code_size, &0); res.grow(ec_code_size, 0);
let data_len = data.len(); let data_len = data.len();
let log_den = GENERATOR_POLYNOMIALS[ec_code_size]; let log_den = GENERATOR_POLYNOMIALS[ec_code_size];