I took the analogy to be about the location of the pressure and not the direction. If you allow pressure to build on the input pipe when you can't accept more, the component that is upstream in the flow is able to observe that and respond. Maybe the difference is I envisioned a series of pipes and not a single one.
You mean the culture of cutting funding from under performing schools to enforce a downward spiral and divert money to private schools? If not you should be more specific.
Let's say that each month I have an extra $1000. Should I use that money to pay down a 4% mortgage, or should I invest it in an index fund that is all but guaranteed to earn more than that?
Automated accessibility testing needs to be in your loop, whether you are using an llm or not. Aria labels are easy to get right but they are also easy to forget.
There are documented ways to ensure that changes are visible across threads (e.g. locks). If these are not used, the compiler is within its rights to not go out of its way to pull changes from another thread.
Right, it's pretty inevitable given the incentives. I think it's made worse by PE for a few reasons. They are investing with relatively short time horizons because they will need to sell to pay profits. So the long term health of the business is of no interest. If the reputation of the business suffers, that's someone else's problem. Compared to an individual investor who is looking long term, they need to retain customers and reputation.
It probably still sucks in C, but the C++ DX got a lot better. Importing the idl would generate wrapper functions that made calling code look much more like a normal function. It would check the hresult and return an out param from the function. They also introduced types like _variant_t that help boxing and unboxing native types. It still wasn't fun but it greatly reduced line count.
This is a community that values a high signal to noise ratio and generally eschews small talk, a la nohello.org. Congratulating someone for learning something does not advance the conversation.
It also has a low tolerance of what it perceives as reddit- style in-group signaling via repetition of a common meme (xkcd, in this case). Again noise vs signal but also suspicion of karma farming.
There's also the cultural context of Monty Hall being a real person who had a real game show, on which he really opened doors with goats behind them. Most readers of her column would have been familiar with the mechanics of the show. And the question doesn't really make sense if there's a chance that he opens the door with a prize, there's no more hidden information in that case.
The short answer is that there would still be tides without rotation, but with a period based on the lunar cycle. We have daily tidal effects, the moon can't do that by itself.
What's interesting is that Poe is not in the Altered Carbon book. The hotel was called the Hendrix and its avatar was Jimi the guitarist. They couldn't get image rights for the film, so had to change it. But i agree that atmospherically and thematically Poe is a better fit.
I've seen this in production C#. Same symptoms, process dump showed a corrupt dictionary. We thought we were using ConcurrentDictionary everywhere but this one came in from a library. We were using .net framework, IIRC .net core has code to detect concurrent modification. I don't know how they implement it but it could be as simple as a version counter.
It's odd he gets so hung up on npe being a critical ingredient when that doesn't appear to be present in the original manifestation. There's no reason to think you can't have a bug like this in C just because it doesn't support exceptions.
To me it's all about class invariants. In general, they don't hold while a mutator is executing and will only be restored at the end. Executing another mutator before the invariants are reestablished is how you corrupt your data structure. If you're not in a valid state when you begin you probably won't be in a valid state when you finish.
Right. Also note that the non-optimized implementation boils down to computing F(n) = 1+1+1+1+...+1, with a function call tree that has 2F(n) nodes. So no matter what the relative cost is for addition and function calls, the total time should go like F(n).