packages feed

distributed-process 0.7.7 → 0.7.8

raw patch · 4 files changed

+19/−9 lines, 4 filesdep −transformersdep ~containersdep ~template-haskellPVP ok

version bump matches the API change (PVP)

Dependencies removed: transformers

Dependency ranges changed: containers, template-haskell

API changes (from Hackage documentation)

Files

ChangeLog view
@@ -1,3 +1,9 @@+2025-02-04 Laurent P. René de Cotret <laurent.decotret@outlook.com> 0.7.8++* Added documentation on the unit of measurement for timeout durations (#340)+* Added upper bound on `template-haskell` to prevent future breakage.+* Addressed some compilation warnings (#467)+ 2024-09-03 Laurent P. René de Cotret <laurent.decotret@outlook.com> 0.7.7  * Bumped dependency bounds to support GHC 8.10.7 - GHC 9.10.1
distributed-process.cabal view
@@ -1,6 +1,6 @@ cabal-version: 3.0 Name:          distributed-process-Version:       0.7.7+Version:       0.7.8 Build-Type:    Simple License:       BSD-3-Clause License-File:  LICENSE@@ -21,7 +21,7 @@                 You will probably also want to install a Cloud Haskell backend such                as distributed-process-simplelocalnet.-tested-with:   GHC==8.10.7 GHC==9.0.2 GHC==9.2.8 GHC==9.4.5 GHC==9.6.4 GHC==9.8.2 GHC==9.10.1+tested-with:   GHC==8.10.7 GHC==9.0.2 GHC==9.2.8 GHC==9.4.5 GHC==9.6.4 GHC==9.8.2 GHC==9.10.1 GHC==9.12.1 Category:      Control extra-doc-files: ChangeLog @@ -34,6 +34,7 @@                  -Wredundant-constraints                  -fhide-source-paths                  -Wpartial-fields+                 -Wunused-packages  source-repository head   Type:     git@@ -51,17 +52,16 @@                      hashable >= 1.2.0.5 && < 1.6,                      network-transport >= 0.4.1.0 && < 0.6,                      stm >= 2.4 && < 2.6,-                     transformers >= 0.2 && < 0.7,                      mtl >= 2.0 && < 2.4,                      data-accessor >= 0.2 && < 0.3,                      bytestring >= 0.10 && < 0.13,-                     random >= 1.0 && < 1.3,+                     random >= 1.0 && < 1.4,                      distributed-static >= 0.2 && < 0.4,                      rank1dynamic >= 0.1 && < 0.5,                      syb >= 0.3 && < 0.8,                      exceptions >= 0.10,                      containers >= 0.6 && < 0.8,-                     deepseq >= 1.4 && < 1.6,+                     deepseq >= 1.4 && < 1.7,                      time >= 1.9   Exposed-modules:   Control.Distributed.Process                      Control.Distributed.Process.Closure@@ -113,7 +113,7 @@                      UndecidableInstances   if flag(th)      other-extensions: TemplateHaskell-     Build-Depends: template-haskell >= 2.6+     Build-Depends: template-haskell >= 2.6 && <2.24      Exposed-modules: Control.Distributed.Process.Internal.Closure.TH      CPP-Options:     -DTemplateHaskellSupport 
src/Control/Distributed/Process/Internal/CQueue.hs view
@@ -72,7 +72,7 @@ data BlockSpec =     NonBlocking   | Blocking-  | Timeout Int+  | Timeout Int -- ^ Timeout in microseconds  -- Match operations --
src/Control/Distributed/Process/Internal/Primitives.hs view
@@ -414,7 +414,9 @@ -- If the timeout is zero do a non-blocking check for matching messages. A -- non-zero timeout is applied only when waiting for incoming messages (that is, -- /after/ we have checked the messages that are already in the mailbox).-receiveTimeout :: Int -> [Match b] -> Process (Maybe b)+receiveTimeout :: Int -- ^ Timeout in microseconds+               -> [Match b] +               -> Process (Maybe b) receiveTimeout t ms = do   queue <- processQueue <$> ask   let blockSpec = if t == 0 then NonBlocking else Timeout t@@ -1020,7 +1022,9 @@ --------------------------------------------------------------------------------  -- | Like 'expect' but with a timeout-expectTimeout :: forall a. Serializable a => Int -> Process (Maybe a)+expectTimeout :: forall a. Serializable a +              => Int  -- ^ Timeout in microseconds+              -> Process (Maybe a) expectTimeout n = receiveTimeout n [match return]  -- | Asynchronous version of 'spawn'