Who do you think is better at writing assembly? @harbard@fedia.io or a modern compiler with hundreds of contributors.

There are also react devs creating the windows 11 start menu.

No, the mirror reflects to the view finder untill you press the shutter, then it moves thr mirror to expose the photo sensor and then back.

If it’s a moving mirror camera* and it’s used to take stills it’s probably fine, as the sensor is only exposed for a fraction of a second per image.
If you want to film with it or put it in a phone, where it’s exposed all the time, it would certainly not be enough.

* I have no clue what they are called in english

At least be fair and cut out the .into()

The humble !! operator.

maybe we removed the last n characters

If you want to have a library that can also be a standalone executable, just put the main function in an extra file and don’t compile that file when using the library as a library.
You could also use the preprocessor to do it similar to python but please don’t.

Just use any build tool, and have two targets, one library and one executable:

LIB_SOURCES = tools.c, stuff.c, more.c
EXE_SOURCES = main.c, $LIB_SOURCES

Edit: added example

That boolean can indicate if it’s a fancy character, that way all ASCII characters are themselves but if the boolean is set it’s something else. We could take the other symbol from a page of codes to fit the users language.
Or we could let true mean that the character is larger, allowing us to transform all of unicode to a format consisting of 8 bits parts.

That requires some form of self describing format and will probably look like a sparse matrix in the end.

It might also introduce spurious data dependencies

Those need to be in the in smallest cache or a register anyway. If they are in registers, a modern, instruction reordering CPU will deal with that fine.

to store a bit you now need to also read the old value of the byte that it’s in.

Many architectures read the cache line on write-miss.

The only cases I can see, where byte sized bools seems better, are either using so few that all fit in one chache line anyways (in which case the performance will be great either way) or if you are repeatedly accessing a bitvector from multiple threads, in which case you should make sure that’s actually what you want to be doing.

C/C++ considers an nonzero number, as your true value but false is only zero. This would allow you to guard against going from true to false via bit flip but not false to true.
Other languages like rust define 0 to be false and 1 to be true and any other bit pattern to be invalid for bools.

You are supposed to run sudoedit.
This command creates a temporary copy, opens it in you editor of choice and overwrites the protected file when the temp file changes.
That way the editor doesn’t run as root.
You can see the difference if you run shell command, like whoami, in vim.

Ups, my attention got trapped by the code and I didn’t properly read the comment.

Now do computation in those threads and realize that they all wait on the GIL giving you single core performance on computation and multi threaded performance on io.

2 happened

Create a table of checkboxes with the rule 110 CSS applied.
Translate your program to a rule 110 program and put it in the top row of the table.
Advance the computation by checking the marked (orange in the example) checkboxes row by row.

Example

This, unfortunately, means that semicolons are often inserted in places where you were not expecting them

example:

()=>{
  return {k:"v"}; // returns the object
}
()=>{
  return      // returns undefined 
    {k:"v"};  // unreachable 
}

so the advice is to always include them manually yourself so that you are never unpleasantly surprised.

The example will be unpleasantly surprising, no matter where you put semicolons.

https://xkcd.com/1718