TOtosh·Jun 6, 2026Submission
Performance: Unroll popcount reductions and add a NextClear fast path
2 points · Open discussionbits-and-blooms
bitset
Go2026–2026
bits-and-blooms / bitset
bitset
Go package implementing bitsets
2Distinct people
2Mentions
0Explicit recommenders
1.5KGitHub stars
What to know before exploring
What it is
Go package implementing bitsets
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by week2 dated mentions
Observed mentions: 2026-03-09 22:15:03 UTC to 2026-06-06 09:13:59 UTC. Weeks start Monday, UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Mar 9 | 2026-03-09 00:00:00 UTC | 2026-03-16 00:00:00 UTC | 1 | 0 | 1 |
| Mar 16 | 2026-03-16 00:00:00 UTC | 2026-03-23 00:00:00 UTC | 0 | 0 | 0 |
| Mar 23 | 2026-03-23 00:00:00 UTC | 2026-03-30 00:00:00 UTC | 0 | 0 | 0 |
| Mar 30 | 2026-03-30 00:00:00 UTC | 2026-04-06 00:00:00 UTC | 0 | 0 | 0 |
| Apr 6 | 2026-04-06 00:00:00 UTC | 2026-04-13 00:00:00 UTC | 0 | 0 | 0 |
| Apr 13 | 2026-04-13 00:00:00 UTC | 2026-04-20 00:00:00 UTC | 0 | 0 | 0 |
| Apr 20 | 2026-04-20 00:00:00 UTC | 2026-04-27 00:00:00 UTC | 0 | 0 | 0 |
| Apr 27 | 2026-04-27 00:00:00 UTC | 2026-05-04 00:00:00 UTC | 0 | 0 | 0 |
| May 4 | 2026-05-04 00:00:00 UTC | 2026-05-11 00:00:00 UTC | 0 | 0 | 0 |
| May 11 | 2026-05-11 00:00:00 UTC | 2026-05-18 00:00:00 UTC | 0 | 0 | 0 |
| May 18 | 2026-05-18 00:00:00 UTC | 2026-05-25 00:00:00 UTC | 0 | 0 | 0 |
| May 25 | 2026-05-25 00:00:00 UTC | 2026-06-01 00:00:00 UTC | 0 | 0 | 0 |
| Jun 1 | 2026-06-01 00:00:00 UTC | 2026-06-08 00:00:00 UTC | 1 | 1 | 0 |
What Hacker News says
2 sources> I did a wfc implementation a while back and moved to bitfields after a while.. the speedup was incredible.
Yeah, my WFC bot (which happens to generate Carcassonne maps in an amusing coincidence) eventually ended up using https://github.com/bits-and-blooms/bitset which improved things hugely.
> It became faster to just recompute a chunk from scratch
Kinda what mine does - every now and again[0] it stacks the current state and if it gets stuck, just pops the last one and continues from there.
[0] Just checked and it's every `tileCount / 20` iterations, hilariously in a variable named `tenper`. I hate past me.
In Building a Procedural Hex Map with Wave Function Collapse