I'm not sure which yield() you mean, but I don't think anything in particular gets compiled to pause on its own.

Not necessarily, this OCaml code is guaranteed to recurse forever. let rec loop x = Printf.printf "%i\n" x; loop (x - 1)

Recursion doesn't need a stack.

It depends, you can do more in a team, but it also adds an overhead.

boost::asio::signal_set automatically handles all of this. I added a section on this.

Good one.

No, I mean something like JOIN ON a > b or JOIN ON a <> b

I'm asking, because (at least in theory) in Postgres JOIN condition can be any expression yielding boolean. I haven't used any other expression that =.

Thanks, I didn't know about this.

Dunno, I think that's an easier job.

I don't think I like sqlalchemy, it looks even more complex than sql (not that I like SQL).

In C++ at least no-one is pretending C++ is simple. It's much more complex language, sure. But in exchange you get features that are plain impossible in C. E.g. look at string handling - much easier to

Oh, I definitely want to hear how you use it. Any important config adjustments? Any other tips? For now I know about WAL mode. Have you used anything like livestream? I'm using sqlite for hive-adventures.

I don't really understand. If you use sqlite you can back it up just as easily, no?

Yes, fizzbuzz. NOP are there for correct alignment, though I did not validate that it's OK. It's much harder to validate it in OCaml than in C.

The owl logo reminds me of SWI Prolog logo lol

The word "secrets" misled me I guess.

I don't know how pyenv works, but I assumed it contains some secrets. Secrets is plain text are not very secure.

I wouldn't call it the right way unless it's encrypted.

We are not Solana after all. Can you elaborate on that? What's up with Solana?