8·
3 months agoFrom the article:
Trump’s opposition to DSTs is not new: the Biden administration felt they disproportionately targeted US businesses and threatened 25 percent tariffs if they were not removed.
AirBreather
Public Key Fingerprint: 0x7FFAE9D0 7D64C571 8DB0297E AD51C258 0E479CD4
- 0 Posts
- 10 Comments
Joined 2 years ago
Cake day: June 13th, 2023
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
Another older blog post saying the same: https://sandimetz.com/blog/2016/1/20/the-wrong-abstraction
21·7 months agoAnything’s possible, but…
I have a feeling that the people who are just smart and capable enough to pull this off without any prior legal training or experience are also smart and capable enough to realize how incredibly bad an idea it would be to try in the first place.
If you’re going to fight the case on principle, then it is a no-brainer to hire at least some sort of legal representation. In terms of expected value, I imagine that it’s practically buying free money, at least up to a point.
0·8 months agoThe term is Heisenbug
5·11 months agoThere are now 15 standards
No, there is and always has been just the one standard text editor.
4·1 year agoTo be fair,
awaitis a bit more likecomefrom, and it’s been around for a few releases now.
23·1 year agoRockwell Retro Encabulator: https://youtu.be/RXJKdh1KZ0w
Why are they encrypting their communications? Do they have something to hide?
If they’ve got nothing to hide, then they’ve got nothing to fear.
Or so I’ve heard, anyway, right?
I prefer to convord ttp manually rather than use the trext tims.
But then how do you ensure that the text will be diåble?
These are fun rabbit holes to go down. Everything here is true, of course: Big-O complexity isn’t everything, context always matters, and measurements trump guesses.
But also, how many times have you encountered a performance problem with a slow O(n) solution that you solved by turning it into a fast O(n²) solution, compared to the other way around? The difference between 721ns and 72.1ns is almost always irrelevant (and is irrelevant if it’s not on a hot path), and in all likelihood, the same can be said at n=500 (even 500x these numbers still doesn’t even reach 0.5ms).
So unless context tells me that I have a good reason to think otherwise, I’m writing the one that uses a hash-based collection. As the codebase evolves in the future and the same bits of code are used in novel situations, I am much less likely to regret leaving microseconds on the table at small input sizes than to regret leaving milliseconds or seconds on the table at large input sizes.
As a trained practicioner of “the deeper magics” myself, I feel the need to point out that there’s a reason why we call these types of things “the deeper magics”, and that’s because heuristics like “better Big-O means better performance” generally point you in the right direction when it matters, and the wrong direction when it doesn’t matter.