Hacker News new | ask | show | jobs
by icen 1184 days ago
Do you have any examples that come to mind of it being slow? My experience has been that I've been the slowest part of my code, by a long way.

Some optimisations aren't quite there (like under on higher rank arrays not being as fast as computing the indices on the flattened array), but everything else has been good.

1 comments

Notes from the creator on this subject: https://mlochbaum.github.io/BQN/implementation/perf.html

Abandoned half-finished rewrite of the BQN VM in Rust as is hipster tradition: https://github.com/cannadayr/rsbqn/