#integer #integer-compression #compression #bit-level #array #range #growable

yanked packed-integers

A growable array for integer types in the range u1 to u31

3 unstable releases

0.2.0 Sep 4, 2023
0.1.2 Nov 5, 2020
0.1.1 Nov 5, 2020
0.1.0 Nov 5, 2020

#1554 in Data structures

Download history 38/week @ 2024-07-02

150 downloads per month

MIT license

27KB
547 lines

packed-integers

packed_integers provides a growable array for integer types in the range u1 to u31.

Use case

Assume you have a sequence of unsigned integers in the range [0, 100000] that you would like to hold in memory. That range of values can be represented using 17 bits per integer, since 217 - 1 = 131071. As Rust has no u17 type, you would typically store these values in a u32 array, wasting 15 bits per integer.

packed-integers helps alleviate this issue by packing these integers at the bit level, essentially trading time for space.

API

Where possible, packed-integers mimics the API for Rust's Vec in order to provide a set of methods you're probably already familiar with.

Inspiration / Resources


lib.rs:

packed_integers provides a growable array for integer types in the range u1 to u31.

Use case

Assume you have a sequence of unsigned integers in the range [0, 100000] that you would like to hold in memory. That range of values can be represented using 17 bits per integer, since 217 - 1 = 131071. As Rust has no u17 type, you would typically store these values in a u32 array, wasting 15 bits per integer.

packed_integers helps alleviate this issue by packing these integers at the bit level, essentially trading time for space.

API

Where possible, packed_integers mimics the API for Rust's Vec in order to provide a set of methods you're probably already familiar with.

No runtime deps