#integer #varint #zigzag

dusk-varint

varint+zigzag integer encoding/decoding (no_std)

1 unstable release

0.1.0 May 26, 2021

#1867 in Encoding

Download history 34/week @ 2024-03-11 36/week @ 2024-03-18 75/week @ 2024-03-25 91/week @ 2024-04-01 28/week @ 2024-04-08 46/week @ 2024-04-15 40/week @ 2024-04-22 38/week @ 2024-04-29 42/week @ 2024-05-06 31/week @ 2024-05-13 42/week @ 2024-05-20 32/week @ 2024-05-27 31/week @ 2024-06-03 33/week @ 2024-06-10 30/week @ 2024-06-17 38/week @ 2024-06-24

135 downloads per month
Used in 16 crates (via canonical)

MIT license

9KB
141 lines

dusk-varint

minimal no_std fork of integer-encoding

The format is described here: Google's protobuf integer encoding technique.

Please feel free to use cargo bench to determine the rate at which your machine can encode and decode varints and fixedints. Note that one iteration comprises each eight rounds of encoding (or decoding) a signed and an unsigned integer each -- divide the resulting benchmark time by 16 in order to have a rough estimate of time per operation. The integers are very large, so the results represent the worst case.

VarInt

VarInt encodes integers in blocks of 7 bits; the MSB is set for every byte but the last, in which it is cleared.

Signed values are first converted to an unsigned representation using zigzag encoding (also described on the page linked above), and then encoded as every other unsigned number.


lib.rs:

Fast serialization of integers.

This crate implements encoding and decoding of integer types to and from VarInt (encoding integers so that they only use as much memory as needed to represent their magnitude).

No runtime deps