Recent submissions

Comment · 1 year ago
Yep. It supports Python 3.11 now.
Comment · 1 year ago
Very interesting, thanks for the explanation!
Comment · 1 year ago
I'm curious about what makes this implementation faster than the alternatives.

Also, if you care about function call performance, I guess you'd use PyPy. Have you tried to run the benchmarks (with appropriate warmup) on PyPy to see if the results carry over?

Comment · 2 years ago
It's possible to maintain the "eclasses" without additional theoretical overhead. Associate a linked list with each representative, initially only containing the representative itself. When you union two representatives, concatenate their linked lists in constant time.
Comment · 4 years ago
In Go, the select branch to take is non-deterministically chosen from the set of enabled branches. For the examples I don't think it makes a difference, but in general you cannot assume that a select attempts to choose branches from top to bottom.
Comment · 5 years ago
Comment · 5 years ago
The Danish app gives the user two options. You can either show one that contains name and DOB or one that doesn't.

It's not clear (to me) when you are supposed to show the code with additional information, and I haven't been asked to do so.

Comment · 6 years ago
If it runs instantaneously, it would probably be a pretty cool effect to have the pointing fingers trace your cursor as it moves.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton