Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

How to use this most efficiently?

Open
#45 3 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
javascript
Domain
data

Research direction

No file, test, or entry point is named. Start by locating the BitSet data-array representation and the API for constructing or sizing a set, then determine whether storage can be selected or compacted for 214 bits. Done would mean a documented, supported way to use the requested lower-overhead representation, or a clear explanation of the current limitation.

Written by the indexing model from the issue text.

Description

Hi,

I want to store 214 bits in a BitSet.
When i do that it's data array is 10 elements. That's 10x 32bit int (320 bit).
Ideally it would use the bare minimum in bit overhead. If that were to be done in 32 bit ints then 7 ints (224 bit) would suffice.
More ideal would be an array of chars (8 bit each) where i'd need 27 chars giving me 216 bits of room.

Are there arguments i can set in this class to get that more ideal behavior (ints or chars, both work)?

Dominant language
JavaScript
Stars
238
Forks
31
PR merge metrics
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from rawify/BitSet.js

All issues in rawify/BitSet.js

Similar issues

More JavaScript issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.