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

Fix doc failure on nightly.

Browse source 
Fix #41.
This commit is contained in:
kennytm 2020-01-05 00:14:33 +08:00
parent bcecedf489
commit e6c0d85555
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Cargo.toml
View file

@ -2,7 +2,7 @@
name = "qrcode" name = "qrcode"
description = "QR code encoder in Rust" description = "QR code encoder in Rust"
license = "MIT OR Apache-2.0" license = "MIT OR Apache-2.0"
version = "0.11.1" version = "0.11.2"
edition = "2018" edition = "2018"
authors = ["kennytm <kennytm@gmail.com>"] authors = ["kennytm <kennytm@gmail.com>"]
keywords = ["qrcode"] keywords = ["qrcode"]

6
src/ec.rs
View file

@ -13,9 +13,9 @@ use crate::types::{EcLevel, QrResult, Version};
/// 69 bytes. Longer blocks will result in task panic. /// 69 bytes. Longer blocks will result in task panic.
/// ///
/// This method treats the data as a polynomial of the form /// This method treats the data as a polynomial of the form
/// (a[0] x<sup>m+n</sup> + a[1] x<sup>m+n-1</sup> + … + a[m] x<sup>n</sup>) in /// (a\[0\] x<sup>m+n</sup> + a\[1\] x<sup>m+n-1</sup> + … + a\[m\] x<sup>n</sup>)
/// GF(256), and then computes the polynomial modulus with a generator /// in GF(2<sup>8</sup>), and then computes the polynomial modulus with a
/// polynomial of degree N. /// generator polynomial of degree N.
pub fn create_error_correction_code(data: &[u8], ec_code_size: usize) -> Vec<u8> { pub fn create_error_correction_code(data: &[u8], ec_code_size: usize) -> Vec<u8> {
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];