Spock-worker 0.3.0.0 → 0.3.1.0

raw patch · 3 files changed

+14/−14 lines, 3 filesdep ~SpockPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: Spock

API changes (from Hackage documentation)

Files

• Spock-worker.cabal +4/−4
• src/Web/Spock/Worker.hs +8/−8
• src/Web/Spock/Worker/Internal/Queue.hs +2/−2

@@ -1,5 +1,5 @@ name:                Spock-worker-version:             0.3.0.0+version:             0.3.1.0 synopsis:            Background workers for Spock description:         Adds a background-job queue to Spock homepage:            http://github.com/agrafix/Spock-worker@@ -7,11 +7,11 @@ license-file:        LICENSE author:              Alexander Thiemann <mail@athiemann.net> maintainer:          mail@athiemann.net-copyright:           (c) 2014 Alexander Thiemann+copyright:           (c) 2014 - 2016 Alexander Thiemann category:            Web build-type:          Simple cabal-version:       >=1.10-tested-with:         GHC==7.10.3+tested-with:         GHC==7.10.3, GHC==8.0.1  library   exposed-modules:@@ -21,7 +21,7 @@   hs-source-dirs:      src   default-language:    Haskell2010   build-depends:-                       Spock >=0.7.2,+                       Spock >=0.11,                        base >=4.8 && < 5,                        containers >=0.5,                        lifted-base,

@@ -16,14 +16,14 @@     ) where -import           Control.Concurrent-import           Control.Concurrent.STM-import           Control.Error-import           Control.Exception.Lifted        as EX-import           Control.Monad-import           Control.Monad.Trans-import           Data.Time-import           Web.Spock.Shared+import Control.Concurrent+import Control.Concurrent.STM+import Control.Error+import Control.Exception.Lifted as EX+import Control.Monad+import Control.Monad.Trans+import Data.Time+import Web.Spock import qualified Web.Spock.Worker.Internal.Queue as Q  -- | An error from a worker

@@ -24,7 +24,7 @@ isFullPQ pq =     sizePQ pq >= pq_maxSize pq -toListPQ :: Ord p => PureQueue p v -> [(p, [v])]+toListPQ :: PureQueue p v -> [(p, [v])] toListPQ (PureQueue m _) =     map (second V.toList) (M.toList m) @@ -37,7 +37,7 @@                    (PureQueue (M.insert k (V.fromList v) content) limit)               ) (emptyPQ limit) kv -maxPrioPQ :: Ord p => PureQueue p v -> p+maxPrioPQ :: PureQueue p v -> p maxPrioPQ (PureQueue m _) =     fst (M.findMax m)