Skip to content

Commit

Permalink
bump version to v0.2.1
Browse files Browse the repository at this point in the history
  • Loading branch information
thanhminhmr committed May 21, 2023
1 parent 53e0b1e commit 3749b55
Show file tree
Hide file tree
Showing 4 changed files with 4 additions and 4 deletions.
2 changes: 1 addition & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[package]
name = "srx"
version = "0.2.0"
version = "0.2.1"
edition = "2021"

[profile.dev]
Expand Down
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ Fast Symbol Ranking based compressor. Based on the idea of [Matt Mahoney's SR2](
## Usage

```
srx: The fast Symbol Ranking based compressor, version 0.2.0.
srx: The fast Symbol Ranking based compressor, version 0.2.1.
Copyright (C) 2023 Mai Thanh Minh (a.k.a. thanhminhmr)
To compress: srx c <input-file> <output-file>
Expand Down
2 changes: 1 addition & 1 deletion src/basic/pipe.rs
Original file line number Diff line number Diff line change
Expand Up @@ -191,7 +191,7 @@ impl<T: Copy + Send + 'static, const SIZE: usize> ToConsumer<T> for PipedReader<
Ok(consumed_length)
} else {
Err(AnyError::from_string(
"Consumed length is greater than available lenght!",
"Consumed length is greater than available length!",
))
}
}
Expand Down
2 changes: 1 addition & 1 deletion src/secondary_context/prediction.rs
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ pub const MULTIPLIER: [u32; 256] = {
let mut table = [0; 256];
let mut i: usize = 0;
while i < 256 {
let div = (1 << 33) / (i as u64 + 2);
let div: u64 = (1 << 33) / (i as u64 + 2);
table[i] = ((div >> 1) + (div & 1)) as u32; // rounding
i += 1;
}
Expand Down

0 comments on commit 3749b55

Please sign in to comment.