Control.Concurrent.ParallelTreeSearch

This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad.

Documentation

class SearchQueue q where

Search queues store multiple search trees.

Methods

emptyQ :: q a

Constructs an empty search queue.

addQ :: SearchTree a -> q a -> q a

Adds a search tree to asearch queue.

viewQ :: q a -> SearchView q a

creates a view on a search queue for pattern matching.

Instances

SearchQueue FIFO

SearchQueue LIFO

data SearchView q a

A SearchView is used for pattern matching a search queue.

Constructors

EmptyQ

(SearchTree a) :~ (q a)

newtype LIFO a

LIFO search queues can be used to implement parallel depth-first search.

Constructors

LIFO [SearchTree a]

Instances

SearchQueue LIFO

newtype FIFO a

FIFO search queues can be used to implement parallel breadth-first search.

Constructors

FIFO (Seq (SearchTree a))

Instances

SearchQueue FIFO

parallelTreeSearch

Arguments

:: SearchQueue q

=> Int

thread limit

-> Int

work limit

-> q a

queue with search trees

-> IO [a]

This function enumerates the results stored in the queue of SearchTrees in parallel. It is parameterised by the maximum number of threads to use and the maximum amount of work to perform by each thread before communicating the results.