Zuckerberg has a moral defect. Evil is not a medical problem.
No relation to the sports channel.
Zuckerberg has a moral defect. Evil is not a medical problem.
I trust my city government a hell of a lot more than I trust the incoming federal administration.
If it’s unified under the federal government, then an asshole president can mess with it.
If it’s distributed, with states and major cities having their own instances, then it’s more asshole-resistant.
Originally a Drumpf was a drummer; i.e. one who makes their living off of hitting up skin heads.
Hey, at least the era of “all the world’s an x86-64” eventually ended.
I watched this happen in a research institution in the early 2000s. Scientists who had been heavy SGI, Sun, or HP customers realized that they could get a lot more bang for their buck with beige-box PCs running Linux (or occasionally FreeBSD). Aside from up-front costs, hardware upgrades and replacements were much cheaper and easier to get for PCs.
The big Unix vendors did not help their reputation when they started selling Windows machines — which all of them except Sun did in that era. It became increasingly clear that commercial Unix for scientific computing no longer had a future.
The built-in Proton WINE does pretty darn well for me already. Baldur’s Gate 3 plays fine on my Pop!_OS system.
A hatchback full of SD cards can beat that easily, though.
“What the user needed” / “What management demanded”
Good catch! Typo. Fixed.
Regex is good for a few very specific things, and sysadmins used to use it for goddamn everything. If all your server logs are in lightly-structured text files on a small number of servers, being able to improvise regex is damn useful for tracking down server problems. Just write a shell loop that spawns an ssh
logging into each server and running grep
over the log files, to look for that weird error.
These days, if you need to crunch production server logs you probably need to improvise in SQL and jq
and protobufs or systemd assmonkery or something.
But if you actually need a parser, for goodness sake use a parser combinator toolkit, don’t roll your own, especially not with regex. Describing your input language in plain Haskell is much nicer than kludging it.
(This is the “totally serious software engineering advice” forum, right?)
Yep. This is why online recipe sites put a whole goddamn personal essay before the actual recipe: if someone scrapes the page and copies it, they’ll scrape the (copyrightable) essay as well as the (non-copyrightable) recipe.
Whatever you do, don’t get in a time machine back to 1998 and become a Unix sysadmin.
(Though we didn’t have CL-PPCRE then. It’s really the best thing that ever happened to regex.)
The answer given in the spoiler tag is not quite correct!
According to the spoiler, this shouldn’t match “abab”, but it does.
This will match what the spoiler says: ^.?$|^((.)\2+?)\1+$
Any Perl-compatible regex can be parsed into a syntax tree using the Common Lisp package CL-PPCRE. So if you already know Common Lisp, you don’t need to learn regex syntax too!
So let’s put the original regex into CL-PPCRE’s parser. (Note, we have to add a backslash to escape the backslash in the string.) The parser will turn the regex notation into a nice pretty S-expression.
> (cl-ppcre:parse-string "^.?$|^(..+?)\\1+$")
(:ALTERNATION
(:SEQUENCE :START-ANCHOR (:GREEDY-REPETITION 0 1 :EVERYTHING) :END-ANCHOR)
(:SEQUENCE :START-ANCHOR
(:REGISTER
(:SEQUENCE :EVERYTHING (:NON-GREEDY-REPETITION 1 NIL :EVERYTHING)))
(:GREEDY-REPETITION 1 NIL (:BACK-REFERENCE 1)) :END-ANCHOR))
At which point we can tell it’s tricky because there’s a capturing register using a non-greedy repetition. (That’s the \1
and the +?
in the original.)
The top level is an alternation (the |
in the original) and the first branch is pretty simple: it’s just zero or one of any character.
The second branch is the fun one. It’s looking for two or more repetitions of the captured group, which is itself two or more characters. So, for instance, “aaaa”, or “abcabc”, or “abbaabba”, but not “aaaaa” or “abba”.
So strings that this matches will be of non-prime length: zero, one, or a multiple of two numbers 2 or greater.
But it is not true that it matches only “any character repeated a non-prime number of times” because it also matches composite-length sequences formed by repeating a string of different characters, like “abcabc”.
If we actually want what the spoiler says — only non-prime repetitions of a single character — then we need to use a second capturing register inside the first. This gives us:
^.?$|^((.)\2+?)\1+$
.
Specifically, this replaces (..+?)
with ((.)\2+?)
. The \2
matches the character captured by (.)
, so the whole regex now needs to see the same character throughout.
Try text.
Even in a home poker game, it is not possible for all the players to go home having made a profit, whereas that is very possible in the stock market due to growth, labor, and natural resources.
(The coal miner who gets a wage and black lung is not a player in the stock market. Neither is the sun, which provides free energy to agribusiness.)
In gambling, the house always wins, by extracting value from the players. In stock trading, the players (capitalists) collectively always win, by extracting value from labor, technological growth, and natural resources. These are not the same picture.
Sure, you can take on as much risk as you like using derivatives, and emulate a gambler using the stock market as a source of randomness (volatility). But that’s not how most traders behave, and it’s not how most traders’ payoffs work.
As the article mentions, Red Hat is IBM.
By way of comparison, the California almond industry uses 3.5 billion cubic meters of water per year. Describing datacenters as using “astronomical amounts of water” is a plain and simple lie.
Moreover, datacenters can be cooled with water that’s not suitable for most other uses. Google’s Finland datacenter is cooled with seawater, for example.