judofyr

8 ms·

31.
by judofyr 1y ago
> … but it seems like the judge simply doesn't get the objections. And the reasoning is really strange The full order is linked in the article: https://cdn.arstechnica.net/wp-content/uploads/2025/06&#x
32.
by judofyr 1y ago
Yes! We’re in absolute agreement here! That’s why I said «most situations» and not «all situations».
33.
by judofyr 1y ago
In most situations panicking and deferencing a null pointer leads to the exact same scenario: The binary crashes. You can unwind and catch panics in Rust, but I’m not sure if that would have helped in this scenario as it might have immedi
34.
by judofyr 1y ago
Here’s a quite recent interesting paper about this: https://dl.acm.org/doi/abs/10.1145/3643027 > In this article, we study the convergence of datalog when it is interpreted over an arbitrary semiring. We c
35.
by judofyr 1y ago
Boomph is a Rust re-implementation of BBHash which is included (and dominated by three other implementations). AFAIK there’s no reason to think it would perform any better than BBHash.
36.
by judofyr 1y ago
See also: https://www.tumblr.com/accidentallyquadratic Quadratic complexity sits in an awkward sweet spot: Fast enough for medium-sized n to pass first QA, but doomed to fail eventually as n grows.
37.
by judofyr 1y ago
13% mentioned that error handling was the biggest challenge with using Go. This was not a multiple choice question, but you had to pick one answer. We don't know how many people would consider it challenging. (This is typically why
38.
by judofyr 1y ago
From the article: > It marks a piece of code to be treated as data (to be sent to the client). > This means that whoever imports onClick from the backend code won’t get an actual onClick function—instead, they’ll get '/js&#x
39.
by judofyr 2y ago
Oh, wow! Huge respect for this comment. Thank you! This is really cool to hear about.
40.
by judofyr 2y ago
You're kinda proving my point here by using such loaded terms. You've chosen the term "preachy" (a negative word) to describe people who are excited about advancements in programming languages (e.g. borrow checker, power
41.
by judofyr 2y ago
> I've never seen a language that doesn't have bad things to say about other languages. That's why I said "communities" and not "languages". Every programming language has a wide set of people who use i
42.
by judofyr 2y ago
> People who "figured out" Zig tend to be fiercely loyal to the language in a similar way as Rust evangelists to Rust. This is very much not productive and you’re now part of spreding this narrative. There’s plenty of people
43.
by judofyr 2y ago
> Okay, first off, everybody breathe. Everyone is freaking out. This is not the way to do this. Why are you doing it this way then?
44.
by judofyr 2y ago
Yes? Imagine a bug where iMessages are leaked over Bluetooth when a user has installed an application that integrates with some watch brand. Bring this to an airport and you can steal hundreds/thousands of messages from a wide range of
45.
by judofyr 2y ago
Are you referring to the double-slit experiment? If so, yes: It has always been an experiment . The experiment came before any theory explaining the behavior AFAIK. https://en.m.wikipedia.org/wiki/Double-slit_experimen
46.
by judofyr 2y ago
You should check out Height-Oriented Tries as well. Their benchmarks shows that it outperforms both ART and masstree. EDIT: Oops, yes, I meant Height-Optimized Trie! Sorry about that.
47.
by judofyr 2y ago
This is really good information! Thanks for writing it up. Honestly, I never actually "trust" the complexity analysis. Whenever I find a paper I immediately look for their specific results on an experiment, and if I can't fin
48.
by judofyr 2y ago
I can speak a bit about one of the approaches: "Practical Entropy-Compressed Rank/Select Dictionary" by Daisuke Okanohara and Kunihiko Sadakane. This presents two different variants: One for dense (i.e. more than 50% of the b
49.
by judofyr 2y ago
"Succinct data structure" does have a very strict definition which probably answers some of your questions: https://en.wikipedia.org/wiki/Succinct_data_structure . It's all about being close to the theore
50.
by judofyr 2y ago
Succinct data structures are very fun! If anyone is interested, I've implemented some of this in Zig: https://github.com/judofyr/zini . The main thing this implements is a minimal perfect hash function which uses l
51.
by judofyr 2y ago
Not quite sure what you're trying to say, but the MacBook Air 11" 2015 model supports macOS Monterey[1] which got a security update 6 months ago[2]. [1]: https://support.apple.com/en-us/103260 [2]: https:&#x
52.
Comparing the Performance of Hk and Lefthook(t.holmium.no)
2 points by judofyr 2y ago|0 comments
53.
by judofyr 2y ago
I'm sorry, but it's very hard to take this project seriously: You originally claimed that it was 1.5x faster than Lefthook, but then you removed the parallel support from the Lefthook ( https://github.com/jdx/h
54.
by judofyr 2y ago
> Could the Go solution add parallelism, sure. Did they? Not yet. They did: Lefthook lets you define a "group" where you can specify that every command should be done in parallel: https://lefthook.dev/configurat
55.
by judofyr 2y ago
> lefthook is written in go, hk is written in rust. This will make hk faster but the advanced parallelism logic in hk should make hk much faster. Because git hook managers are often limited not by their own logic but the speed of the com
56.
by judofyr 2y ago
(emphasis mine) > opposed to the idea of multiple implementations, which is plainly false , as evidenced by the link to the official blog post celebrating gccrs. Ted T'so is speaking from ignorance here. Why use so strong words?
57.
by judofyr 2y ago
> "which is actively hostile to a second Rust compiler implementation" - except that isn't true? Historically the Rust community has been extremely hostile towards gccrs. Many have claimed that the work would be detrimenta
58.
by judofyr 2y ago
> To rephrase: are these just array indexes, then? I mean I presume it's something cleverer than just "let's bit-pack our indexes to save space". The pointers can be dereferenced into an array index (when given the
59.
by judofyr 2y ago
I didn't invest a lot of time in it because when these papers show no practical applications I always assume that the constant factors are too high. Especially when there's also no specific values of the constant factors prese
60.
by judofyr 2y ago
The "compact dictionary" representation you're talking about not always using 64-bit numbers, but rather using log(n)-bit values when you have n entries (i.e. using 8-bit values when there's only <= 128 entries). The

More ›