开发者

Over the weekend, I attended an event hosted by Cursor Kenya, bringing together developers, builders,...

Cake is still welcome. submitted by /u/Adept_Signature3352 [link] [留言]

Introduction Last week I was at Vueconf US. It's one of my favorite conferences and I try...

Your growth targets went up. Your team size didn’t. Maybe it even went down. Meanwhile, the...

https://thebrowser.com/r/9bf16d80?m=c6bf87ab-387d-49ae-9584-...

I've had 3 weeks off work and I've used the time to rekindle my passion for coding (the old way, by hand). Stumbled upon this alternative to consistent hashing called rendezvous hashing (or highest random weight) and did a little deep dive. It ended up turning into a basic library, including the basic algorithm, a couple of variations, and the skeleton pattern for O(log n) access. It performs similar to ExHashRing for node counts <20, and with the skeleton optimization is competitive even in the tens of thousands of nodes, but it uses no NIFs or stateful processes, and the basic algorithm is essentially a one-liner. Anyway, it was fun to learn about, hope you enjoy it too! https://jola.dev/posts/highest-random-weight-in-elixir submitted by /u/joladev [link] [留言]