parallel-tree-search 0.4.1 → 0.4.2

raw patch · 3 files changed

+41/−34 lines, 3 filesdep ~basedep ~paralleldep ~tree-monadnew-uploaderPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, parallel, tree-monad

API changes (from Hackage documentation)

Files

• CHANGELOG.md +5/−0
• Control/Parallel/TreeSearch.hs +11/−9
• parallel-tree-search.cabal +25/−25

@@ -0,0 +1,5 @@+# Revision history for parallel-tree-search++## 0.4.2 -- 2020-10-26++* Depend on `tree-monad` 0.3.1

@@ -2,23 +2,25 @@ -- Module      : Control.Parallel.TreeSearch -- Copyright   : Fabian Reck, Sebastian Fischer -- License     : PublicDomain--- --- Maintainer  : Sebastian Fischer (sebf@informatik.uni-kiel.de)+--+-- 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+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 None = []+parSearch (One x) = [x] parSearch (Choice l r) = rs `par` (parSearch l ++ rs)- where rs = parSearch r+ where+  rs = parSearch r

@@ -1,29 +1,29 @@-Name:          parallel-tree-search-Version:       0.4.1-Cabal-Version: >= 1.6-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.--Category:      Control, Concurrency-License:       PublicDomain-License-File:  LICENSE-Author:        Fabian Reck, Sebastian Fischer-Maintainer:    Sebastian Fischer-Bug-Reports:   mailto:sebf@informatik.uni-kiel.de-Homepage:      http://github.com/sebfisch/parallel-tree-search-Build-Type:    Simple-Stability:     experimental+cabal-version:       >=1.10 -Extra-Source-Files: README+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-  Build-Depends:    base, tree-monad, parallel-  Exposed-Modules:  Control.Parallel.TreeSearch-  Ghc-Options:      -Wall+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+source-repository head   type:     git-  location: git://github.com/sebfisch/parallel-tree-search.git+  location: git://github.com/nbun/parallel-tree-search.git