Skip to content

Updated Bitfield implementation to use RangeSetBlaze instead of BTreeSet#9

Open
louisgregg wants to merge 1 commit intocowlicks:masterfrom
louisgregg:bitfield-lookup-efficiency
Open

Updated Bitfield implementation to use RangeSetBlaze instead of BTreeSet#9
louisgregg wants to merge 1 commit intocowlicks:masterfrom
louisgregg:bitfield-lookup-efficiency

Conversation

@louisgregg
Copy link

@louisgregg louisgregg commented Mar 3, 2026

This PR addresses issue #5

  • Using RangeSetBlaze instead of a BTreeSet in our Bitfield implementation should allow for more space efficient storage of hypercore chunk indices.
  • This may also provide faster inserts/lookups under some circumstances.
  • Added an additional unit test to check that set_range on DumbBitField behaves as intended when setting values to false.
  • Introduces dependancy on external range_set_blaze crate, where previously we only needed std::collections for the BTreeSet.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant