Viewing profile — attractivechaos

The best feature Bun delivered recently is portable binary. That portability is a huge deal to me as my users are often on ancient Linux distros. Thank you. Both node and deno requ…

See also: Static search trees: 40x faster than binary search - https://curiouscoding.nl/slides/p99-text/ - https://curiouscoding.nl/posts/static-search-tree/ - https://news.ycombin…

In the age of AI, thinking becomes a privilege.

Their C compiler project proves the opposite.

Yeah, I was expecting performance benchmarks, detailed feature comparisons, analysis of binary/extension compatibility, etc.

On the contrary, the key message from the blog post is not to load the entire dataset to RAM unless necessary. The trick is to stream when the pattern works. This is how our field …

First of all, as khuey pointed out, the current implementation accumulates values. extend() replaces values instead. It wouldn't achieve the same functionality. I tried extend() an…

These three and boost are all based on swiss tables. They are indeed more robust than plain linear probing. khashl is the only one here using basic linear probing. Without salting,…

Exactly. And khashl uses Fibonacci hashing. Without salting, it has the same problem.

I am not sure how "long term" you are thinking about. Making big architectural changes does not necessarily lead to better performance. JSC has been the fastest JS engine in the pa…

I have been thinking what talent means in programming and thought of a case in the past. The task was to parse a text file format. One programmer used ~1000 lines of code (LOC) wit…

This doesn't explain why so few people of Fabrice's generation have reached his level. Think about violin playing. Many players can become professionals if they have the obsession,…

You can call 1000 averaged programmers and see if they can write MicroQuickJS using the same amount of time, or call one averaged programmer and see if he/she can write MicroQuickJ…

> Is there a compiler-autograd "library"? Do you mean the method theano is using? Anyway, the performance bottleneck often lies in matrix multiplication or 2D-CNN (which can be red…

Even if getHeaders() has security/performance concerns, the better solution is to make it an alias to the newer headers.get() in this case. Keeping the old API is a small hassle to…

This is a smart implementation of Robin Hood hashing I am not aware of. In my understanding, a standard implementation keeps the probe length of each entry. This one avoids that du…

> But you only need about 5% of the concepts in that comment to be productive in Rust. The similar argument against C++ is applicable here: another programmer may be using 10% (or …

FASTA was invented in late 1980s. At that time, unix tools often limited line length. Even in early 2000s, some unix tools (on AIX as I remember) still had this limit.

> Another thing is human readable is typically synonymous with unindexed Indexing is not directly related to binary vs text. Many text formats in bioinformatics are indexed and man…

> human-readable files are ridiculously inefficient on every axis you can think of (space, parsing, searching, processing, etc.). In bioinformatics, most large text files are gzip'…

For linked lists and binary trees, intrusive data structures are better. > Well, except the first one, template macros, where I can’t really find any pro, only cons. For toy exampl…