Recent submissions

Comment · 3 months ago
Or cloudformation, if it is just for AWS anyhow.
Comment · 3 months ago
Locality is a property of how data is arranged, so it's a property of the data structure, no?
Comment · 8 months ago
KD-trees select their splits according to the contained points. That tends to make them better for static sets of points, but updates become expensive. Quadtrees are often used in e.g. physics engines.
Comment · 9 months ago
Some patterns must happen to repeat, so I would assume the offset to be larger, no?
Comment · 11 months ago
You might be interested in https://connectrpc.com/. It's basically what you describe, though it's not clear to me how well supported it is.
Comment · 1 year ago
It doesn't help that URLs are badly designed. It's a mix of left- and rightmost significant notation, so the most significant part is in the middle of the URL and hard to spot for someone non-technical.

Really we should be going to com.ycombinator.news/item?id=45789474 instead.

Comment · 1 year ago
Comment · 1 year ago
I overall agree with the article; GitOps is great for managing long-lived, shared, stable systems you need a good audit trail for (like production), but testing isn't one of these. Test environments should ideally just be something non-shared you can just spin up and make changes to without asking for permission.
Comment · 1 year ago
I don't understand why features like S3's "downloader pays" isn't more widely used (and available outside AWS). Let the inefficient consumer bear their own cost.

Major downside is that this would exclude people without access to payment networks, but maybe you could still have a rate-limited free option.

Comment · 1 year ago
You can condition IAM on Nitro attestation, so that's doable (if a lot more work than usual).
Comment · 1 year ago
Comment · 2 years ago
You can use a radix heap rather than a binary heap. I have an implementation here, with benchmarks using pathfinding: https://github.com/mpdn/radix-heap

It has the nice property that the amortized cost of pushing/popping an element is independent of the number of other elements in the heap.

Comment · 2 years ago
S3 recently got conditional writes and you can use do locking entirely in S3 - I don't think they are using this though. Must be too recent an addition.
Comment · 2 years ago
I think you could make by with some kind of async memory-touch system call, i.e. "page in this range of memory, notify me when finished". The application would have to call this on blocks of the mmap prior to actually reading it.

This of course means you lose some of the benefits of mmap (few system calls, automatic paging), but would maybe still be beneficial from a performance perspective.

Comment · 2 years ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton