attractivechaos

5 ms·

1.
by attractivechaos 5mo ago
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 require recent Linux, more exactly, recent glibc.
2.
by attractivechaos 5mo ago
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.yc
3.
by attractivechaos 7mo ago
In the age of AI, thinking becomes a privilege.
4.
by attractivechaos 8mo ago
Their C compiler project proves the opposite.
5.
by attractivechaos 8mo ago
Yeah, I was expecting performance benchmarks, detailed feature comparisons, analysis of binary/extension compatibility, etc.
6.
by attractivechaos 9mo ago
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 routinely works with files over 100GB.
7.
by attractivechaos 9mo ago
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() anyway. It didn't work well. Based on your descripti
8.
by attractivechaos 9mo ago
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, its curve is through the roof, much worse than swiss tables
9.
by attractivechaos 9mo ago
Exactly. And khashl uses Fibonacci hashing. Without salting, it has the same problem.
10.
by attractivechaos 9mo ago
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 past 5-10 years as I remember. If google had a solut
11.
Lessons from Hash Table Merging(gist.github.com)
85 points by attractivechaos 9mo ago|21 comments
12.
by attractivechaos 9mo ago
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) with complex logic. The other used <200 LOC with a straightf
13.
by attractivechaos 9mo ago
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, but 99% of them won't reach the Heifetz&#x2F
14.
by attractivechaos 9mo ago
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 MicroQuickJS to the same quality in his/her life time. 10X, 1
15.
by attractivechaos 9mo ago
> 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 reduced to matmul). Compiler autograd wouldn&#x2
16.
by attractivechaos 10mo ago
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 a handful of developers but breaking existing code put
17.
by attractivechaos 10mo ago
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 due to its extra constraints. I don't quite understand th
18.
by attractivechaos 10mo ago
> 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 a different 5%) of the concepts. You will have to learn
19.
by attractivechaos 1y ago
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.
20.
by attractivechaos 1y ago
> 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 many binary formats are not when they are not designed wit
21.
by attractivechaos 1y ago
> 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'd. Decompression is a few times slower than proper
22.
by attractivechaos 2y ago
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 examples, the first (expanding a huge macro) has mostly cons.
23.
by attractivechaos 2y ago
The title sounds like this is a standalone allocator, but the implementation seems to handle thread-local storage only. The hard work is done elsewhere.
24.
by attractivechaos 2y ago
The hardware may be ten million times faster, but the software...
25.
by attractivechaos 2y ago
You are sincere. I believe this is not a cover-up but more of a misunderstanding. Think this way: many people coming to that github thread don't know who are core rust devs but they can clearly see the second commenter is involved. Tha
26.
by attractivechaos 2y ago
Thanks for the clarification. This has given me more confidence in rust's future.
27.
by attractivechaos 2y ago
Maintaining backward compatibility is hard. I am sympathetic. Nonetheless, if the rust dev team think this is a big deal, then clarify in release notes, write a blog post and make a commitment that regression at this level won't happen
28.
by attractivechaos 2y ago
I was hit by a similar thing. Rust once caused regression failures in 5000+ packages due to incompatibility with older "time" packages [1]. It was considered okay. At that point, I don't care what they say about semver. [1]:
29.
by attractivechaos 2y ago
I wonder what prompt they use. Before asking DeekSeek – is there a good post/video that walks through this procedure?
30.
by attractivechaos 2y ago
> Truffle Ruby is as fast as V8 already and MRI yJIT and jRuby are catching up fast According to which benchmark? At my hand [1], node is ~60% faster than TruffleRuby and over an order of magnitude faster than yjit v3.3.0. [1] https:&

More ›