Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Peaker
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
55 ms
·
601.
▲
by
Peaker
13y ago
You must be a reasonable man. The world does change, even dramatically, sometimes. (Not that I believe Dart is interesting or useful enough to drive dramatic change, I find your approach overly pessimistic).
602.
▲
by
Peaker
13y ago
I work on a high performance system which needs to handle lots of concurrency of requests with various possible scenarios. In order to efficiently time out requests, need to have the requests sit in a chronological list. But they also need
603.
▲
by
Peaker
13y ago
If you have a structure whose only difference from a list is that it is guaranteed to have at least one element, why not call it a NonEmptyList?
604.
▲
by
Peaker
13y ago
I doubt git will be used half a century from now: * Heuristic textual diffing is probably inferior to recorded actual diffs from our code editors * Git merges are monolithic, and hide conflict resolution work within them in a difficult-to-r
605.
▲
by
Peaker
13y ago
Continuous integration, or frequently pulling, has huge advantages: * Breakage is localized to small merges. Instead of debugging the breakage of 1 month of work integrated with yours, you debug it a day of work at a time. Localized/di
606.
▲
by
Peaker
13y ago
Yes, and being asked about the nature of these skewed results.
607.
▲
by
Peaker
13y ago
With O(N) rather than O(1) costs for any list operations.
608.
▲
by
Peaker
13y ago
Indeed, and these cases are the ones we don't examine.
609.
▲
by
Peaker
13y ago
Because it may be that the host opened a random door, which happened not to have the prize in it.
610.
▲
by
Peaker
13y ago
Wow, that expert mathematicians refused to accept the solution is quite amazing to me... When I was originally asked the Monty Hall problem, I asked "Does the host know where the prize is?" to which they replied "it doesn
611.
▲
by
Peaker
13y ago
Most C++ implementations of linked lists are bad, including std::list and apparently, this course's. People misunderstand linked lists so badly, that they actually list the motivation for linked lists as fine-grained growth, as opposed
612.
▲
by
Peaker
13y ago
Not for the NonEmptyList... Is your problem mainly what you call this notion?
613.
▲
by
Peaker
13y ago
Because you will find it is the best tool for many programming jobs.
614.
▲
by
Peaker
13y ago
A better solution is length-encoded lists (often called Vectors): data Vector length a where Empty :: Vector 0 a Cons :: a -> Vector n a -> Vector (1 + n) a But Haskell isn't very good at such encodings. Type-level
615.
▲
by
Peaker
13y ago
> The App Store review process is in this spirit, they don't want shitty apps screwing up the experience on their phones. This is false. Apple has banned applications for dubious grounds, such as competing with Apple. Extremely usef
616.
▲
by
Peaker
13y ago
iPhone may be better than Android in this regard, but it is far from perfect. Many core apps in the iPhone (4S was the one I tried) have been unresponsive and had choppy animations when I toyed a bit. The perfect smoothness of the iPhone is
617.
▲
by
Peaker
13y ago
This feature is basically bacterial sex and turns their evolution from a slow serial computation to a highly parallel computation that gives an exponential speedup in evolution. I think this effect is the extremely under appreciated ben
618.
▲
by
Peaker
13y ago
> Similarly, in a heated room without an outside source of airflow, very hot air is constantly pushed directly to your body, which is a far more effective way of raising your body temperature rather than “baking” in hot air. If you get e
619.
▲
by
Peaker
13y ago
ML-style languages go much further with this, while also having richer type systems that both let you write code more easily and do more compile-time safety verifications.
620.
▲
by
Peaker
13y ago
It's a library/compatibility problem, and it's (finally) being addressed now (will take years until the change takes place, need deprecation warnings for a loong time).
621.
▲
by
Peaker
13y ago
The notation [x, y, z] denotes a homogeneously-typed list. So I used it as an example where type inference can figure out the type of an expression from its use, rather than from its intrinsic value. Dynamic types only work based on the int
622.
▲
by
Peaker
13y ago
The plenty of Haskellers I know have all expressed disinterest in Go as a poorly designed language. The linked post seems to be a very superficial take of Go. I wonder if he'd keep his opinion of Go after learning about lack of generic
623.
▲
by
Peaker
13y ago
I'd say Scheme and Haskell are functional languages, as they emphasize programming in a functional style: Composing functions to process values. "Value-oriented programming". I never understood why anyone classified Lisp (typ
624.
▲
by
Peaker
13y ago
Do Rob Pike or Russ Cox know any functional languages? I am not in either's fan club, and I find it easy to believe that they indeed do not understand functional languages.
625.
▲
by
Peaker
13y ago
Dynamic languages work out great when code coverage is ~100% at every run, and runs are short. Virtually all programs start out that way, so dynamic languages feel great. As they grow, the pain creeps in very slowly. As you said, by the tim
626.
▲
by
Peaker
13y ago
In Haskell, for example, you only need type declarations for disambiguation when the information is actually missing from the program. That is, if the program were dynamic, you'd also need to write that down. For example, the type of:
627.
▲
by
Peaker
13y ago
I think there's a survival-bias/selection-bias here. Those who tried Go and came from a background of more advanced languages just threw it away quickly and wrote nothing about Go.
628.
▲
by
Peaker
13y ago
I could counter your mental model of the real world with: The "real world" is a pure function of time -- therefore functional programming is the "right way" to model it. Examining our mental model of the "real world
629.
▲
by
Peaker
13y ago
Defining the spec would be the "programming".
630.
▲
by
Peaker
13y ago
For me, Wolfram Alpha has always just worked on the examples given by them, but when I try my own inputs, it fails on almost all of them. Even though my inputs are just variants of the same queries.
More ›