a1369209993

11 ms·

91.
by a1369209993 3y ago
Just checked again with curl|grep, and now I'm getting: <h1 id=make-shell--expansion>make $(shell &mldr;) expansion</h1> as the actual bytes-on-the-wire, which is still wrong, but only in one way rather than
92.
by a1369209993 3y ago
> arbitrarily-punctuated versions of control structures Ahem: if [ x = 1 ] then echo "x is one" else echo "x is not one" echo "namely, it's $x" fi `if [ ] ; then` should only ever be
93.
by a1369209993 3y ago
> https://jmmv.dev/2021/08/useless-use-of-gnu.html Tangential, but your blog software seems to have mangled the headings; it's serving eg: make $(shell &mldr;) expansion instead of make
94.
by a1369209993 3y ago
Another alternative: "Code as if you'll have to come back and maintain this after you've completely forgotten how it works or that it ever existed, because there's a nontrivial chance that you will .".
95.
by a1369209993 3y ago
> can label you an ultra-right extremist and retroactively lock all your money down Nitpick: about half the time (on sufficiently long term average), they'll instead label you a ultra-left extremist (most infamously anti-COMINTERN i
96.
by a1369209993 3y ago
Actually it works for all trees, fruit or otherwise (and also for some non-tree graphs, though I'd have trouble giving a useful category more general than tree).
97.
by a1369209993 3y ago
No, having efficient random access means that it's O(1). That just usually goes without saying, because anything that has access at all can be made to have inefficient random access. But in this case, the fact that it's (neces
98.
by a1369209993 3y ago
> linked lists don't have random access `list.get_nth(n)` has O(N) runtime, as does `list.length()`, so binary search is actually completely possible, with runtime O(N^2) (aka "works very badly "). (Fair point that all fo
99.
by a1369209993 3y ago
Also they're just straightforwardly wrong. For example, binary search works on a array, or on a predicate like \x->(x*x <= 2.0), or on a hash table with contiguous integer indexes, or even on a linked list. Of course it works ve
100.
by a1369209993 3y ago
That doesn't actually work, because a DAG only lacks directed cycles. Consider: /-3-> D A -1-> B -1-> C \------4------^ In this case, the longest path is A-C, but C will be held at level 2 by B, leaving D low
101.
by a1369209993 3y ago
I don't actually have a problem for this to solve - like the rsync guy, I know how to use actual `tail -f` (and eg `perl -E` et al) - I'm just self-aware enough to realise that most people either aren't up to the task of hack
102.
by a1369209993 3y ago
Obligatory: We already have a open-source tail -f; it's called `tail -f`. (Kind of /s, but much like the infamous dropbox comment[0], it sucks that there exists a problem for this to solve in the first place.) 0: https:/&#x2
103.
by a1369209993 3y ago
People commonly believe that pinball has a random element (which it de facto does), and I assumed TFA was going be a dive into the precise (and technically deterministic) Newtonian physics underlying things like bumpers. But this seems to
104.
by a1369209993 3y ago
> How can a project gather over a million dollars worth of work time, but not $629 for a certification service? Because the certification 'service' is a protection racket (as in criminal[0] racketeering) by Microsoft. Millions
105.
by a1369209993 3y ago
> (I originally claimed "+0 + -0 = +0 vs. -0 + +0 = -0" which is incorrect ) Specifically, (-0.0) + (+0.0) = (+0.0) + (-0.0) = +0.0 (assuming round-to-nearest-or-even). OTOH, (-0.0) + (-0.0) = -0.0. This has nothing to do with
106.
by a1369209993 3y ago
Oh. ... Okay, then. In that case I regret to inform you that your previous comment was extremely poorly phrased, to the point of seeming to mean almost the opposite of what you apparently intended. (Particularly in that double negatives a
107.
by a1369209993 3y ago
> You can't say double negatives It is in fact not the case that you can't say that. Double negatives, like sentences with a excessive number of conjuctions, are perfectly grammatical (when they don't violate some actua
108.
by a1369209993 3y ago
AFAIK, no such directories exist in the linux proc code at this time . (Which means you won't get bug reports even in principle until, possibly years later, some such directories are added. At which point the code will start to to mal
109.
by a1369209993 3y ago
> > I can't imagine it wouldn't be > I can imagine it would be No. That means something completely different. They're saying (probably hyperbolically) that they cannot imagine the first of two possible situations, no
110.
by a1369209993 3y ago
No, aside from not being literally Japanophiles specifically , that does in fact sound about right, unironically. Likewise Emacs. But VSCode (/JetBrains/etc) is more like a Internet-of-Things version of one of those meat-and-chee
111.
by a1369209993 3y ago
As written, it should be `s_hasdigit`, but it's actually wrong - it should be: int s_isnum(const char* s) { int result = (*s != '\0'); while (*s != '\0') { if ((*s < '0') || ('9
112.
by a1369209993 3y ago
Exactly: one option is a single-time, fixed cost (single-time- ever if you write it as: CN_LCR_BiaoMei = 77, // either mother's sibling's daughter or father's sister's daughter // aka female
113.
by a1369209993 3y ago
If you don't have enough reaction mass (for which water sometimes qualifies) to get out of orbit, having air but no water (rather than water but no air) just means you die three or four orders of magnitude more slowly. Maybe someon
114.
by a1369209993 3y ago
> I've tried to disable but none of the methods I’ve seen have worked You can fix this in the latest working firefox version with `about:config > middlemouse.paste = false` (I found this by browsing through about:config, so I&#
115.
by a1369209993 3y ago
Actually, that seems to be a legitimate precedence ambiguity. The probably more common way to parse/interpret it is: > [Foreach developer D, D] needs to know this. > [Foreach developer D, D] doesn't need to know this. (No de
116.
by a1369209993 3y ago
> 6 months [...] 90 days. So they were told to renew the certificate, but not how many times to renew it?
117.
by a1369209993 3y ago
That's because they botched the proof. You need to sort the articles not by interestingness, but some separate canonical property, like creation date. Then you get a (here chronologically) first uninteresting article, which is intere
118.
by a1369209993 3y ago
> You claim no technical skills are useless then claim that you didn't need (use) 90% of them. Restating their (apparent) point more explicitly: there are no technical skills that have probability 0% of being used; there are many (m
119.
by a1369209993 3y ago
> The rule for mutexes is, never take more than one. Ideally the actual rule is, never take a mutex while holding another mutex. You can take multiple mutexes simultaneously if the API supports it. (The problem is the API usually doesn&
120.
by a1369209993 3y ago
Two redundant cardiovascular systems that don't work together, presumably in such a way that a heart attack or exsanguination in either is lethal (as opposed to modular redundancy for improved reliability, which mostly isn't relev

More ›