Top 9 Bqn Open-Source Projects

BQN

49 831 8.9 KakouneScript

An APL-like programming language. Self-hosted!

Project mention: Bare minimum atw-style K interpreter for learning purposes | news.ycombinator.com | 2024-01-17

I recommend checking BQN at https://mlochbaum.github.io/BQN/ and the YouTube channel code_report by Conor Hoekstra (and also "Composition Intuition by Conor Hoekstra | Lambda Days 2023"). It is well documented.

CBQN

4 293 9.5 C

a BQN implementation in C

Project mention: Building a faster hash table for high performance SQL joins | news.ycombinator.com | 2023-12-20

Worth pointing out that this can depend a lot more on fiddly details than you might expect. In particular, you're dealing with a small fixed width allowing the hash to be stored in the table instead of the key. The article emphasizes variable-length keys, and I don't see any specialization on key sizes (if 4- and 8-byte keys aren't common then this makes sense; if they are then I'd expect dedicated table code for those sizes to be valuable). And set lookups are also just a bit different from value lookups. I think these cases are different enough that I have no idea if the results would carry over, although I can see how the bidirectional approach would reduce probing more than RH which seems good.
...and since I've done a lot of work with Robin Hood on small-key lookups, I can point out some little tweaks that have made a big difference for me. I have 8-byte lookups at just over 3ns/lookup[0], albeit at a very low load factor, typically <50%. A key step was to use the maximum possible hash as a sentinel value, handling it specially in case it shows up in the data. This way, instead of probing until finding an empty bucket or greater hash, probing just finds the first slot that's greater than or equal to the requested key's hash. So the lookup code[1] is very simple (the rest, not so much). The while loop is only needed on a hash collision, so at a low load factor a lookup is effectively branchless. However, these choices are specialized for a batched search where the number of insertions never has to be higher than the number of searches, and all the insertions can be done first. And focused on small-ish (under a million entries) tables.
[0] https://mlochbaum.github.io/bencharray/pages/search.html
[1] https://github.com/dzaima/CBQN/blob/5c7ab3f/src/singeli/src/...

InfluxDB

www.influxdata.com sponsored

Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Singeli

7 92 9.1 C

High-level interface for low-level programming

Project mention: Singeli: High-level interface for low-level programming | news.ycombinator.com | 2024-02-27

bqn-libs

1 45 6.9

Informal collection of BQN utilities
rsbqn

1 33 10.0 Rust

An embeddable BQN virtual machine in rust. Stay tuned!
bqnpad

2 29 2.2 TypeScript

Online REPL for BQN
rayed-bqn

1 25 9.7 PowerShell

Raylib with a bit of bacon spice!

Project mention: Rayed BQN: a game framework ported to an APL-like language | news.ycombinator.com | 2023-12-15

WorkOS

workos.com sponsored

The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
BQNoise

1 15 3.7 C

Audio library for BQN
aoc

1 4 5.2 APL

Advent of Code (by razetime)

NOTE: The open source projects on this list are ordered by number of github stars. The number of mentions indicates repo mentiontions in the last 12 Months or since we started tracking (Dec 2020).