euiq

You can do safe parametrization with PREPARE, you don't need CREATE FUNCTION. Don't most PostgreSQL libraries handle such concerns for you, anyway?

Pi already emits good errors messages; I always see Claude Opus 4.8 correct itself in its next attempt when it gets a tool call wrong.

`uv.lock` pins exact versions (and hashes) of your dependencies.

General Topology is valuable, especially for the filter perspective; so are some of the Algebra volumes.

I know that `git rebase` changes the committer date while keeping the author date the same, so I'm assuming something similar happened here. For example, many of the early commits have this committer date with varying author dates:

    $ git show --format=fuller 3dafc8f5de6ffe46fb223a75a46a6bd848b6daf8
    commit 3dafc8f5de6ffe46fb223a75a46a6bd848b6daf8
    Author:     Kenton Varda <[email protected]>
    AuthorDate: Thu Feb 27 17:15:37 2025 -0600
    Commit:     Kenton Varda <[email protected]>
    CommitDate: Tue Mar 4 14:48:59 2025 -0600
    
        Add storage schema by Claude.

GitHub uses the committer date for its history, which is annoying if you rebase frequently; I like to run a non-interactive `git rebase` with `--commmiter-date-is-author-date` in such cases.

let me guess: you haven't read the article, have you?

He’s built up an impressive amount of clout over a short period of time, mostly by interviewing interesting guests on his podcast while not boring listeners to death (unlike a certain other interviewer with high-caliber guests that shall remain nameless).

I agree that “/usr/sbin directory becomes a symlink to bin” can be confusing for new users, but I don’t think it’s wrong: I interpret this statement as saying that /usr/sbin is going to be a relative symlink with target bin, which would indeed make it resolve to /usr/bin.

It's a joke.

I assume they're talking about code like

    x
    |> f a
    |> g b
    …

… where everything after the first |> is essentially in point-free style.

Your posts are my favorite thing about Hacker News, both because of the things you're saying and the way you're saying them; please don't let anyone tell you otherwise.

This feels like a conversation where it would have been useful for the participants to be very explicit about the points they were trying to convey: the reviewer could have said "Isn't this a quadratic algorithm, because each call to `+=` reallocates `escaped_file_path`?" (or whatever their specific concern was; I may have misunderstood), and the author's initial response could have been "No, because the capacity of the string is doubled when necessary."

I don't think that "flickers between tasks very rapidly to simulate concurrency" is a good mental model for event loops. It's more like "runs one task at a time until it hits a suspension point," where a suspension point is something like an I/O operation. If you had an event loop that switched tasks between suspension points, then you'd still need locks for shared data.