polysemy-conc 0.12.1.0 → 0.13.0.0
raw patch · 3 files changed
+29/−83 lines, 3 filesdep ~basedep ~hedgehogdep ~incipit-corePVP ok
version bump matches the API change (PVP)
Dependency ranges changed: base, hedgehog, incipit-core, polysemy, polysemy-plugin, polysemy-resume, polysemy-test, polysemy-time, tasty, tasty-hedgehog
API changes (from Hackage documentation)
+ Polysemy.Conc.Effect.Critical: catch :: forall r_achg e_X0 a_X1. (Member Critical r_achg, Exception e_X0) => Sem r_achg a_X1 -> Sem r_achg (Either e_X0 a_X1)
+ Polysemy.Conc.Effect.Interrupt: interrupted :: forall r_acR3. Member Interrupt r_acR3 => Sem r_acR3 Bool
+ Polysemy.Conc.Effect.Interrupt: killOnQuit :: forall r_acR4 a_X0. Member Interrupt r_acR4 => Text -> Sem r_acR4 a_X0 -> Sem r_acR4 (Maybe a_X0)
+ Polysemy.Conc.Effect.Interrupt: quit :: forall r_acR1. Member Interrupt r_acR1 => Sem r_acR1 ()
+ Polysemy.Conc.Effect.Interrupt: register :: forall r_acQW. Member Interrupt r_acQW => Text -> IO () -> Sem r_acQW ()
+ Polysemy.Conc.Effect.Interrupt: unregister :: forall r_acQZ. Member Interrupt r_acQZ => Text -> Sem r_acQZ ()
+ Polysemy.Conc.Effect.Interrupt: waitQuit :: forall r_acR2. Member Interrupt r_acR2 => Sem r_acR2 ()
+ Polysemy.Conc.Effect.Queue: close :: forall d_afXF r_ag5W. Member (Queue d_afXF) r_ag5W => Sem r_ag5W ()
+ Polysemy.Conc.Effect.Queue: closed :: forall d_afXD r_ag5V. Member (Queue d_afXD) r_ag5V => Sem r_ag5V Bool
+ Polysemy.Conc.Effect.Queue: peek :: forall d_afXs r_ag5M. Member (Queue d_afXs) r_ag5M => Sem r_ag5M (QueueResult d_afXs)
+ Polysemy.Conc.Effect.Queue: read :: forall d_afXl r_ag5I. Member (Queue d_afXl) r_ag5I => Sem r_ag5I (QueueResult d_afXl)
+ Polysemy.Conc.Effect.Queue: readTimeout :: forall d_afXq r_ag5K t_X0. (Member (Queue d_afXq) r_ag5K, TimeUnit t_X0) => t_X0 -> Sem r_ag5K (QueueResult d_afXq)
+ Polysemy.Conc.Effect.Queue: tryPeek :: forall d_afXu r_ag5N. Member (Queue d_afXu) r_ag5N => Sem r_ag5N (QueueResult d_afXu)
+ Polysemy.Conc.Effect.Queue: tryRead :: forall d_afXn r_ag5J. Member (Queue d_afXn) r_ag5J => Sem r_ag5J (QueueResult d_afXn)
+ Polysemy.Conc.Effect.Queue: tryWrite :: forall d_afXy r_ag5Q. Member (Queue d_afXy) r_ag5Q => d_afXy -> Sem r_ag5Q (QueueResult ())
+ Polysemy.Conc.Effect.Queue: write :: forall d_afXw r_ag5O. Member (Queue d_afXw) r_ag5O => d_afXw -> Sem r_ag5O ()
+ Polysemy.Conc.Effect.Queue: writeTimeout :: forall d_afXB r_ag5S t_X0. (Member (Queue d_afXB) r_ag5S, TimeUnit t_X0) => t_X0 -> d_afXB -> Sem r_ag5S (QueueResult ())
+ Polysemy.Conc.Effect.Sync: block :: forall d_ah1w r_ah9S. Member (Sync d_ah1w) r_ah9S => Sem r_ah9S d_ah1w
+ Polysemy.Conc.Effect.Sync: empty :: forall d_ah1R r_aha7. Member (Sync d_ah1R) r_aha7 => Sem r_aha7 Bool
+ Polysemy.Conc.Effect.Sync: putBlock :: forall d_ah1K r_aha0. Member (Sync d_ah1K) r_aha0 => d_ah1K -> Sem r_aha0 ()
+ Polysemy.Conc.Effect.Sync: putTry :: forall d_ah1P r_aha5. Member (Sync d_ah1P) r_aha5 => d_ah1P -> Sem r_aha5 Bool
+ Polysemy.Conc.Effect.Sync: putWait :: forall d_ah1N r_aha2 u_X0. (Member (Sync d_ah1N) r_aha2, TimeUnit u_X0) => u_X0 -> d_ah1N -> Sem r_aha2 Bool
+ Polysemy.Conc.Effect.Sync: takeBlock :: forall d_ah1D r_ah9W. Member (Sync d_ah1D) r_ah9W => Sem r_ah9W d_ah1D
+ Polysemy.Conc.Effect.Sync: takeTry :: forall d_ah1I r_ah9Z. Member (Sync d_ah1I) r_ah9Z => Sem r_ah9Z (Maybe d_ah1I)
+ Polysemy.Conc.Effect.Sync: takeWait :: forall d_ah1G r_ah9X u_X0. (Member (Sync d_ah1G) r_ah9X, TimeUnit u_X0) => u_X0 -> Sem r_ah9X (Maybe d_ah1G)
+ Polysemy.Conc.Effect.Sync: try :: forall d_ah1B r_ah9V. Member (Sync d_ah1B) r_ah9V => Sem r_ah9V (Maybe d_ah1B)
+ Polysemy.Conc.Effect.Sync: wait :: forall d_ah1z r_ah9T u_X0. (Member (Sync d_ah1z) r_ah9T, TimeUnit u_X0) => u_X0 -> Sem r_ah9T (Maybe d_ah1z)
+ Polysemy.Conc.Effect.SyncRead: block :: forall d_ahBB r_ahEh. Member (SyncRead d_ahBB) r_ahEh => Sem r_ahEh d_ahBB
+ Polysemy.Conc.Effect.SyncRead: empty :: forall d_ahBI r_ahEl. Member (SyncRead d_ahBI) r_ahEl => Sem r_ahEl Bool
+ Polysemy.Conc.Effect.SyncRead: try :: forall d_ahBG r_ahEk. Member (SyncRead d_ahBG) r_ahEk => Sem r_ahEk (Maybe d_ahBG)
+ Polysemy.Conc.Effect.SyncRead: wait :: forall d_ahBE r_ahEi u_X0. (Member (SyncRead d_ahBE) r_ahEi, TimeUnit u_X0) => u_X0 -> Sem r_ahEi (Maybe d_ahBE)
+ Polysemy.Conc.Queue: close :: forall d_afXF r_ag5W. Member (Queue d_afXF) r_ag5W => Sem r_ag5W ()
+ Polysemy.Conc.Queue: closed :: forall d_afXD r_ag5V. Member (Queue d_afXD) r_ag5V => Sem r_ag5V Bool
+ Polysemy.Conc.Queue: peek :: forall d_afXs r_ag5M. Member (Queue d_afXs) r_ag5M => Sem r_ag5M (QueueResult d_afXs)
+ Polysemy.Conc.Queue: read :: forall d_afXl r_ag5I. Member (Queue d_afXl) r_ag5I => Sem r_ag5I (QueueResult d_afXl)
+ Polysemy.Conc.Queue: readTimeout :: forall d_afXq r_ag5K t_X0. (Member (Queue d_afXq) r_ag5K, TimeUnit t_X0) => t_X0 -> Sem r_ag5K (QueueResult d_afXq)
+ Polysemy.Conc.Queue: tryPeek :: forall d_afXu r_ag5N. Member (Queue d_afXu) r_ag5N => Sem r_ag5N (QueueResult d_afXu)
+ Polysemy.Conc.Queue: tryRead :: forall d_afXn r_ag5J. Member (Queue d_afXn) r_ag5J => Sem r_ag5J (QueueResult d_afXn)
+ Polysemy.Conc.Queue: tryWrite :: forall d_afXy r_ag5Q. Member (Queue d_afXy) r_ag5Q => d_afXy -> Sem r_ag5Q (QueueResult ())
+ Polysemy.Conc.Queue: write :: forall d_afXw r_ag5O. Member (Queue d_afXw) r_ag5O => d_afXw -> Sem r_ag5O ()
+ Polysemy.Conc.Queue: writeTimeout :: forall d_afXB r_ag5S t_X0. (Member (Queue d_afXB) r_ag5S, TimeUnit t_X0) => t_X0 -> d_afXB -> Sem r_ag5S (QueueResult ())
+ Polysemy.Conc.SyncRead: block :: forall d_ahBB r_ahEh. Member (SyncRead d_ahBB) r_ahEh => Sem r_ahEh d_ahBB
+ Polysemy.Conc.SyncRead: empty :: forall d_ahBI r_ahEl. Member (SyncRead d_ahBI) r_ahEl => Sem r_ahEl Bool
+ Polysemy.Conc.SyncRead: try :: forall d_ahBG r_ahEk. Member (SyncRead d_ahBG) r_ahEk => Sem r_ahEk (Maybe d_ahBG)
+ Polysemy.Conc.SyncRead: wait :: forall d_ahBE r_ahEi u_X0. (Member (SyncRead d_ahBE) r_ahEi, TimeUnit u_X0) => u_X0 -> Sem r_ahEi (Maybe d_ahBE)
Files
- LICENSE +1/−1
- lib/Polysemy/Conc/Interpreter/Interrupt.hs +1/−0
- polysemy-conc.cabal +27/−82
LICENSE view
@@ -1,4 +1,4 @@-Copyright (c) 2020 Torsten Schmits+Copyright (c) 2023 Torsten Schmits Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
lib/Polysemy/Conc/Interpreter/Interrupt.hs view
@@ -1,4 +1,5 @@ {-# options_haddock prune #-}+{-# language FieldSelectors #-} -- |Description: Interrupt interpreters module Polysemy.Conc.Interpreter.Interrupt where
polysemy-conc.cabal view
@@ -1,29 +1,29 @@ cabal-version: 2.2 --- This file has been generated from package.yaml by hpack version 0.35.0.+-- This file has been generated from package.yaml by hpack version 0.35.2. -- -- see: https://github.com/sol/hpack name: polysemy-conc-version: 0.12.1.0+version: 0.13.0.0 synopsis: Polysemy effects for concurrency description: See https://hackage.haskell.org/package/polysemy-conc/docs/Polysemy-Conc.html category: Concurrency-homepage: https://git.tryp.io/tek/polysemy-conc+homepage: https://github.com/tek/polysemy-conc#readme bug-reports: https://github.com/tek/polysemy-conc/issues author: Torsten Schmits maintainer: hackage@tryp.io-copyright: 2022 Torsten Schmits+copyright: 2023 Torsten Schmits license: BSD-2-Clause-Patent license-file: LICENSE build-type: Simple extra-source-files:- changelog.md readme.md+ changelog.md source-repository head type: git- location: https://git.tryp.io/tek/polysemy-conc+ location: https://github.com/tek/polysemy-conc library exposed-modules:@@ -76,73 +76,46 @@ default-extensions: AllowAmbiguousTypes ApplicativeDo- BangPatterns- BinaryLiterals BlockArguments- ConstraintKinds DataKinds DefaultSignatures DeriveAnyClass- DeriveDataTypeable- DeriveFoldable- DeriveFunctor- DeriveGeneric- DeriveLift- DeriveTraversable DerivingStrategies DerivingVia DisambiguateRecordFields- DoAndIfThenElse DuplicateRecordFields- EmptyCase- EmptyDataDecls- ExistentialQuantification- FlexibleContexts- FlexibleInstances FunctionalDependencies GADTs- GeneralizedNewtypeDeriving- InstanceSigs- KindSignatures LambdaCase LiberalTypeSynonyms- MultiParamTypeClasses MultiWayIf- NamedFieldPuns OverloadedLabels OverloadedLists OverloadedStrings PackageImports PartialTypeSignatures- PatternGuards PatternSynonyms- PolyKinds QuantifiedConstraints QuasiQuotes- RankNTypes RecordWildCards RecursiveDo RoleAnnotations- ScopedTypeVariables- StandaloneDeriving TemplateHaskell- TupleSections- TypeApplications TypeFamilies TypeFamilyDependencies- TypeOperators- TypeSynonymInstances UndecidableInstances UnicodeSyntax ViewPatterns- ghc-options: -Wall -Wredundant-constraints -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Widentities -Wunused-packages+ OverloadedRecordDot+ NoFieldSelectors+ ghc-options: -Wall -Widentities -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Wredundant-constraints -Wunused-type-patterns -Wunused-packages build-depends: async- , base >=4.12 && <5+ , base ==4.* , containers- , incipit-core >=0.4.1+ , incipit-core ==0.5.* , polysemy ==1.9.*- , polysemy-resume ==0.7.*+ , polysemy-resume >=0.7 && <0.9 , polysemy-time ==0.6.* , stm , stm-chans >=3 && <3.1@@ -153,9 +126,9 @@ base hiding (Prelude) , incipit-core (IncipitCore as Prelude) , incipit-core hiding (IncipitCore)- default-language: Haskell2010+ default-language: GHC2021 -test-suite polysemy-conc-unit+test-suite polysemy-conc-test type: exitcode-stdio-1.0 main-is: Main.hs other-modules:@@ -171,84 +144,56 @@ default-extensions: AllowAmbiguousTypes ApplicativeDo- BangPatterns- BinaryLiterals BlockArguments- ConstraintKinds DataKinds DefaultSignatures DeriveAnyClass- DeriveDataTypeable- DeriveFoldable- DeriveFunctor- DeriveGeneric- DeriveLift- DeriveTraversable DerivingStrategies DerivingVia DisambiguateRecordFields- DoAndIfThenElse DuplicateRecordFields- EmptyCase- EmptyDataDecls- ExistentialQuantification- FlexibleContexts- FlexibleInstances FunctionalDependencies GADTs- GeneralizedNewtypeDeriving- InstanceSigs- KindSignatures LambdaCase LiberalTypeSynonyms- MultiParamTypeClasses MultiWayIf- NamedFieldPuns OverloadedLabels OverloadedLists OverloadedStrings PackageImports PartialTypeSignatures- PatternGuards PatternSynonyms- PolyKinds QuantifiedConstraints QuasiQuotes- RankNTypes RecordWildCards RecursiveDo RoleAnnotations- ScopedTypeVariables- StandaloneDeriving TemplateHaskell- TupleSections- TypeApplications TypeFamilies TypeFamilyDependencies- TypeOperators- TypeSynonymInstances UndecidableInstances UnicodeSyntax ViewPatterns- ghc-options: -Wall -Wredundant-constraints -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Widentities -Wunused-packages -threaded -rtsopts -with-rtsopts=-N+ OverloadedRecordDot+ NoFieldSelectors+ ghc-options: -threaded -rtsopts -with-rtsopts=-N -Wall -Widentities -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Wredundant-constraints -Wunused-type-patterns -Wunused-packages build-depends: async- , base >=4.12 && <5- , hedgehog- , incipit-core >=0.4.1- , polysemy+ , base ==4.*+ , hedgehog >=1.1 && <1.3+ , incipit-core ==0.5.*+ , polysemy ==1.9.* , polysemy-conc- , polysemy-plugin- , polysemy-resume- , polysemy-test- , polysemy-time+ , polysemy-plugin >=0.4.4 && <0.5+ , polysemy-test >=0.6 && <0.9+ , polysemy-time ==0.6.* , stm- , tasty- , tasty-hedgehog+ , tasty ==1.4.*+ , tasty-hedgehog >=1.3 && <1.5 , time , unix mixins: base hiding (Prelude) , incipit-core (IncipitCore as Prelude) , incipit-core hiding (IncipitCore)- default-language: Haskell2010+ default-language: GHC2021