Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
pacala
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
92 ms
·
901.
▲
by
pacala
13y ago
You assume that Alice is the sole provider of the product, which is by and large false. In practice Alice shows an ad to Bob at the $2 price point, while Claire and Darcy have the same product for $0.5. Furthermore, Alice creates an entire
902.
▲
by
pacala
13y ago
The people of ADVERT_CO work hard to distract and confuse my attention such that I overpay for the products they push. For every ad-supported site out there, I'd be better off by directly paying them money for their service. This is ba
903.
▲
by
pacala
13y ago
No. I'm upset if it's not shown. I write 1 star reviews as well. There appears to be no commitment to show reviews fairly instead of selling 5 star reviews to the higher bidder. Compare and contrast with the care for fairness in
904.
▲
by
pacala
13y ago
The algorithm only requires 12 holes, and scales the number of holes logarithmically. As opposed to make one group per unit, which scales the number of groups linearly. Less holes, less work, win. If you squint your eyes a bit, you can even
905.
▲
by
pacala
13y ago
> [1] In my opinion, privacy is obsolete in a world where people voluntarily give over to third parties every detail about their lives, but reasonable minds can differ on that point. The surveillance done by the big marketing firms today
906.
▲
by
pacala
13y ago
A sense of purpose. Long-term financial stability.
907.
▲
by
pacala
13y ago
Rails is Cobol. There is a lot of excitement in, for instance, AI, geoscale graphics or biocomputation.
908.
▲
by
pacala
13y ago
Any 0-day Linux root vulnerability qualifies. Linux is a large system, do your own risk analysis.
909.
▲
by
pacala
13y ago
callbacks are also known as continuations which are known as generalized goto.
910.
▲
by
pacala
13y ago
I can rephrase as well. I'm not going to rush your interview code to production, but the review cycle needs to start with a first version. We'll refine as needed, but this is a simple enough problem to expect well-structured code
911.
▲
by
pacala
13y ago
Where is Canada? If we are to count huge landmasses hostile to human habitation, here we are: Sahara desert: 3.629 million sq miles (9.4 million km²) Canada: 3.855 million sq miles (9.985 million km²)
912.
▲
by
pacala
13y ago
There is "crappy" as in buggy / overcomplicated and there is "crappy" as in lean, simple minded LRU that just works. The latter is production-ready high quality, even if it may be not tuned or optimized. You can twe
913.
▲
by
pacala
13y ago
> What's the difference between doing that at the command line vs doing it in a script? Testing. Clean consistent APIs. Dependency bloat.
914.
▲
by
pacala
13y ago
"organizational skills". aka politics :/
915.
▲
by
pacala
13y ago
The only reason VMs exist is because build systems are leaky. "Application built to run on Debian" means application depending on a myriad packages / shared libraries pre-installed on Debian. If your build system were hermeti
916.
▲
by
pacala
13y ago
> forced to duplicate the monadic combinators (e.g: inlined replicateM here). ??? This is a bare bones for loop. What exactly do you consider "duplication" ??? Regrettably, I can't accept the challenge because I have no idea what the co
917.
▲
by
pacala
13y ago
Thanks!
918.
▲
by
pacala
13y ago
There is one construct for repetition in Go. It's called "for". parser = ParserNil; for i := 0; i < 10; i++ { parser = ParserSeq(parser, ParserSeq(parseComma, parseInt)) } PS. I'm a complete Go newbie. Don't take
919.
▲
by
pacala
13y ago
The point is to not (re)invent little languages all the time, but to use the actual language. For coroutines, see https://sites.google.com/site/gopatterns/concurrency/corouti... . The parser combinator is also interesting. A parser combina
920.
▲
by
pacala
13y ago
I'll bite. What are useful uses of monads, other than implementing exceptions, async, state and IO? Granted, it's aestethically pleasing to have a really tiny core on which to layer more sugar, but sometimes using the language as-is suffice
921.
▲
by
pacala
13y ago
Does panic isolate gracefully a query-of-death, or does it take the entire server down? Does panic provide the stack-trace?
922.
▲
by
pacala
13y ago
Haha, you've just sold me. I'm switching to Go for my next project :)
923.
▲
by
pacala
14y ago
Original source: http://www.bonkersworld.net/building-software/
924.
▲
by
pacala
14y ago
> stop writing tests, the customer will never run this code git rm <code that customer will never run>
925.
▲
by
pacala
14y ago
Bottom up tree traversal doesn't require an explicit for loop as long as the language supports first class functions. bottomsUp(node) { recurseChildren(node, &bottomsUp); switch (node.id) { case FOO:
926.
▲
by
pacala
14y ago
Randomly searching for foldr on code.google.com inserts :: [(VarId,VarId)] -> Env -> Env inserts vvs env = foldr (\(a,b) acc -> M.insert a b acc) env vvs or inserts(vvs, env) { for ((a, b) : vvs) {
927.
▲
by
pacala
14y ago
Yes and no. In practice, you're going to fold into a different domain, which causes the types of the reduce function arguments to be different. Moreover, you are not going to have your reduce function conveniently in a library. You are goin
928.
▲
by
pacala
14y ago
What is the "fold" variant in Ruby? Maps are trivial either way, but folds are a pita in my functional programming experience.
929.
▲
by
pacala
14y ago
For loops have been parallelized for quite a while. Having a dataflow analysis tell apart a "map" loop from a "fold" loop is quite trivial once you have the framework in place (aliasing not withstanding). Heck, Fortran is all about for loop
930.
▲
by
pacala
14y ago
On the flip side, I had to scratch my head on what "&:" is supposed to mean. Or perhaps it's "&" ":". I know, I'll Google it </yeahright>. More seriously, "for ..." maps into "map", "foldl", "foldl'", "foldr" and perhaps oth
More ›