úÎCµ     portable experimental/Sebastian Fischer (sebf@informatik.uni-kiel.de)CFIFO search queues can be used to implement parallel breadth-first  search. ALIFO search queues can be used to implement parallel depth-first  search. A  SearchView. is used for pattern matching a search queue. +Search queues store multiple search trees. "Constructs an empty search queue. %Adds a search tree to asearch queue. 7creates a view on a search queue for pattern matching. 0Checks whether the given search queue is empty. BEnumerate the leaves of a search tree concurrently in depth-first  order.  thread limit  work limit tree to search DEnumerate the leaves of a search tree concurrently in breadth-first  order.  thread limit  work limit tree to search <This function enumerates the results stored in the queue of   SearchTree2s in parallel. It is parameterised by the maximum D number of threads to use and the maximum amount of work to perform 2 by each thread before communicating the results.  thread limit  work limit queue with search trees           parallel-tree-search-0.2.1%Control.Concurrent.ParallelTreeSearchFIFOLIFO SearchView:~EmptyQ SearchQueueemptyQaddQviewQ parallelDFS parallelBFSparallelTreeSearch SearchEnv threadLimit workLimit threadCounterresultsisEmptyQ concNonEmpty parSearchprocess withTypeOf writeResultsincThreadCounterthreadLimitReachedfinaliseResultssearch