I’ve used it a fair amount for memory mapped IO where the hardware defined bitfields. It is also useful when you have a data format with bitfields. I’d say it is also useful when your data does not respect byte boundaries, but the only time I’ve run into that involved the bit order being “backwards”, which means that I still had to bittwidle things back together.

From a performance perspective, a cache line is only 64 bytes. Space in registers, low level memory caches, and memory throughout are all limited as well.

You lost me at return oriented programming. Getting something working out of that is way more difficult than doing it out of vib coding. (Way more impressive though)

Interested to see how this plays out.

Prohibiting Holocaust denial is relatively easy, because we have the benefit of it being history, and we have an ample historical record and a clear consensus among historians. Plus, no one can credibly claim that the legislatures were not thinking of the Holocaust when they wrote the law.

However, how are they planning on applying the law to contemporary international crimes? People make accusations of them all the time. And the other side always denied them. And the actual facts are generally obscured by a massive fog of war that can take years to see through, if ever.

There is also plenty of history where the answer is less clear. Do we really want courts involved in determining if the 15th century conquest of the Canary Islands counts as a genocide. Or if some unnamed mass grave an archeologists unearths was caused by an invading army killing all of a city’s adult males, or simply a burial site for fallen soldiers?

What about the book of Esther. Taken literally, it ends with what is arguably a genocide committed by the Jews against the Persians. However, outside of some Israeli hardliners reinterpreting that ending for contemporary political purposes, it is widely understood that that ending is a literary device, not a literal telling of events. Did my Hebrew school teachers violate this law when they told me we didn’t actually kill 75,000 Persians? [0].

What about the ongoing genocide against white Afrikaners going on in South Africa today? Am I violating the law when I say that genocide is not real, and just something the rightwing in the US invented for domestic political purposes. If the US has such a law, could Trump use it to jail his political opponents who criticized his recent stunt of accepting 60 Afrikaner refugees?

Do we defer to an international body like the ICC or ICJ? In that case, you have just outlawed disagreeing with those bodies.

The UN has repeatedly found it to be a massive human rights violation. Does disagreeing with those findings violate this new law?

[0] As an aside, secular historians generally consider all of Esther to be fiction.

According to the bill, denial of the Holocaust or other serious international crimes, such as those defined under the statutes of the International Criminal Court, would be punishable by a fine or a prison sentence of up to two years.

https://www.helsinkitimes.fi/finland/finland-news/domestic/26868-finland-moves-to-ban-holocaust-denial-under-new-criminal-law.html

The left had a Joe Rogan. His name was Joe Rogan.

4% is widely used as a safe withdrawal rate. It’s based on modelling with historical data of market returns and achieving a near 100% probability of not drawing down your principle over the long term.

I think the image assumes that the viewer is familiar with merge sort, which is something you will learn in basically every undegraduate CS program, then never use.

To answer your first question, it helps to have something to compare it against. I think the most obvious way of sorting a list would be “insertion sort”, where you look through the unsorted list, find the smallest element, put that in the sorted list, then repeat for the second smallest element. If the list has N elements, this requires you to loop through it N times. Since every loop involves looking at N elements, this means you end up taking N * N time to sort the list.

With merge sort, the critical observation is that if you have 2 sublists that are sorted you know the smallest element is at the start of one of the two input lists, so you can skip the inner loop where you would search for the smallest element. The means that each layer in merge sort takes only about N operations. However, each layer halves the number of lists, so you only need about log_2(N) layers, so the entire sort can be done in around N * log(N) time.

Since NlogN is smaller then N^2, this makes merge sort theoretically better.

So, your mom is OK with gay sex, and recognizes trans people as being their chosen gender? How progressive!

The owners of Twitter made him go through with it, using the courts as the enforcement mechanism.