parallel-tree-search-0.4.2/0000755000000000000000000000000007346545000013702 5ustar0000000000000000parallel-tree-search-0.4.2/CHANGELOG.md0000755000000000000000000000014407346545000015515 0ustar0000000000000000# Revision history for parallel-tree-search ## 0.4.2 -- 2020-10-26 * Depend on `tree-monad` 0.3.1 parallel-tree-search-0.4.2/Control/Parallel/0000755000000000000000000000000007346545000017056 5ustar0000000000000000parallel-tree-search-0.4.2/Control/Parallel/TreeSearch.hs0000644000000000000000000000147207346545000021443 0ustar0000000000000000-- | -- Module : Control.Parallel.TreeSearch -- Copyright : Fabian Reck, Sebastian Fischer -- License : PublicDomain -- -- Maintainer : Niels Bunkenburg (nbu@informatik.uni-kiel.de) -- Stability : experimental -- Portability : portable -- -- This Haskell library provides an implementation of parallel search -- based on the search tree provided by the package tree-monad. -- module Control.Parallel.TreeSearch ( parSearch ) where import Control.Monad.SearchTree import Control.Parallel -- | Enumerate the leaves of a @SearchTree@ using parallel depth-first search. parSearch :: SearchTree a -- ^ tree to search -> [a] -- ^ lazy list of leaves parSearch None = [] parSearch (One x) = [x] parSearch (Choice l r) = rs `par` (parSearch l ++ rs) where rs = parSearch r parallel-tree-search-0.4.2/LICENSE0000644000000000000000000000140307346545000014705 0ustar0000000000000000ALL PUBLIC DOMAIN MATERIAL IS OFFERED AS-IS. NO REPRESENTATIONS OR WARRANTIES OF ANY KIND ARE MADE CONCERNING THE MATERIALS, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS, WHETHER OR NOT DISCOVERABLE. IN NO EVENT WILL THE AUTHOR(S), PUBLISHER(S), OR PRESENTER(S) OF ANY PUBLIC DOMAIN MATERIAL BE LIABLE TO YOU ON ANY LEGAL THEORY FOR ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF THE AUTHOR(S), PUBLISHER(S), OR PRESENTER(S) HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. parallel-tree-search-0.4.2/README0000755000000000000000000000025407346545000014566 0ustar0000000000000000Parallel Tree Search ==================== This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad. parallel-tree-search-0.4.2/Setup.hs0000644000000000000000000000006007346545000015332 0ustar0000000000000000import Distribution.Simple main = defaultMain parallel-tree-search-0.4.2/parallel-tree-search.cabal0000644000000000000000000000215307346545000020663 0ustar0000000000000000cabal-version: >=1.10 name: parallel-tree-search version: 0.4.2 synopsis: Parallel Tree Search description: This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad. homepage: https://github.com/nbun/parallel-tree-search bug-reports: https://github.com/nbun/parallel-tree-search/issues license: PublicDomain license-File: LICENSE author: Fabian Reck, Sebastian Fischer maintainer: nbu@informatik.uni-kiel.de category: Control, Concurrency build-Type: Simple extra-Source-Files: CHANGELOG.md, README library exposed-modules: Control.Parallel.TreeSearch build-depends: base >= 4.13.0 && < 4.15, parallel >= 3.2.2 && < 3.3, tree-monad >= 0.3.1 && < 0.4 default-language: Haskell2010 ghc-options: -Wall source-repository head type: git location: git://github.com/nbun/parallel-tree-search.git