-
-
Notifications
You must be signed in to change notification settings - Fork 519
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.
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
Define a sparse bitset structure #30597
Labels
Milestone
Comments
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
This comment has been minimized.
This comment has been minimized.
comment:4
LGTM. |
Reviewer: Travis Scrimshaw |
comment:5
Thank you. |
Changed branch from u/gh-kliem/sparse_bitsets_via_fuzed_types to |
This was referenced Dec 13, 2020
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This structure is a copy of
bitset_t
for now and at the moment mainly illustrates that the entire setup with a fused type inbiteset.pxi
works.After combinatorial polyhedron uses this type for its atom-representation it should contain some additional information about which limbs are relevant. So it will increase slightly in memory usage, while still using constant memory (dependent on size). However, access to non-zero limbs will be improved.
Depends on #30572
Depends on #30596
CC: @tscrim
Component: cython
Keywords: sparse bitset
Author: Jonathan Kliem
Branch/Commit:
9d3ebc7
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/30597
The text was updated successfully, but these errors were encountered: