Portability | portable |
---|---|
Stability | experimental |
Maintainer | Sebastian Fischer (sebf@informatik.uni-kiel.de) |
This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad.
- parallelTreeSearch :: Int -> SearchTree a -> IO [a]
Documentation
:: Int | number of threads to use |
-> SearchTree a | tree to search |
-> IO [a] | lazy list of leaves |
Enumerate the leaves of a SearchTree
in parallel.