Skeime

12 ms·

121.
by Skeime 4y ago
True boldface has a much darker type color than blackboard bold, thus drawing your eyes to it. But usually, the occurrences of, say, the real numbers are not the most interesting or important part on the page and they thus don’t deserve tha
122.
by Skeime 4y ago
The benefit is the data sharing between the tails. You can very cheaply get a copy of zipper with the data at (or around) the focused element changed while also keeping the original data unchanged. Admittedly, this is something people in fu
123.
by Skeime 4y ago
I’m not sure but I’d guess that step 1 is usually too difficult. So you can either: - produce short lists of candidates, in which case your pruning will often end up with no solution at all because you’re missing the correct answer in your
124.
by Skeime 6y ago
In proportional fonts, the minus sign is significantly longer and usually slightly higher and thinner than the hyphen (so it lines up with the horizontal bar of the + sign). If you’re used to it, it looks much better than a hyphen. (Similar
125.
by Skeime 6y ago
For extra fun, put it into the code like this, including the `...` instead of the actual values. (Make it compile by commenting that line out.) Then define IV somewhere else but make sure to use III before every use IV so someone unfamiliar
126.
by Skeime 6y ago
For many people (myself included), there is a distinction: A sum type is a tagged union. Using ‘|’ for union types and ‘+’ for sum types, the difference is that for a type T the type T | T is simply T again, whereas T + T is two copies of
127.
by Skeime 6y ago
> Your solution forces you to rewrite Point2D, which therefore creates a change in ApplicationFoo. I don’t see how this is the case. You don’t change Point2D at all, you simply add a second type Point3D. ApplicationFoo can happily contin
128.
by Skeime 7y ago
Actually, computing the minimum should work: If they are equal you can still lazily produce the digits of the decimal expansion. What you can’t do in this case is to tell whether this minimum is equal to the first or the second number.
129.
by Skeime 7y ago
> > Chrome is not part of the OS. > Legally irrelevant. If that was relevant, Microsoft wouldn't be attacked for bundling IE. I would argue that this shows that it is legally relevant. Because it is possible to say that IE i
130.
by Skeime 7y ago
If you are logged in, the following will do it, I think: Go to Preferences, then Appearance and change the skin to “MinervaNeue”.
131.
by Skeime 8y ago
Here is a more imperative version (using exceptions): The assumption is (as in the article) that each predicate terminates for every bit sequence and that the predicates are actual functions, i.e. they have no state. Also, predicates don’t
132.
by Skeime 8y ago
Having a situation where one handles both `Nothing` and `Just Nothing` in the same context should be rare. But you might be writing some functions on some abstract data structure with a type parameter `a` (say it’s a graph and users can tag
133.
by Skeime 8y ago
Elm’s 0.19 update was not super-well handled because it had quite a few breaks that are not easily handled (removing all custom operators, which make certain code structures different, disallowing Debug in packages where the new (arguably c
134.
by Skeime 8y ago
Grandparent here: I know, that’s what I tried to explain (poorly) with the next sentences. Programming languages with a remainder operator choose two representatives for every equivalence class except [0] and return the one that has the sam
135.
by Skeime 8y ago
Well, algebraically, Z/ n Z and Z/(– n )Z are the same. However, you have again some choice of canonical representative (and you might choose differently for n and – n ). But I agree that this is a rather rare case.
136.
by Skeime 8y ago
I know. But programming languages usually don’t have the modulo relation but a modulo operator that sends each number to a special representative of its equivalence class. For positive numbers, everyone agrees that this should be the smalle
137.
by Skeime 8y ago
This article focusses on the (rather uninteresting) case of taking the modulus/remainder of some positive dividend divided by a negative divisor. However, the real distinction lies in how the two operations handle negative dividends: