a1369209993

32 ms·

1.
by a1369209993 2y ago
> you cannot pass it a list of records where all contain the x field of int but some also contain an irrelevant y field and others contain an irrelevant z field. Yes you can - that's just a existential type. I'm not sure what t
2.
by a1369209993 2y ago
$ units You have: 25m2 / 2tau(700km)^2 You want: /billion * 0.0040600751 / 246.30086
3.
by a1369209993 2y ago
> such that at least every sentence is on its own line Yes, with the obvious possible exception of trivial/degenerate cases like "i++; j--;" in C or "This is a cat. That is a dog." in English. > and every line
4.
by a1369209993 2y ago
Yes, exactly. Which means that, while the speed gains are real, they only apply in cases where your libc is dangerously defective.
5.
by a1369209993 2y ago
> given not-pathologically-short line length limits like 20 characters Poor phrasing; 20 characters was meant as a example of a limit that is pathologically short.
6.
by a1369209993 2y ago
> Instead, I would prefer a soft semantic wrap So would I, but... > if a single semantic unit (be that a word, a clause, or whatever else) extends beyond, say, 80 characters, we keep it on the same line and let the editor/file vi
7.
by a1369209993 2y ago
> How should it be wrapped semantically? I have no idea what the semantics of that word are, which is information that is required in order to properly semantically wrap it. (Inherently, since conveying such semantics is one of the major
8.
by a1369209993 2y ago
> But if that sentence runs over e.g. 80 characters, > you still need to decide > whether you're going to hard wrap or soft wrap that sentence. No I don't. Semantic wrapping all the way.
9.
by a1369209993 2y ago
> vitalik didn't credit him in his article You mean this article? https://vitalik.eth.limo/general/2021/06/18/verkle.html > Verkle trees are still a new idea; they were first introduced by Joh
10.
by a1369209993 2y ago
Of course, you also need to use solid gold audio cables, or you're just throwing away the extra precision via poor signal fidelity.
11.
by a1369209993 2y ago
See also: https://blog.plover.com/math/finite-projective-planes.html .
12.
by a1369209993 2y ago
> There is no antimimetics division V2 "antim e metics". Antimimetics is also a thing, and might be interesting to read about, but it's not the same thing.
13.
by a1369209993 2y ago
I hope to write code that warrants a description at least twice as scathing as this one. But, you know, on purpose; when I'm intentionally fucking with someone. (I don't know of Martin ever trying to claim that Clean Code was ac
14.
by a1369209993 2y ago
Evidently I should have been more explicit: > > A much simpler[-and-more-nitpickable] version Myhill uses a parlor trick to make his version continuously differentiable. It's a pretty good parlor trick, but it doesn't
15.
by a1369209993 2y ago
> The key detail here is that the bumps grow exponentially smaller Pedantically, it's that the bumps grow exponentially narrower . IIUC, a simpler (but more nitpickable) version would be f'(n+1/y) = [the fraction of n-sta
16.
by a1369209993 2y ago
You're thinking of "self-aggrandizing" (and I think doctorpangloss is too, although I'm less certain since they didn't mention Wolfram).
17.
by a1369209993 2y ago
> The number of floats between 0 and 1 is the same as the number of floats between 1 and 3 No, the number of floats between 0 and 1 is (approximately) the same as the number of floats between 1 and positive infinity . And this is the c
18.
by a1369209993 2y ago
The real article appears to be https://arxiv.org/pdf/cs/0210024 .
19.
by a1369209993 2y ago
> It would be interesting to see a [not gratuitously inefficient] uniquely decodable code that is neither a prefix code nor one in reverse. This can be done by composing a prefix code with a suffix code: A 0 B 01 C 11
20.
by a1369209993 2y ago
> That link doesn't work at the present time. Try: $ A='https://web.archive.org/web/20240701123410' $ B='https://staging.cohostcdn.org/attachment' $ C='11357255-b6b
21.
by a1369209993 2y ago
> I don't expect to see code evaluation on untrusted input as intended features in web browser I'm not sure whether to laugh or cry at that. Suffice to say that ship has sailed all the way around the world several times, to the
22.
by a1369209993 2y ago
You do need (some subset of) associativity: (y0 * x) * x ?= y0 * (x * x) y1 * x ?= y0 * x y2 ?= y1 y2 is not in general constrained to be the same as y1 otherwise.
23.
by a1369209993 2y ago
> A few years ago I saw someone calculate the energy required to melt the ice in front of a locomotive (I think) at speed; IIRC it required a (not small!) nuclear reactor's worth of energy. Sounds like https://what-if.xkc
24.
by a1369209993 2y ago
Actually, "bank" isn't just homonyms; both senses derive from circa-Proto-Germanic benc/bank: a bench or other raised area (either a bank counter or the raised ground adjacent to a riverbed). (And yes, this etymology is
25.
by a1369209993 2y ago
> Sleep(1) sleeps for approximately 1 second. This is correct - Sleep(1) does sleep for approximately 1 second; the problem is you're confusing the 95% confidence interval (which might be as narrow as (999ms,1001ms) for some reaso
26.
by a1369209993 2y ago
That's accurate, but given the lack of words to the effect of "You can also put", it deserves the clarification that the most common something else is - as the parent suggested - a ∞-ohm resistor, either as a specific compone
27.
by a1369209993 2y ago
> Whenever I have to work with a project where someone used DRY [ ]consciously[ ], I know I am in for a world of pain. Huh. When you put it that way, that's actually a good point. In my experience, competent programming will try to
28.
by a1369209993 2y ago
> such as the practice of decomposing every non-trivial function into a bunch of micro-functions that call each other, That has approximately nothing to do with DRY. At best it might technically be a violation of DRY if (and only if) som
29.
by a1369209993 2y ago
IIUC, they're using the word itself correctly, but they mean "double precision is often used with the intent of it being a panacea".
30.
by a1369209993 2y ago
> in fact you need to work quite hard to allocate a structure with a pointer that isn't at least 4 byte aligned (i386), or 8 byte aligned (x64). Well, no, actually; it's: p = malloc(size+1)+1; It's just quite implau

More ›