Peaker

53 ms·

511.
by Peaker 13y ago
So in every single function, I have to either: A) Silently ignore errors in param counts, get cryptic bugs later when a trivial merge changes a function signature, or when changing a function signature. B) Add explicit code to check the par
512.
by Peaker 13y ago
> Why not just avoid making this mistake in the first place by reading the code? We're talking about programming errors . Are you suggesting the solution to human error is to just not make errors?? Note, of course, that wrong argum
513.
by Peaker 13y ago
The alternative to the US system isn't direct democracy. First-past-the-post is the main problem. Better democratic systems are used all over the world where actual parties that represent a spectrum of opinions get actually elected. D
514.
by Peaker 13y ago
Haskell allows that.
515.
by Peaker 13y ago
> why not instead dissect what we do with them: programs, and find ways to improve them ? The way to improve a lot of programs is to write them in a different language.
516.
by Peaker 13y ago
How do you handle Javascript ignoring wrong numbers of function arguments? Do you use a linter to catch this sort of thing? This part of Javascript sounds the most absolutely insane to me: Silencing an error like that is catastrophic.
517.
by Peaker 13y ago
I assume you meant life expectancy at birth. That is very different from life expectancy at adult ages. The former can be skewed downwards much by many babies not surviving their first few days. It would be much more productive to compare t
518.
by Peaker 13y ago
There's Template Haskell support to auto-generate FromJSON/ToJSON instances, so if you don't care exactly how the JSON looks like, you can get type-safe JSON serialization/schema validation for free.
519.
by Peaker 13y ago
I love examples that show that with a little effort (at least when standing on the shoulders of giants), we can have our cake (nice abstractions) and eat it too (not lose type safety).
520.
by Peaker 13y ago
I envision the array on a continuous axis, and place markers at 1 and 3 (the exact positions, not the range of whole numbers). The range on the axis between them is the right range. With this intuition, everything is very simple and makes p
521.
by Peaker 13y ago
That's not the entirety of the argument. There's the natural number stuff, as well. Also, b-a is appealing because simplicity is a good indicator you're on the right track, and part of the definition of elegance.
522.
by Peaker 13y ago
See the Dijkstra essay[1] for a convincing argument for half-open ranges. https://www.cs.utexas.edu/~EWD/transcriptions/EWD08xx/EWD831...
523.
by Peaker 13y ago
It's nice that my_list[0:3] + my_list[3:6] == my_list[0:6] It's nice that 3-0 = 3 elements. It's nice that an index counts the number of elements before it. It's nice that my_list[0:length] is the whole list, with no ext
524.
by Peaker 13y ago
That comment digressed to discuss whether or not evolution plans ahead and "eventually discovers ways to overcome" as implied by the OP. Keep up with the topic :)
525.
by Peaker 13y ago
You're again using the confused notion of "value". The HFTs are taking value away from others to themselves, not creating new value (at least if we reject the extra liquidity as a positive value). Societies will succeed more
526.
by Peaker 13y ago
Who says he tried to interpret the world? He was giving his own value judgement about it. Also, I do think that knowing whether something actually creates value or not (is a positive-sum, negative-sum or zero-sum game) is definitely helpful
527.
by Peaker 13y ago
I disagree completely. You seem to be confusing money/worth with value. If someone manages to redirect money towards themselves without creating a new economic resource, then no new value is made. Avoiding systems that don't crea
528.
by Peaker 13y ago
I really wish Haskell syntax was extended to allow special forms ("case", "do", etc) to be ordinary function arguments and not just infix function arguments. This would remove a significant portion of the $ signs in Hask
529.
by Peaker 13y ago
"slightly more actual syntax" is where all the syntax is, though :) "do", "let", "where", "case", "class", "instance", records, ... There's a lot more syntax to lear
530.
by Peaker 13y ago
Do you have a good ~/.cabal/config auto-installed with library profiling enabled?
531.
by Peaker 13y ago
Note that most functional languages, and definitely Haskell have persistent data structure libraries as that is the natural way to write data structures in those languages.
532.
by Peaker 13y ago
Even with Swype/Kii keyboards? I find they're quite fast!
533.
by Peaker 13y ago
Why not 1-to-1? Courts are supposed to be about fairness, and leveling the playing field helps fairness.
534.
by Peaker 13y ago
Hard drives are slow. Copying a huge working tree to make a small branch makes no sense.
535.
by Peaker 13y ago
The ability to reorder commits, split them, squash them, etc in an interactive Rebase is unparalleled in svn, which necessarily means lower quality history. Working with higher quality history when merging, cherry picking, reverting, etc is
536.
by Peaker 13y ago
If your working tree is large it will take a long time to copy it, no way around that.
537.
by Peaker 13y ago
Creating a copy of the working tree is not cheap at all.
538.
by Peaker 13y ago
In Chrome it Just Works... Firefox has had years to catch up to Chrome with these issues, why haven't they?
539.
by Peaker 13y ago
I'm not in KDE, I'm in Mate which has no such feature by default. Thanks for the second tip, if I try Firefox again I'll do that. Is it possible to get auto-updates at browser shutdown or in the background, when it doesn&#x27
540.
by Peaker 13y ago
Again, Firefox has no portable way to remove window decorations like Chromes does. There are Windows-only extensions, KDE-only extensions, and unreliable Gnome extensions.

More ›