Opened 2 years ago

Closed 2 years ago

Last modified 2 years ago

#30597 closed enhancement (fixed)

Define a sparse bitset structure

Reported by: gh-kliem Owned by:
Priority: major Milestone: sage-9.2
Component: cython Keywords: sparse bitset
Cc: Travis Scrimshaw Merged in:
Authors: Jonathan Kliem Reviewers: Travis Scrimshaw
Report Upstream: N/A Work issues:
Branch: 9d3ebc7 (Commits, GitHub, GitLab) Commit: 9d3ebc763f05e6e4768ea026a16d90d21cd9b5b3
Dependencies: #30572, #30596 Stopgaps:

Status badges

Description (last modified by Travis Scrimshaw)

This structure is a copy of bitset_t for now and at the moment mainly illustrates that the entire setup with a fused type in biteset.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.

Change History (7)

comment:1 Changed 2 years ago by git

Commit: 2f2b73f5d7f285b6c006a1acce4dd407ce11f0689d3ebc763f05e6e4768ea026a16d90d21cd9b5b3

Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:

9d3ebc7define sparse_bitset_t

comment:2 Changed 2 years ago by gh-kliem

Cc: Travis Scrimshaw added
Status: newneeds_review

comment:3 Changed 2 years ago by gh-kliem

Milestone: sage-9.2sage-9.3

comment:4 Changed 2 years ago by Travis Scrimshaw

Description: modified (diff)
Reviewers: Travis Scrimshaw
Status: needs_reviewpositive_review

LGTM.

comment:5 Changed 2 years ago by gh-kliem

Thank you.

comment:6 Changed 2 years ago by Volker Braun

Branch: u/gh-kliem/sparse_bitsets_via_fuzed_types9d3ebc763f05e6e4768ea026a16d90d21cd9b5b3
Resolution: fixed
Status: positive_reviewclosed

comment:7 Changed 2 years ago by Matthias Köppe

Milestone: sage-9.3sage-9.2
Note: See TracTickets for help on using tickets.