HORIZON HASKELLDocslts/ghc-10.0.xc7d136e2026-10-12Search names, modules, packages, or :: a typeCtrl K

GHC 10.0.0.20260917 · lts/ghc-10.0.x · c7d136e · 2026-10-12

Modulehedgehog-1.7

Hedgehog

  • 29 types
  • 8 classes
  • 50 values
  • Packagehedgehog-1.7
  • Exports88
  • LicenceBSD-3-Clause
  • SourceClasses.hs
valueeq1 :: (Eq1 f, Eq a) => f a -> f a -> Bool
#

Lift the standard (==) function through the type constructor.

classclass FunctorB (b :: (k -> Type) -> Type) where
#

Methods

  • bmap :: (forall (a :: k). f a -> g a) -> b f -> b g
Instances11FunctorB, …
classclass FunctorB b => TraversableB (b :: (k -> Type) -> Type) where
#

Methods

Instances11TraversableB, …
newtypenewtype Rec p a (x :: k)
#

Constructors

Instances45GTraversable, GApplicative, GFunctor, GDistributive, GBare, GConstraints, …
classclass (forall a. Eq a => Eq (f a)) => Eq1 (f :: Type -> Type) where
#

Lifting of the Eq class to unary type constructors.

Any instance should be subject to the following law that canonicity is preserved:

liftEq (==) = (==)

This class therefore represents the generalization of Eq by decomposing its main method into a canonical lifting on a canonical inner method, so that the lifting can be reused for other arguments than the canonical one.

