Viewing profile — shachaf
shachaf
HN member- Joined
- Tue, May 05, 2009, 3:30 AM UTC
- HN karma
- 203
- Public activity
- 36 items
- HN profile
- View on Hacker News ↗
About shachaf
No profile information was provided.
Recent public activity
- story
- story
- story
- story
- story
- story
-
comment
Comment #40473200
I use signalfd when I can, and this argument doesn't make much sense to me. The main goal of most signals you'd use it with -- like SIGCHLD/SIGPIPE -- is to wake you up and tell yo…
-
comment
Comment #37257901
The perspective I have in the post is that Multi-Paxos and Raft and so on are still doing pretty much exactly consensus for each log entry, they're just sharing lock IDs/ballots/te…
-
comment
Comment #33498504
Hmm, do you mean N+K+1 (to have enough points for both the data and parity shards)? Why isn't N+K sufficient, fitting a polynomial to N points and emitting K more?
-
comment
Comment #31396045
I would suggest against relying too closely on this article in its current state. The "precedence climbing" code is needlessly complicated -- it has a nested loop which doesn't do …
- story
-
comment
Comment #23938873
I didn't see this reply until today either. On laziness, I only mean that the language feature isn't important. You can certainly represent infinite data using laziness (and you mu…
-
comment
Comment #23800678
No, the article's p takes a function: > type Cantor = Natural -> Bit > (#) :: Bit -> Cantor -> Cantor > x # a = \i -> if i == 0 then x else a(i-1) (You could represent bit streams …
-
comment
Comment #23800209
Laziness isn't the essential thing here -- the article's construction specifically doesn't rely on laziness, and would work in a strict language (almost verbatim -- you might need …
- story
- story
-
comment
Comment #15623594
Is there any similar tool for string diagrams? They can be very expressive on paper, but it would be much more convenient to manipulate them on a computer.
-
comment
Comment #7087187
The last part is backwards -- when F is a functor, the only law we need to check is the identity law, but checking the composition law isn't enough. For example, fmap _ _ = [] sati…
-
comment
Comment #5690105
On the "Random Thought": The GIF doesn't need to be animated. A GIF is made of multiple frames and each frame contains multiple image blocks. Each image block has its own coördinat…
-
comment
Comment #3813425
That's what Hoogle ( http://www.haskell.org/hoogle/ ) and Hayoo! ( http://holumbus.fh-wedel.de/hayoo/hayoo.html ) are for.
-
comment
Comment #3336939
Not quite: Each image descriptor has its own Local Color Table, but the delays aren't set by the image descriptor, they're set by the Graphics Control Extension block, and you can …
-
comment
Comment #3336212
It's possible to make animated GIFs that use more than 256 colors per frame (although they'll probably be bigger than a format designed for that sort of thing).
-
comment
Comment #2417535
Yes, but then the canonical URL would be on github.com.
- story
-
comment
Comment #2408966
This was meant as a proof-of-concept and has several big inefficiencies that could be fixed pretty easily if someone was actually going to use it for something. The UI could also b…