Skip to content

Try to use sparse bit sets / matrixes for denser storage #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
eddyb opened this issue Aug 21, 2018 · 0 comments
Open

Try to use sparse bit sets / matrixes for denser storage #9

eddyb opened this issue Aug 21, 2018 · 0 comments
Labels
enhancement New feature or request

Comments

@eddyb
Copy link
Member

eddyb commented Aug 21, 2018

See rust-lang/rust#47575 (comment) for my old implementation.
A generalized SparseBitMatrix<Row, Column> could allow "Row" to be anything, with the "Column" remaining restricted to a "newtyped index" (integer), by having the representation:

BTreeMap<(Row, u32 /*high column bits*/), u128 /*low column bitset*/>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@eddyb