Lib.rs

› Compression | Encoding
#byte-sequences #numbers #most #integer #convenience #wrapper #zig-zag

no-std uint-zigzag

Uint is a convenience wrapper for zig-zag encoding integers to byte sequences. This allows better compression since the majority of numbers are quite small resulting in 1 or 2 bytes in the most common case vs 4 for 32-bit numbers or 8 for 64-bit numbers. This also permits the user to not have to think about which integer type is the most efficient to compress

by Michael Lodder

3 unstable releases

0.2.1 Oct 20, 2022
0.2.0 Sep 13, 2022
0.1.0 Aug 15, 2022

#368 in Compression

Download history 272/week @ 2024-01-10 315/week @ 2024-01-17 308/week @ 2024-01-24 267/week @ 2024-01-31 268/week @ 2024-02-07 394/week @ 2024-02-14 252/week @ 2024-02-21 247/week @ 2024-02-28 395/week @ 2024-03-06 325/week @ 2024-03-13 1015/week @ 2024-03-20 609/week @ 2024-03-27 567/week @ 2024-04-03 321/week @ 2024-04-10 457/week @ 2024-04-17 210/week @ 2024-04-24

1,772 downloads per month
Used in 4 crates (3 directly)

Apache-2.0 OR MIT

18KB
375 lines

Crate Docs Apache 2.0

Uint-ZigZag

Uint-zigzag is a convenience wrapper for zig-zag encoding integers to byte sequences.

This allows better compression since the majority of numbers are quite small resulting in 1 or 2 bytes in the most common case vs 4 for 32-bit numbers or 8 for 64-bit numbers.

This also permits the user to not have to think about which integer type is the most efficient to compress.

This crate is passively maintained.

lib.rs:

Uint is a convenience wrapper for zig-zag encoding integers to byte sequences.

This allows better compression since the majority of numbers are quite small resulting in 1 or 2 bytes in the most common case vs 4 for 32-bit numbers or 8 for 64-bit numbers.

This also permits the user to not have to think about which value is the most efficient to compress.

Dependencies

~295–610KB