News for hackers. Stuff that matters.

A comment on Lampsort: Leslie Lamport's Non-recursive Quicksort. Parent comment

Re:Lampsort: Leslie Lamport's Non-recursive Quicksort by fiatmoney on Sunday December 07, 2014 @08:12PM (#8714399)
"you could accomplish the same thing by introducing a new language construct that explicitly noted that the order of two calls doesn't matter"

Effectively, this is what Golang's "go" construct does. Combined with channels you can construct an arbitrary dependency graph as well.

[ Parent | on HN ]
Re:Lampsort: Leslie Lamport's Non-recursive Quicksort by pacala on Monday December 08, 2014 @12:51AM (#8715120)
A very common need is to do an bunch of independent RPCs. Small wish: Allow returning values from a goroutine, along the lines of "results <- go rpc(args)".
[ Parent | on HN ]