MonadRandom 0.6.2 → 0.6.2.1
raw patch · 2 files changed
+11/−8 lines, 2 filesdep −faildep −transformers-compatdep ~transformersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies removed: fail, transformers-compat
Dependency ranges changed: transformers
API changes (from Hackage documentation)
+ Control.Monad.Random.Lazy: ($dmrandom) :: (Random a, RandomGen g, Uniform a) => g -> (a, g)
+ Control.Monad.Random.Lazy: ($dmrandomR) :: (Random a, RandomGen g, UniformRange a) => (a, a) -> g -> (a, g)
+ Control.Monad.Random.Lazy: ($dmsplit) :: (RandomGen g, SplitGen g) => g -> (g, g)
+ Control.Monad.Random.Lazy: type SeedSize g :: Nat;
+ Control.Monad.Random.Strict: ($dmrandom) :: (Random a, RandomGen g, Uniform a) => g -> (a, g)
+ Control.Monad.Random.Strict: ($dmrandomR) :: (Random a, RandomGen g, UniformRange a) => (a, a) -> g -> (a, g)
+ Control.Monad.Random.Strict: ($dmsplit) :: (RandomGen g, SplitGen g) => g -> (g, g)
+ Control.Monad.Random.Strict: type SeedSize g :: Nat;
- Control.Monad.Random.Class: class MonadRandom m => MonadInterleave m
+ Control.Monad.Random.Class: class MonadRandom m => MonadInterleave (m :: Type -> Type)
- Control.Monad.Random.Class: class Monad m => MonadRandom m
+ Control.Monad.Random.Class: class Monad m => MonadRandom (m :: Type -> Type)
- Control.Monad.Random.Class: class Monad m => MonadSplit g m | m -> g
+ Control.Monad.Random.Class: class Monad m => MonadSplit g (m :: Type -> Type) | m -> g
- Control.Monad.Random.Lazy: class () => Finite a
+ Control.Monad.Random.Lazy: class Finite a
- Control.Monad.Random.Lazy: class () => Random a
+ Control.Monad.Random.Lazy: class Random a
- Control.Monad.Random.Lazy: class () => RandomGen g
+ Control.Monad.Random.Lazy: class RandomGen g
- Control.Monad.Random.Lazy: class () => Uniform a
+ Control.Monad.Random.Lazy: class Uniform a
- Control.Monad.Random.Lazy: class () => UniformRange a
+ Control.Monad.Random.Lazy: class UniformRange a
- Control.Monad.Random.Lazy: data RandT g m a
+ Control.Monad.Random.Lazy: data RandT g (m :: Type -> Type) a
- Control.Monad.Random.Lazy: data () => Seed g
+ Control.Monad.Random.Lazy: data Seed g
- Control.Monad.Random.Lazy: data () => StdGen
+ Control.Monad.Random.Lazy: data StdGen
- Control.Monad.Random.Lazy: withRandT :: (g -> g) -> RandT g m a -> RandT g m a
+ Control.Monad.Random.Lazy: withRandT :: forall g (m :: Type -> Type) a. (g -> g) -> RandT g m a -> RandT g m a
- Control.Monad.Random.Strict: class () => Finite a
+ Control.Monad.Random.Strict: class Finite a
- Control.Monad.Random.Strict: class () => Random a
+ Control.Monad.Random.Strict: class Random a
- Control.Monad.Random.Strict: class () => RandomGen g
+ Control.Monad.Random.Strict: class RandomGen g
- Control.Monad.Random.Strict: class () => Uniform a
+ Control.Monad.Random.Strict: class Uniform a
- Control.Monad.Random.Strict: class () => UniformRange a
+ Control.Monad.Random.Strict: class UniformRange a
- Control.Monad.Random.Strict: data RandT g m a
+ Control.Monad.Random.Strict: data RandT g (m :: Type -> Type) a
- Control.Monad.Random.Strict: data () => Seed g
+ Control.Monad.Random.Strict: data Seed g
- Control.Monad.Random.Strict: data () => StdGen
+ Control.Monad.Random.Strict: data StdGen
- Control.Monad.Random.Strict: withRandT :: (g -> g) -> RandT g m a -> RandT g m a
+ Control.Monad.Random.Strict: withRandT :: forall g (m :: Type -> Type) a. (g -> g) -> RandT g m a -> RandT g m a
- Control.Monad.Trans.Random.Lazy: data RandT g m a
+ Control.Monad.Trans.Random.Lazy: data RandT g (m :: Type -> Type) a
- Control.Monad.Trans.Random.Lazy: withRandT :: (g -> g) -> RandT g m a -> RandT g m a
+ Control.Monad.Trans.Random.Lazy: withRandT :: forall g (m :: Type -> Type) a. (g -> g) -> RandT g m a -> RandT g m a
- Control.Monad.Trans.Random.Strict: data RandT g m a
+ Control.Monad.Trans.Random.Strict: data RandT g (m :: Type -> Type) a
- Control.Monad.Trans.Random.Strict: withRandT :: (g -> g) -> RandT g m a -> RandT g m a
+ Control.Monad.Trans.Random.Strict: withRandT :: forall g (m :: Type -> Type) a. (g -> g) -> RandT g m a -> RandT g m a
Files
- CHANGES.markdown +7/−0
- MonadRandom.cabal +4/−8
CHANGES.markdown view
@@ -1,3 +1,10 @@+0.6.2.1 (19 January 2026)+-------------------------++- Test with GHC 9.14+- Drop support for GHC < 8+- Drop `transformers-compat` dependency+ 0.6.2 (5 March 2025) --------------------
MonadRandom.cabal view
@@ -1,5 +1,5 @@ name: MonadRandom-version: 0.6.2+version: 0.6.2.1 synopsis: Random-number generation monad. description: Support for computations which consume random values. license: BSD3@@ -11,11 +11,11 @@ build-type: Simple cabal-version: >=1.10 extra-source-files: CHANGES.markdown-tested-with: GHC ==7.10.3 || ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.6 || ==9.8.2 || ==9.10.1 || ==9.12.1+tested-with: GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.6 || ==9.8.2 || ==9.10.1 || ==9.12.1 || ==9.14.1 source-repository head type: git- location: git://github.com/byorgey/MonadRandom.git+ location: https://github.com/byorgey/MonadRandom library exposed-modules:@@ -28,14 +28,10 @@ Control.Monad.Trans.Random.Strict build-depends: base >=4.8 && <5,- transformers >=0.4 && <0.7,- transformers-compat >=0.4 && <0.8,+ transformers >=0.5 && <0.7, mtl >=2.2.1 && <2.3 || >= 2.3.1 && < 2.4, primitive >=0.6 && <0.10, random >=1.0.1 && <1.4 ghc-options: -Wall default-language: Haskell2010 other-extensions: Safe-- if impl(ghc < 8.0)- build-depends: fail >= 4.9