numhask-hedgehog-0.3: Laws and tests for numhask

Safe HaskellNone
LanguageHaskell2010

NumHask.Hedgehog.Gen

Synopsis

Documentation

rational :: (ToRatio a, FromRatio a, MonadGen m) => Range a -> m a Source #

a rational-style random variate

rational_ :: (Additive a, Bounded a, ToRatio a, FromRatio a, MonadGen m) => m a Source #

a rational style random variate utilising Bounds

integral :: (ToInteger a, FromInteger a, MonadGen m) => Range a -> m a Source #

an integral-stype random variate

integral_ :: (Additive a, Bounded a, ToInteger a, FromInteger a, MonadGen m) => m a Source #

an integral-style random variate utilising Bounds

uniform :: (Field a, ToRatio a, FromRatio a, MonadGen m) => m a Source #

a uniform distribution between zero and one

negUniform :: (Field a, ToRatio a, FromRatio a, Subtractive a, MonadGen m) => m a Source #

a uniform distribution between -1 and 1

genPair :: Monad m => m a -> m (Pair a) Source #

a pair

genRange :: forall a m. (JoinSemiLattice a, MeetSemiLattice a, MonadGen m) => m a -> m (Range a) Source #

Space

genRangePos :: forall a m. (JoinSemiLattice a, MeetSemiLattice a, MonadGen m) => m a -> m (Range a) Source #

genComplex :: Monad m => m a -> m (Complex a) Source #

a complex random variate