Instances69Lifting2, Lifting, Eq1, …
  • Eq1 ComplexDefined in base-4.23.0.0 · Data.Functor.Classes
    Example1 expression
    eq1 (1 :+ 2) (1 :+ 2)True
    Example1 expression
    eq1 (1 :+ 2) (1 :+ 3)False
  • Eq1 SCCDefined in containers-0.8 · Data.Graph
  • Eq1 IntMapDefined in containers-0.8 · Data.IntMap.Internal
  • Eq1 SeqDefined in containers-0.8 · Data.Sequence.Internal
  • Eq1 SetDefined in containers-0.8 · Data.Set.Internal
  • Eq1 TreeDefined in containers-0.8 · Data.Tree
  • Eq1 NonEmptyDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 IdentityDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 DownDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 Par1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 MaybeDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 SoloDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 HashedDefined in hashable-1.5.1.0 · Data.Hashable.Class
  • Eq1 ConcreteDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Eq1 SymbolicDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Eq1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.Array
  • Eq1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArray
  • Eq1 HashSetDefined in unordered-containers-0.2.21 · Data.HashSet.Internal
  • Eq1 []Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 ProxyDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 U1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UAddrDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UCharDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UDoubleDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UFloatDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UIntDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 UWordDefined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 V1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 f => Eq1 (Lift f)Defined in transformers-0.6.3.0 · Control.Applicative.Lift
  • Eq1 m => Eq1 (MaybeT m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Maybe
  • Eq a => Eq1 (Either a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq a => Eq1 (Tuple2 a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq k => Eq1 (Map k)Defined in containers-0.8 · Data.Map.Internal
  • Eq k => Eq1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
  • (GEq1 NonV4 (Rep1 f), Generic1 f) => Eq1 (FunctorClassesDefault f)Defined in transformers-compat-0.7.2 · Data.Functor.Classes.Generic.Internal
  • Eq1 (Tagged s)Defined in tagged-0.8.11 · Data.Tagged
  • Eq1 f => Eq1 (Rec1 f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 f => Eq1 (Backwards f)Defined in transformers-0.6.3.0 · Control.Applicative.Backwards
  • Eq1 f => Eq1 (IdentityT f)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Identity
  • Eq1 f => Eq1 (Reverse f)Defined in transformers-0.6.3.0 · Data.Functor.Reverse
  • Eq a => Eq1 (Const a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq a => Eq1 (Constant a)Defined in transformers-0.6.3.0 · Data.Functor.Constant
  • (Eq a, Eq b) => Eq1 (Tuple3 a b)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Eq e, Eq1 m) => Eq1 (ExceptT e m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Except
  • (Eq w, Eq1 m) => Eq1 (WriterT w m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Writer.Lazy
  • (Eq w, Eq1 m) => Eq1 (WriterT w m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Writer.Strict
  • (Generic1 f, Eq1 (Rep1 f)) => Eq1 (Generically1 f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Lifting Eq1 LiftDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Eq1 MaybeTDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Eq1 BackwardsDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Eq1 IdentityTDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Eq1 ReverseDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq e => Lifting Eq1 (ExceptT e)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq w => Lifting Eq1 (WriterT w)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq w => Lifting Eq1 (WriterT w)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting2 Eq1 ProductDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting2 Eq1 SumDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq1 f => Lifting Eq1 (Product f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq1 f => Lifting Eq1 (Sum f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq1 f => Lifting Eq1 (Compose f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Eq c => Eq1 (K1 i c)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Eq1 f, Eq1 g) => Eq1 (Product f g)Defined in base-4.23.0.0 · Data.Functor.Product
  • (Eq1 f, Eq1 g) => Eq1 (Sum f g)Defined in base-4.23.0.0 · Data.Functor.Sum
  • (Eq1 f, Eq1 g) => Eq1 (f :*: g)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Eq1 f, Eq1 g) => Eq1 (f :+: g)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Eq a, Eq b, Eq c) => Eq1 (Tuple4 a b c)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Eq1 f => Eq1 (M1 i c f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Eq1 f, Eq1 g) => Eq1 (Compose f g)Defined in base-4.23.0.0 · Data.Functor.Compose
  • (Eq1 f, Eq1 g) => Eq1 (f :.: g)Defined in base-4.23.0.0 · Data.Functor.Classes
classclass (Eq1 f, forall a. Ord a => Ord (f a)) => Ord1 (f :: Type -> Type) where
#

Lifting of the Ord class to unary type constructors.

Any instance should be subject to the following law that canonicity is preserved:

liftCompare compare = compare

This class therefore represents the generalization of Ord by decomposing its main method into a canonical lifting on a canonical inner method, so that the lifting can be reused for other arguments than the canonical one.

Instances67Lifting2, Lifting, Ord1, …
  • Ord1 IntMapDefined in containers-0.8 · Data.IntMap.Internal
  • Ord1 SeqDefined in containers-0.8 · Data.Sequence.Internal
  • Ord1 SetDefined in containers-0.8 · Data.Set.Internal
  • Ord1 TreeDefined in containers-0.8 · Data.Tree
  • Ord1 NonEmptyDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 IdentityDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 DownDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 Par1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 MaybeDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 SoloDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 HashedDefined in hashable-1.5.1.0 · Data.Hashable.Class
  • Ord1 ConcreteDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Ord1 SymbolicDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Ord1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.Array
  • Ord1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArray
  • Ord1 HashSetDefined in unordered-containers-0.2.21 · Data.HashSet.Internal
  • Ord1 []Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 ProxyDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 U1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UAddrDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UCharDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UDoubleDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UFloatDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UIntDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 UWordDefined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 V1Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 f => Ord1 (Lift f)Defined in transformers-0.6.3.0 · Control.Applicative.Lift
  • Ord1 m => Ord1 (MaybeT m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Maybe
  • Ord a => Ord1 (Either a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord a => Ord1 (Tuple2 a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord k => Ord1 (Map k)Defined in containers-0.8 · Data.Map.Internal
  • Ord k => Ord1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
  • (GOrd1 NonV4 (Rep1 f), Generic1 f) => Ord1 (FunctorClassesDefault f)Defined in transformers-compat-0.7.2 · Data.Functor.Classes.Generic.Internal
  • Ord1 (Tagged s)Defined in tagged-0.8.11 · Data.Tagged
  • Ord1 f => Ord1 (Rec1 f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 f => Ord1 (Backwards f)Defined in transformers-0.6.3.0 · Control.Applicative.Backwards
  • Ord1 f => Ord1 (IdentityT f)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Identity
  • Ord1 f => Ord1 (Reverse f)Defined in transformers-0.6.3.0 · Data.Functor.Reverse
  • Ord a => Ord1 (Const a)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord a => Ord1 (Constant a)Defined in transformers-0.6.3.0 · Data.Functor.Constant
  • (Ord a, Ord b) => Ord1 (Tuple3 a b)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Ord e, Ord1 m) => Ord1 (ExceptT e m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Except
  • (Ord w, Ord1 m) => Ord1 (WriterT w m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Writer.Lazy
  • (Ord w, Ord1 m) => Ord1 (WriterT w m)Defined in transformers-0.6.3.0 · Control.Monad.Trans.Writer.Strict
  • (Generic1 f, Ord1 (Rep1 f)) => Ord1 (Generically1 f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Lifting Ord1 LiftDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Ord1 MaybeTDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Ord1 BackwardsDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Ord1 IdentityTDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting Ord1 ReverseDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord e => Lifting Ord1 (ExceptT e)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord w => Lifting Ord1 (WriterT w)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord w => Lifting Ord1 (WriterT w)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting2 Ord1 ProductDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Lifting2 Ord1 SumDefined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord1 f => Lifting Ord1 (Product f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord1 f => Lifting Ord1 (Sum f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord1 f => Lifting Ord1 (Compose f)Defined in constraints-0.14.4 · Data.Constraint.Lifting
  • Ord c => Ord1 (K1 i c)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Ord1 f, Ord1 g) => Ord1 (Product f g)Defined in base-4.23.0.0 · Data.Functor.Product
  • (Ord1 f, Ord1 g) => Ord1 (Sum f g)Defined in base-4.23.0.0 · Data.Functor.Sum
  • (Ord1 f, Ord1 g) => Ord1 (f :*: g)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Ord1 f, Ord1 g) => Ord1 (f :+: g)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Ord a, Ord b, Ord c) => Ord1 (Tuple4 a b c)Defined in base-4.23.0.0 · Data.Functor.Classes
  • Ord1 f => Ord1 (M1 i c f)Defined in base-4.23.0.0 · Data.Functor.Classes
  • (Ord1 f, Ord1 g) => Ord1 (Compose f g)Defined in base-4.23.0.0 · Data.Functor.Compose
  • (Ord1 f, Ord1 g) => Ord1 (f :.: g)Defined in base-4.23.0.0 · Data.Functor.Classes
classclass (forall a. Show a => Show (f a)) => Show1 (f :: Type -> Type) where
#

Lifting of the Show class to unary type constructors.

Any instance should be subject to the following laws that canonicity is preserved:

liftShowsPrec showsPrec showList = showsPrec

liftShowList showsPrec showList = showList

This class therefore represents the generalization of Show by decomposing it's methods into a canonical lifting on a canonical inner method, so that the lifting can be reused for other arguments than the canonical one.

Instances71Lifting2, Lifting, Show1, …
newtypenewtype GenT (m :: Type -> Type) a
#
Instances28MonadTrans, MMonad, MonadTransDistributive, MFunctor, MonadError, MonadReader, …
classclass (Monad m, Monad (GenBase m)) => MonadGen (m :: Type -> Type) where
#

Associated types

Methods

Instances9MonadGen, …
classclass HTraversable (t :: (Type -> Type) -> Type) where
#

Deprecated. Replace with Hedgehog.TraversableB (defined in Data.Functor.Barbie) which can be derived automatically using GHC.Generics

Methods

newtypenewtype Opaque a
#

Constructors

Instances3Eq, Ord, Show
  • Eq a => Eq (Opaque a)Defined in hedgehog-1.7 · Hedgehog.Internal.Opaque
  • Ord a => Ord (Opaque a)Defined in hedgehog-1.7 · Hedgehog.Internal.Opaque
  • Show (Opaque a)Defined in hedgehog-1.7 · Hedgehog.Internal.Opaque
newtypenewtype Confidence
#
Instances5Eq, Num, Ord, Show, Lift
  • Eq ConfidenceDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Num ConfidenceDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Ord ConfidenceDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Show ConfidenceDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Lift ConfidenceDefined in hedgehog-1.7 · Hedgehog.Internal.Property
newtypenewtype DiscardLimit
#
Instances8Enum, Eq, Integral, Num, Ord, Real, …
newtypenewtype GroupName
#
Instances6Eq, Ord, Show, IsString, Semigroup, Lift
newtypenewtype LabelName
#
Instances6Eq, Ord, Show, IsString, Semigroup, Monoid
classclass Monad m => MonadTest (m :: Type -> Type) where
#

Methods

Instances14MonadTest, …
newtypenewtype PropertyName
#
Instances6Eq, Ord, Show, IsString, Semigroup, Lift
newtypenewtype PropertyT (m :: Type -> Type) a
#
Instances23MonadTrans, MonadTransDistributive, MFunctor, MonadError, MonadReader, MonadState, …
newtypenewtype ShrinkLimit
#
Instances8Enum, Eq, Integral, Num, Ord, Real, …
newtypenewtype ShrinkRetries
#
Instances8Enum, Eq, Integral, Num, Ord, Real, …
datadata Skip
#
Instances5Eq, Ord, Show, IsString, Lift
  • Eq SkipDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Ord SkipDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Show SkipDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • IsString SkipDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Lift SkipDefined in hedgehog-1.7 · Hedgehog.Internal.Property
newtypenewtype TestLimit
#
Instances8Enum, Eq, Integral, Num, Ord, Real, …
  • Enum TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Eq TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Integral TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Num TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Ord TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Real TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Show TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
  • Lift TestLimitDefined in hedgehog-1.7 · Hedgehog.Internal.Property
newtypenewtype TestT (m :: Type -> Type) a
#
Instances23MonadTrans, MonadTransControl, MonadTransDistributive, MFunctor, MonadError, MonadReader, …
datadata Range a
#
Instances1Functor
  • Functor RangeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
newtypenewtype Size
#

Constructors

Instances8Enum, Eq, Integral, Num, Ord, Read, …
  • Enum SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Eq SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Integral SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Num SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Ord SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Read SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Real SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
  • Show SizeDefined in hedgehog-1.7 · Hedgehog.Internal.Range
datadata Seed
#
Instances6Eq, Ord, Read, Show, RandomGen, Lift
  • Eq SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
  • Ord SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
  • Read SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
  • Show SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
  • RandomGen SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
  • Lift SeedDefined in hedgehog-1.7 · Hedgehog.Internal.Seed
newtypenewtype Concrete a where
#

Constructors

Instances9Functor, Foldable, Traversable, Eq1, Ord1, Show1, …
datadata Symbolic a where
#
Instances6Eq1, Ord1, Show1, Eq, Ord, Show
  • Eq1 SymbolicDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Ord1 SymbolicDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Show1 SymbolicDefined in hedgehog-1.7 · Hedgehog.Internal.State
  • Eq (Symbolic a)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • Ord (Symbolic a)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • Show (Symbolic a)Defined in hedgehog-1.7 · Hedgehog.Internal.State
newtypenewtype Var a (v :: Type -> Type)
#

Constructors

Instances5FunctorB, TraversableB, Eq, Ord, Show
  • FunctorB (Var a)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • TraversableB (Var a)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • (Eq a, Eq1 v) => Eq (Var a v)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • (Ord a, Ord1 v) => Ord (Var a v)Defined in hedgehog-1.7 · Hedgehog.Internal.State
  • (Show a, Show1 v) => Show (Var a v)Defined in hedgehog-1.7 · Hedgehog.Internal.State