faktory 1.1.3.2 → 1.2.0.0
raw patch · 5 files changed
+47/−72 lines, 5 filesdep +ramdep −markdown-unlitdep −memorydep ~aesondep ~aeson-qqdep ~asyncPVP ok
version bump matches the API change (PVP)
Dependencies added: ram
Dependencies removed: markdown-unlit, memory
Dependency ranges changed: aeson, aeson-qq, async, bytestring, crypton, crypton-connection, hspec, megaparsec, microlens, network, random, resource-pool, safe-exceptions, text, time, unix, unliftio, unordered-containers
API changes (from Hackage documentation)
- Data.Pool.Compat: createPool :: IO a -> (a -> IO ()) -> Double -> Int -> IO (Pool a)
- Data.Pool.Compat: data () => LocalPool a
- Data.Pool.Compat: data () => Pool a
- Data.Pool.Compat: data () => PoolConfig a
- Data.Pool.Compat: defaultPoolConfig :: IO a -> (a -> IO ()) -> Double -> Int -> PoolConfig a
- Data.Pool.Compat: destroyAllResources :: Pool a -> IO ()
- Data.Pool.Compat: destroyResource :: Pool a -> LocalPool a -> a -> IO ()
- Data.Pool.Compat: newPool :: PoolConfig a -> IO (Pool a)
- Data.Pool.Compat: putResource :: LocalPool a -> a -> IO ()
- Data.Pool.Compat: setNumStripes :: Maybe Int -> PoolConfig a -> PoolConfig a
- Data.Pool.Compat: takeResource :: Pool a -> IO (a, LocalPool a)
- Data.Pool.Compat: tryTakeResource :: Pool a -> IO (Maybe (a, LocalPool a))
- Data.Pool.Compat: tryWithResource :: Pool a -> (a -> IO r) -> IO (Maybe r)
- Data.Pool.Compat: withResource :: Pool a -> (a -> IO r) -> IO r
- Faktory.Prelude: (<$!>) :: Monad m => (a -> b) -> m a -> m b
- Faktory.Prelude: (<$) :: Functor f => a -> f b -> f a
- Faktory.Prelude: (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- Faktory.Prelude: (=<<) :: Monad m => (a -> m b) -> m a -> m b
- Faktory.Prelude: (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- Faktory.Prelude: (>>) :: Monad m => m a -> m b -> m b
- Faktory.Prelude: (>>=) :: Monad m => m a -> (a -> m b) -> m b
- Faktory.Prelude: AsyncExceptionWrapper :: e -> AsyncExceptionWrapper
- Faktory.Prelude: Handler :: (e -> m a) -> Handler (m :: Type -> Type) a
- Faktory.Prelude: SomeAsyncException :: e -> SomeAsyncException
- Faktory.Prelude: SomeException :: e -> SomeException
- Faktory.Prelude: StringException :: String -> CallStack -> StringException
- Faktory.Prelude: SyncExceptionWrapper :: e -> SyncExceptionWrapper
- Faktory.Prelude: all :: Foldable t => (a -> Bool) -> t a -> Bool
- Faktory.Prelude: and :: Foldable t => t Bool -> Bool
- Faktory.Prelude: any :: Foldable t => (a -> Bool) -> t a -> Bool
- Faktory.Prelude: ap :: Monad m => m (a -> b) -> m a -> m b
- Faktory.Prelude: assert :: Bool -> a -> a
- Faktory.Prelude: asum :: (Foldable t, Alternative f) => t (f a) -> f a
- Faktory.Prelude: bracket :: (HasCallStack, MonadMask m) => m a -> (a -> m b) -> (a -> m c) -> m c
- Faktory.Prelude: bracketOnError :: (HasCallStack, MonadMask m) => m a -> (a -> m b) -> (a -> m c) -> m c
- Faktory.Prelude: bracketOnError_ :: (HasCallStack, MonadMask m) => m a -> m b -> m c -> m c
- Faktory.Prelude: bracketWithError :: (HasCallStack, MonadMask m) => m a -> (Maybe SomeException -> a -> m b) -> (a -> m c) -> m c
- Faktory.Prelude: bracket_ :: (HasCallStack, MonadMask m) => m a -> m b -> m c -> m c
- Faktory.Prelude: catch :: (HasCallStack, MonadCatch m, Exception e) => m a -> (e -> m a) -> m a
- Faktory.Prelude: catchAny :: (HasCallStack, MonadCatch m) => m a -> (SomeException -> m a) -> m a
- Faktory.Prelude: catchAnyDeep :: (HasCallStack, MonadCatch m, MonadIO m, NFData a) => m a -> (SomeException -> m a) -> m a
- Faktory.Prelude: catchAsync :: (HasCallStack, MonadCatch m, Exception e) => m a -> (e -> m a) -> m a
- Faktory.Prelude: catchDeep :: (HasCallStack, MonadCatch m, MonadIO m, Exception e, NFData a) => m a -> (e -> m a) -> m a
- Faktory.Prelude: catchIO :: (HasCallStack, MonadCatch m) => m a -> (IOException -> m a) -> m a
- Faktory.Prelude: catchIOError :: (HasCallStack, MonadCatch m) => m a -> (IOError -> m a) -> m a
- Faktory.Prelude: catchJust :: (HasCallStack, MonadCatch m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a
- Faktory.Prelude: catches :: (HasCallStack, MonadCatch m, MonadThrow m) => m a -> [Handler m a] -> m a
- Faktory.Prelude: catchesAsync :: (HasCallStack, MonadCatch m, MonadThrow m) => m a -> [Handler m a] -> m a
- Faktory.Prelude: catchesDeep :: (HasCallStack, MonadCatch m, MonadThrow m, MonadIO m, NFData a) => m a -> [Handler m a] -> m a
- Faktory.Prelude: class (Typeable e, Show e) => Exception e
- Faktory.Prelude: class () => Foldable (t :: Type -> Type)
- Faktory.Prelude: class () => Functor (f :: Type -> Type)
- Faktory.Prelude: class Applicative m => Monad (m :: Type -> Type)
- Faktory.Prelude: class MonadThrow m => MonadCatch (m :: Type -> Type)
- Faktory.Prelude: class Monad m => MonadFail (m :: Type -> Type)
- Faktory.Prelude: class MonadCatch m => MonadMask (m :: Type -> Type)
- Faktory.Prelude: class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type)
- Faktory.Prelude: class Monad m => MonadThrow (m :: Type -> Type)
- Faktory.Prelude: class (Functor t, Foldable t) => Traversable (t :: Type -> Type)
- Faktory.Prelude: class () => Typeable (a :: k)
- Faktory.Prelude: concat :: Foldable t => t [a] -> [a]
- Faktory.Prelude: concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- Faktory.Prelude: data () => AsyncExceptionWrapper
- Faktory.Prelude: data () => Handler (m :: Type -> Type) a
- Faktory.Prelude: data () => IOException
- Faktory.Prelude: data () => SomeAsyncException
- Faktory.Prelude: data () => SomeException
- Faktory.Prelude: data () => StringException
- Faktory.Prelude: data () => SyncExceptionWrapper
- Faktory.Prelude: displayException :: Exception e => e -> String
- Faktory.Prelude: elem :: (Foldable t, Eq a) => a -> t a -> Bool
- Faktory.Prelude: fail :: MonadFail m => String -> m a
- Faktory.Prelude: filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
- Faktory.Prelude: finally :: (HasCallStack, MonadMask m) => m a -> m b -> m a
- Faktory.Prelude: find :: Foldable t => (a -> Bool) -> t a -> Maybe a
- Faktory.Prelude: fmap :: Functor f => (a -> b) -> f a -> f b
- Faktory.Prelude: fmapDefault :: Traversable t => (a -> b) -> t a -> t b
- Faktory.Prelude: fold :: (Foldable t, Monoid m) => t m -> m
- Faktory.Prelude: foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- Faktory.Prelude: foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
- Faktory.Prelude: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
- Faktory.Prelude: foldMap' :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
- Faktory.Prelude: foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m
- Faktory.Prelude: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
- Faktory.Prelude: foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b
- Faktory.Prelude: foldl1 :: Foldable t => (a -> a -> a) -> t a -> a
- Faktory.Prelude: foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- Faktory.Prelude: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
- Faktory.Prelude: foldr' :: Foldable t => (a -> b -> b) -> b -> t a -> b
- Faktory.Prelude: foldr1 :: Foldable t => (a -> a -> a) -> t a -> a
- Faktory.Prelude: foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b
- Faktory.Prelude: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
- Faktory.Prelude: forAccumM :: (Monad m, Traversable t) => s -> t a -> (s -> a -> m (s, b)) -> m (s, t b)
- Faktory.Prelude: forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- Faktory.Prelude: forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()
- Faktory.Prelude: for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()
- Faktory.Prelude: forever :: Applicative f => f a -> f b
- Faktory.Prelude: fromException :: Exception e => SomeException -> Maybe e
- Faktory.Prelude: generalBracket :: (MonadMask m, HasCallStack) => m a -> (a -> ExitCase b -> m c) -> (a -> m b) -> m (b, c)
- Faktory.Prelude: guard :: Alternative f => Bool -> f ()
- Faktory.Prelude: handle :: (HasCallStack, MonadCatch m, Exception e) => (e -> m a) -> m a -> m a
- Faktory.Prelude: handleAny :: (HasCallStack, MonadCatch m) => (SomeException -> m a) -> m a -> m a
- Faktory.Prelude: handleAnyDeep :: (HasCallStack, MonadCatch m, MonadIO m, NFData a) => (SomeException -> m a) -> m a -> m a
- Faktory.Prelude: handleAsync :: (HasCallStack, MonadCatch m, Exception e) => (e -> m a) -> m a -> m a
- Faktory.Prelude: handleDeep :: (HasCallStack, MonadCatch m, Exception e, MonadIO m, NFData a) => (e -> m a) -> m a -> m a
- Faktory.Prelude: handleIO :: (HasCallStack, MonadCatch m) => (IOException -> m a) -> m a -> m a
- Faktory.Prelude: handleIOError :: (HasCallStack, MonadCatch m) => (IOError -> m a) -> m a -> m a
- Faktory.Prelude: handleJust :: (HasCallStack, MonadCatch m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m a
- Faktory.Prelude: impureThrow :: (HasCallStack, Exception e) => e -> a
- Faktory.Prelude: infixl 1 >>
- Faktory.Prelude: infixr 1 <=<
- Faktory.Prelude: isAsyncException :: Exception e => e -> Bool
- Faktory.Prelude: isSyncException :: Exception e => e -> Bool
- Faktory.Prelude: join :: Monad m => m (m a) -> m a
- Faktory.Prelude: length :: Foldable t => t a -> Int
- Faktory.Prelude: liftM :: Monad m => (a1 -> r) -> m a1 -> m r
- Faktory.Prelude: liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- Faktory.Prelude: liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- Faktory.Prelude: liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- Faktory.Prelude: liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- Faktory.Prelude: mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- Faktory.Prelude: mapAccumM :: (Monad m, Traversable t) => (s -> a -> m (s, b)) -> s -> t a -> m (s, t b)
- Faktory.Prelude: mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- Faktory.Prelude: mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
- Faktory.Prelude: mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)
- Faktory.Prelude: mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
- Faktory.Prelude: mask :: (MonadMask m, HasCallStack) => ((forall a. () => m a -> m a) -> m b) -> m b
- Faktory.Prelude: mask_ :: (HasCallStack, MonadMask m) => m a -> m a
- Faktory.Prelude: maximum :: (Foldable t, Ord a) => t a -> a
- Faktory.Prelude: maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- Faktory.Prelude: mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
- Faktory.Prelude: minimum :: (Foldable t, Ord a) => t a -> a
- Faktory.Prelude: minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- Faktory.Prelude: mplus :: MonadPlus m => m a -> m a -> m a
- Faktory.Prelude: msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
- Faktory.Prelude: mzero :: MonadPlus m => m a
- Faktory.Prelude: notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- Faktory.Prelude: null :: Foldable t => t a -> Bool
- Faktory.Prelude: onException :: (HasCallStack, MonadMask m) => m a -> m b -> m a
- Faktory.Prelude: or :: Foldable t => t Bool -> Bool
- Faktory.Prelude: product :: (Foldable t, Num a) => t a -> a
- Faktory.Prelude: replicateM :: Applicative m => Int -> m a -> m [a]
- Faktory.Prelude: replicateM_ :: Applicative m => Int -> m a -> m ()
- Faktory.Prelude: return :: Monad m => a -> m a
- Faktory.Prelude: sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)
- Faktory.Prelude: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
- Faktory.Prelude: sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()
- Faktory.Prelude: sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- Faktory.Prelude: sum :: (Foldable t, Num a) => t a -> a
- Faktory.Prelude: throw :: (HasCallStack, MonadThrow m, Exception e) => e -> m a
- Faktory.Prelude: throwIO :: (HasCallStack, MonadThrow m, Exception e) => e -> m a
- Faktory.Prelude: throwM :: (HasCallStack, MonadThrow m, Exception e) => e -> m a
- Faktory.Prelude: throwString :: (MonadThrow m, HasCallStack) => String -> m a
- Faktory.Prelude: throwTo :: (Exception e, MonadIO m) => ThreadId -> e -> m ()
- Faktory.Prelude: toAsyncException :: Exception e => e -> SomeException
- Faktory.Prelude: toException :: Exception e => e -> SomeException
- Faktory.Prelude: toList :: Foldable t => t a -> [a]
- Faktory.Prelude: toSyncException :: Exception e => e -> SomeException
- Faktory.Prelude: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
- Faktory.Prelude: traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
- Faktory.Prelude: try :: (HasCallStack, MonadCatch m, Exception e) => m a -> m (Either e a)
- Faktory.Prelude: tryAny :: (HasCallStack, MonadCatch m) => m a -> m (Either SomeException a)
- Faktory.Prelude: tryAnyDeep :: (HasCallStack, MonadCatch m, MonadIO m, NFData a) => m a -> m (Either SomeException a)
- Faktory.Prelude: tryAsync :: (HasCallStack, MonadCatch m, Exception e) => m a -> m (Either e a)
- Faktory.Prelude: tryDeep :: (HasCallStack, MonadCatch m, MonadIO m, Exception e, NFData a) => m a -> m (Either e a)
- Faktory.Prelude: tryIO :: (HasCallStack, MonadCatch m) => m a -> m (Either IOException a)
- Faktory.Prelude: tryJust :: (HasCallStack, MonadCatch m, Exception e) => (e -> Maybe b) -> m a -> m (Either b a)
- Faktory.Prelude: uninterruptibleMask :: (MonadMask m, HasCallStack) => ((forall a. () => m a -> m a) -> m b) -> m b
- Faktory.Prelude: uninterruptibleMask_ :: (HasCallStack, MonadMask m) => m a -> m a
- Faktory.Prelude: unless :: Applicative f => Bool -> f () -> f ()
- Faktory.Prelude: void :: Functor f => f a -> f ()
- Faktory.Prelude: when :: Applicative f => Bool -> f () -> f ()
- Faktory.Prelude: withException :: (HasCallStack, MonadMask m, Exception e) => m a -> (e -> m b) -> m a
- Faktory.Prelude: zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
- Faktory.Prelude: zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
- Faktory.Prelude: ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
+ Faktory.Prelude: ($!) :: (a -> b) -> a -> b
- Faktory.Prelude: ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
+ Faktory.Prelude: ($) :: (a -> b) -> a -> b
- Faktory.Prelude: class () => Bounded a
+ Faktory.Prelude: class Bounded a
- Faktory.Prelude: class () => Enum a
+ Faktory.Prelude: class Enum a
- Faktory.Prelude: class () => Eq a
+ Faktory.Prelude: class Eq a
- Faktory.Prelude: class () => Num a
+ Faktory.Prelude: class Num a
- Faktory.Prelude: class () => Read a
+ Faktory.Prelude: class Read a
- Faktory.Prelude: class () => Semigroup a
+ Faktory.Prelude: class Semigroup a
- Faktory.Prelude: class () => Show a
+ Faktory.Prelude: class Show a
- Faktory.Prelude: data () => Bool
+ Faktory.Prelude: data Bool
- Faktory.Prelude: data () => Char
+ Faktory.Prelude: data Char
- Faktory.Prelude: data () => Double
+ Faktory.Prelude: data Double
- Faktory.Prelude: data () => Either a b
+ Faktory.Prelude: data Either a b
- Faktory.Prelude: data () => Float
+ Faktory.Prelude: data Float
- Faktory.Prelude: data () => IO a
+ Faktory.Prelude: data IO a
- Faktory.Prelude: data () => Int
+ Faktory.Prelude: data Int
- Faktory.Prelude: data () => Integer
+ Faktory.Prelude: data Integer
- Faktory.Prelude: data () => Maybe a
+ Faktory.Prelude: data Maybe a
- Faktory.Prelude: data () => Ordering
+ Faktory.Prelude: data Ordering
- Faktory.Prelude: data () => Text
+ Faktory.Prelude: data Text
- Faktory.Prelude: data () => Word
+ Faktory.Prelude: data Word
- Faktory.Prelude: error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
+ Faktory.Prelude: error :: HasCallStack => [Char] -> a
- Faktory.Prelude: errorWithoutStackTrace :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a
+ Faktory.Prelude: errorWithoutStackTrace :: [Char] -> a
- Faktory.Prelude: infix 4 `notElem`
+ Faktory.Prelude: infix 4 >
- Faktory.Prelude: infixl 4 <$!>
+ Faktory.Prelude: infixl 4 <$>
- Faktory.Prelude: seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b
+ Faktory.Prelude: seq :: a -> b -> b
- Faktory.Prelude: undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
+ Faktory.Prelude: undefined :: HasCallStack => a
- Network.Connection.Compat: data () => Connection
+ Network.Connection.Compat: data Connection
- Network.Connection.Compat: data () => ConnectionContext
+ Network.Connection.Compat: data ConnectionContext
- Network.Connection.Compat: data () => ConnectionParams
+ Network.Connection.Compat: data ConnectionParams
- Network.Connection.Compat: data () => HostCannotConnect
+ Network.Connection.Compat: data HostCannotConnect
- Network.Connection.Compat: data () => HostNotResolved
+ Network.Connection.Compat: data HostNotResolved
- Network.Connection.Compat: data () => LineTooLong
+ Network.Connection.Compat: data LineTooLong
- Network.Connection.Compat: data () => ProxySettings
+ Network.Connection.Compat: data ProxySettings
- Network.Connection.Compat: data () => TLSSettings
+ Network.Connection.Compat: data TLSSettings
Files
- CHANGELOG.md +8/−1
- README.lhs +0/−1
- faktory.cabal +29/−30
- library/Data/Pool/Compat.hs +0/−31
- library/Faktory/Pool.hs +10/−9
CHANGELOG.md view
@@ -1,4 +1,11 @@-## [_Unreleased_](https://github.com/frontrowed/faktory_worker_haskell/compare/v1.1.3.2...main)+## [_Unreleased_](https://github.com/frontrowed/faktory_worker_haskell/compare/v1.2.0.0...main)++## [v1.2.0.0](https://github.com/frontrowed/faktory_worker_haskell/compare/v1.1.3.2...v1.2.0.0)++- Replace `memory` with `ram`+- Require `crypton >= 1.1`+- Require `resource-pool >= 0.3.0` (remove `.Compat` module)+- Drop support for GHCs older than 9.4 on CI ## [v1.1.3.2](https://github.com/frontrowed/faktory_worker_haskell/compare/v1.1.3.1...v1.1.3.2)
README.lhs view
@@ -56,7 +56,6 @@ import Faktory.Job import Faktory.Worker import GHC.Generics-import Text.Markdown.Unlit () {- Don't actually run anything -} main :: IO ()
faktory.cabal view
@@ -1,6 +1,6 @@ cabal-version: 1.18 name: faktory-version: 1.1.3.2+version: 1.2.0.0 license: MIT license-file: LICENSE copyright: 2018 Freckle Education@@ -51,7 +51,6 @@ library exposed-modules:- Data.Pool.Compat Faktory.Client Faktory.Connection Faktory.Ent.Batch@@ -90,29 +89,29 @@ -Wno-monomorphism-restriction -Wno-missing-import-lists build-depends:- aeson >=1.4.7.1,+ aeson >=2.2.1.0, aeson-casing >=0.2.0.0, base >=4 && <5,- bytestring >=0.10.10.1,- crypton >=0.33,- crypton-connection >=0.3.1,+ bytestring >=0.11.5.3,+ crypton >=1.1,+ crypton-connection >=0.4.6, data-default >=0.7.1.1, errors >=2.3.0,- megaparsec >=8.0.0,- memory >=0.15.0,- microlens >=0.4.11.2,+ megaparsec >=9.3.1,+ microlens >=0.4.13.1, mtl >=2.2.2,- network >=3.1.1.1,- random >=1.1,- resource-pool >=0.2.3.2,- safe-exceptions >=0.1.7.1,+ network >=3.1.4.0,+ ram >=0.22.0,+ random >=1.2.1.1,+ resource-pool >=0.3.0,+ safe-exceptions >=0.1.7.4, scanner >=0.3.1, semigroups >=0.19.1,- text >=1.2.4.0,- time >=1.9.3,- unix >=2.7.2.2,- unliftio >=0.2.13.1,- unordered-containers >=0.2.10.0+ text >=2.0.2,+ time >=1.12.2,+ unix >=2.7.3,+ unliftio >=0.2.25.0,+ unordered-containers >=0.2.19.1 if impl(ghc >=8.10) ghc-options:@@ -145,10 +144,10 @@ -Wno-monomorphism-restriction -Wno-missing-import-lists build-depends:- aeson >=1.4.7.1,+ aeson >=2.2.1.0, base >=4 && <5, faktory,- safe-exceptions >=0.1.7.1+ safe-exceptions >=0.1.7.4 if impl(ghc >=8.10) ghc-options:@@ -181,10 +180,10 @@ -Wno-monomorphism-restriction -Wno-missing-import-lists build-depends:- aeson >=1.4.7.1,+ aeson >=2.2.1.0, base >=4 && <5, faktory,- safe-exceptions >=0.1.7.1+ safe-exceptions >=0.1.7.4 if impl(ghc >=8.10) ghc-options:@@ -227,14 +226,14 @@ -Wno-monomorphism-restriction -Wno-missing-import-lists -rtsopts build-depends:- aeson >=1.4.7.1,- aeson-qq >=0.8.3,- async >=2.2.2,+ aeson >=2.2.1.0,+ aeson-qq >=0.8.4,+ async >=2.2.5, base >=4 && <5, faktory,- hspec >=2.7.6,+ hspec >=2.10.10, mtl >=2.2.2,- time >=1.9.3+ time >=1.12.2 if impl(ghc >=8.10) ghc-options:@@ -249,6 +248,7 @@ test-suite readme type: exitcode-stdio-1.0 main-is: README.lhs+ build-tool-depends: markdown-unlit:markdown-unlit hs-source-dirs: ./ other-modules: Paths_faktory default-language: Haskell2010@@ -269,10 +269,9 @@ markdown-unlit build-depends:- aeson >=1.4.7.1,+ aeson >=2.2.1.0, base >=4 && <5,- faktory,- markdown-unlit >=0.5.1+ faktory if impl(ghc >=8.10) ghc-options:
− library/Data/Pool/Compat.hs
@@ -1,31 +0,0 @@-{-# LANGUAGE CPP #-}--module Data.Pool.Compat- ( module Data.Pool- , createPool- ) where--import Prelude--import Data.Pool hiding (createPool)-#if MIN_VERSION_resource_pool(0,3,0)-#else-import Control.Concurrent (getNumCapabilities)-import qualified Data.Pool as Pool-#endif--createPool- :: IO a- -> (a -> IO ())- -> Double- -> Int- -> IO (Pool a)-createPool create destroy timeout size = do-#if MIN_VERSION_resource_pool(0,3,0)- newPool $ defaultPoolConfig create destroy timeout size-#else- -- Re-implement instead of using the deprecated compatibility function, so- -- that we can get a consistent numStripes and size behavior.- numStripes <- getNumCapabilities- Pool.createPool create destroy numStripes (realToFrac timeout) size-#endif
library/Faktory/Pool.hs view
@@ -24,8 +24,8 @@ import Control.Monad.IO.Class (MonadIO (..)) import Control.Monad.Reader (MonadReader, asks) import Data.Aeson (ToJSON)-import Data.Pool.Compat (Pool)-import qualified Data.Pool.Compat as Pool+import Data.Pool (Pool)+import qualified Data.Pool as Pool import Faktory.Job hiding (buildJob, perform) import qualified Faktory.Job as Job import Faktory.Producer@@ -59,13 +59,14 @@ -> PoolSettings -> m FaktoryPool newFaktoryPool settings PoolSettings {..} = do- liftIO $- FaktoryPool- <$> Pool.createPool- (newProducer settings)- closeProducer- (fromIntegral settingsTimeout)- (fromIntegral settingsSize)+ let poolConfig =+ Pool.defaultPoolConfig+ (newProducer settings)+ closeProducer+ (fromIntegral settingsTimeout)+ (fromIntegral settingsSize)++ liftIO $ FaktoryPool <$> Pool.newPool poolConfig -- | 'Faktory.Job.perform' but using a 'Producer' from the pool --