QuaternionsBhop

Plus it's limited to 65k entries. Perhaps a btree where parent nodes sum the weights of child nodes would work well. Using the input hash scaled by total weight, a binary search lookup would compute the partial sums for comparison on the fly. Adding/removing a node would only update the ~8 parents when the btree order is 4. Eytzinger layout and struct-of-arrays could be used to improve cache locality during lookup. This does mean an add/remove could drastically change the overall mapping, perhaps that's why consistent hashing is used instead.

There are two types of programmers: the pragmatists who see programming as a chore and would gladly never write a line of code again given the right tools, and the gardeners who don't want their enjoyable and rewarding garden-tending work taken away from them.

This is mentioned in the article. Your mistake is that you've assumed that the intelligence has an innate survival instinct, or an aversion to "harm", which is simply not guaranteed for something not honed by millions of years of evolution.

This would also mean that you wouldn't need unsafe{} to call into the Fil-C ffi. The majority of unsafe{} in (non pure-rust) cargo dependencies is calling C ffi. Rust + Fil-C is a great match that fills a particular niche, I'd love to see it happen.

I've always thought this was a cool idea. It's obviously been on the minds of Wayland protocol developers since the beginning, otherwise it wouldn't be possible!

Jokes require mutual context. You failed to create a joke because you did not ensure the prerequisites were met.

Is pasting em-dashes everywhere some kind of inside joke?

Minecraft (and Java) just runs great on Linux. I've personally experienced a 30% performance improvement from Windows.

I was not affected

Elon flees to Mars*

I recently wrote klondike in Rust after getting frustrated with bugs in my friend's LLM-written version. I highly recommend it as a recreational programming exercise, the first 4 hour blitz filling out the types was a blast. Later, trying to make as many invalid moves unexpressable by the given types as possible was a fun challenge. I ended up with a 232 byte struct for the board state with all values stack-allocated. The only way to make it considerably smaller would probably be to encode card permutations.

This is great news for nvidia users on Linux. It means that they don't need to install a VAAPI compatibility tool like nvidia-vaapi-driver. I also hope to see Vulkan Video supported in the open source userspace nvidia driver NVK soon too.

Base conversions are easy, but which off by one is it? base 4 or base 6?

This comment is AI, presumably AI translated

No, I believe it's futex_waitv