Viewing profile — tijsvd

From what I understand in the follow up: postgres uses shared memory for buffers. This shared memory is read by a new connection while locked. In postgres, connections are handled …

TLDR is that the full correct explanation is not simple. The Wikipedia article on lift makes a good effort. https://en.m.wikipedia.org/wiki/Lift_(force)

Of course you don't need a calendar library to measure 30 seconds. That's not the use case. Try adding one year to a timestamp because you're tracking someone's birthday. Or add on…

Everything that's visible to the compiler is subject to automatic inlining. That is all code in the current crate (compilation unit), all concrete instantiations of generics (regar…

> Get this, say a project takes a year to complete. The concept is saying a 10x engineer can do this in about month. The true 10x engineer looks at the project, sees the inherent n…

Would it not be feasible to turn electron inside out, and have chromium as a library, with bindings for various languages?

Never combine new tech with new functionality. If you want to learn new tech, use it to rewrite an old project that was due anyway. If you want to build new functionality, use tech…

You get the same with e.g. tokio::spawn, which runs the future concurrently and returns something that you can await and get the future's output. Or you can forget that something a…

Then the app relies purely on the ssl cert of the server, for mitm mitigation. This way, the qr can contain a signed reply to the code, which adds a layer.

Apart from CGAT being a 2-bit alphabet, changing the alphabet does not change the information density. Expect that this kind of transformation has no impact on the compressed resul…

First, this is about data access and not programming. Second, that quote is from a time when compiler optimizations did not exist, and the programmer was supposed to use all kinds …

It's the field of information theory. https://en.m.wikipedia.org/wiki/Information_theory

Take incrementing int32. Extend to 64 bits. Multiply by large prime number (e.g. fnv32 prime). Mod 1 million. Add 1 million. End up with random looking, 7 digits, nicely sequenced,…

What do you use then that has the same order as rows becoming visible? We use an auto-increment id, and lock inserts on the related account (which always limits the scope of the qu…

The callback is really hard to implement without allocating memory for each wakeup. The poll mechanism can simply leave the task in place. I suspect the poll thing is also easier t…

I was generally OK with the speed of Prost, and making it faster was not the goal really. The goal was to make the generated code more Rust-friendly. It is probably faster due to s…

Thanks for that link. The article links to another article with more background: https://blog.cloudflare.com/lavarand-in-production-the-nitty... Which answers all your questions. T…

Does Rust's `:b` formatter always print leading zeroes? Otherwise the code will not only be inefficient, but wrong for half the input space. Or perhaps that was the original goal, …

IIRC (many years since I used windows), the New context menu on windows is fed from a directory with templates, and you can add to it.

With 2 children, there are 4 configurations of equal probability. The one with 1 boy 1 girl occurs twice. Take away the 2 girl case, then 2 boys is 1 in 3.

Does that mean that every nested coroutine (async call) needs another heap allocation, or just the top level one?

> And from what I've read they are better than Rusts coroutines for this use case Reference please? In what sense are they better, and what makes them better?

Nah, it doesn't matter if you do (prev + 1) % len, or (prev % len) + 1. Hash tables matter more though.

No I don't work for Blizzard. When I did this, we were using a very fast custom wire format, but entirely hand-coded. Say flatbuffers without the code generation part. And having m…