Gerrit uses a “Change-Id” trailer with a unique value. When you “fix up” a commit, the commit SHA changes but the change id remains the same. That’s how it can identify different commits with the same change id as patchsets of the same change.
This is based on what I remember (haven’t used gerrit in a while), so it may not be accurate.
I used gerrit in my previous job and miss using it. Would definitely prefer it over GitHub which is more popular (and convenient of course, can’t deny that).
Your understanding of the Change-Id footer sounds like it matches mine.
I’d note that it works that way presently, but the teams behind git, gerrit, jj-vcs, and a couple of other relevant stakeholders have an email thread going in which, from what I understand, they discuss standardizing on the approach taken by jj-vcs:
Here's a guy playing with a supercritical CO2 pressure vessel on a table (seems a little brave to be shaking something at such high pressures!) https://www.youtube.com/watch?v=2d7RGQMCX24
Agreed to everything in the first paragraph - second isn't something I can speak to as a Canadian. Came back to say you forgot the boom-bust cycle and the constant layoffs that come with it. Would like to reiterate on the stress and (corresponding) responsibility too, with again, the low pay not helping.
Can't say how glad I am to be out of aviation. I will say that it can play well on dating apps though - it can be dressed up to look very nice
There is a Help->Rules link on all of the puzzles linked here. It can be a little tricky to decipher them if you're coming to them completely brand new, however. I mostly use them as a refresher.
One of the features of PREEMPT_RT is that it converts interrupt handlers to running in their own threads (with some exceptions, I believe), instead of being tacked on top of whatever thread context was active at the time like with the softirq approach the "normal" kernel uses. This allows the scheduler to better decide what should run (e.g. your RT process rather than serving interrupts for downloading cat pictures).
I actually had a concurrency bug that I was able to capture with rr: an MPI job where I only ran rr on rank 0 and managed to figure out where a different send/recv ordering was causing issues. In fact, it was also a Python model that ties in with a lot of native code generation, so quite a complex issue.
I thought it might work a little like the NYT sudoku app: placed numbers delete candidate notes automatically, but you can also manually toggle candidates on/off. I guess a once-off generation would probably work to achieve this?
What is the backend for the storage buckets we see in cloud (and increasingly, HPC) computing? Seems like a database filesystem would be a good fit there.
MinIO has millions of installations according to the documentation. If this is the building block in your favorite cloud is mostly hidden and unknown to users.
