On Tue, 21 Jun 2011, Aleks Kissinger wrote:
Say, for instance, I have a stack of names and an (expensive) function
from names to bools. I'd like to spawn a handful of workers and wait for
them to finish. The workers then pop names off, compute the boolean
function and push the names back on
Yes! Par_List (and by association Future) seems to be exactly the kind
of thing I'm looking for.
The specific task is as follows. I have a list of graphs and want to
know if any graph is (roughly speaking) a subgraph of another. I'd
like to do this in time bounded by N*(N/k) instead of N^2, for k
On Tue, 21 Jun 2011, Aleks Kissinger wrote:
On a related note, any idea why Par_List.exists would raise the
EXCEPTIONS [] exception? The predicate function shouldn't be throwing
exceptions (at least it doesn't with List.exists substituted in), and
doesn't use side effects.
EXCEPTIONS []
