Lift the standard compare function through the type constructor.
Modulererebase-1.21.2Haskell2010
Data.Functor.Classes
- 8 classes
- 28 values
- Packagererebase-1.21.2
- Exports36
- LanguageHaskell2010
- LicenceMIT
- SourceClasses.hs
Lift the standard compare function through the type constructor.
Lift the standard (==) function through the type constructor.
Lift the standard (==) function through the type constructor.
A possible replacement definition for the liftReadList2 method. This is only needed for Read2 instances where liftReadListPrec2 isn't defined as liftReadListPrec2Default.
A possible replacement definition for the liftReadList method. This is only needed for Read1 instances where liftReadListPrec isn't defined as liftReadListPrecDefault.
A possible replacement definition for the liftReadListPrec2 method, defined using liftReadPrec2.
A possible replacement definition for the liftReadListPrec method, defined using liftReadPrec.
readBinaryWith rp1 rp2 n c' matches the name of a binary
data constructor and then parses its arguments using rp1 and rp2
respectively.
readData p is a parser for datatypes where each alternative
begins with a data constructor. It parses the constructor and
passes it to p. Parsers for various constructors can be constructed
with readUnaryWith and readBinaryWith, and combined with
(<|>) from the Alternative class.
Lift the standard readPrec and readListPrec functions through the type constructor.
Lift the standard readPrec function through the type constructor.
readUnaryWith rp n c' matches the name of a unary data constructor
and then parses its argument using rp.
Deprecated. Use readsBinaryWith to define liftReadsPrec
readsBinary1 n c n' matches the name of a binary data constructor
and then parses its arguments using readsPrec1.
readsBinaryWith rp1 rp2 n c n' matches the name of a binary
data constructor and then parses its arguments using rp1 and rp2
respectively.
readsData p d is a parser for datatypes where each alternative
begins with a data constructor. It parses the constructor and
passes it to p. Parsers for various constructors can be constructed
with readsUnary, readsUnary1 and readsBinary1, and combined with
mappend from the Monoid class.
Lift the standard readsPrec function through the type constructor.
Deprecated. Use readsUnaryWith to define liftReadsPrec
readsUnary n c n' matches the name of a unary data constructor
and then parses its argument using readsPrec.
Deprecated. Use readsUnaryWith to define liftReadsPrec
readsUnary1 n c n' matches the name of a unary data constructor
and then parses its argument using readsPrec1.
readsUnaryWith rp n c n' matches the name of a unary data constructor
and then parses its argument using rp.
Deprecated. Use showsBinaryWith to define liftShowsPrec
showsBinary1 n d x y produces the string representation of a binary
data constructor with name n and arguments x and y, in precedence
context d.
showsBinaryWith sp1 sp2 n d x y produces the string
representation of a binary data constructor with name n and arguments
x and y, in precedence context d.
Lift the standard showsPrec function through the type constructor.
Deprecated. Use showsUnaryWith to define liftShowsPrec
showsUnary n d x produces the string representation of a unary data
constructor with name n and argument x, in precedence context d.
Deprecated. Use showsUnaryWith to define liftShowsPrec
showsUnary1 n d x produces the string representation of a unary data
constructor with name n and argument x, in precedence context d.
showsUnaryWith sp n d x produces the string representation of a
unary data constructor with name n and argument x, in precedence
context d.
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.
Methods
Instances83Eq1, …
Eq1 ComplexDefined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression eq1 (1 :+ 2) (1 :+ 2)True
Example1 expression eq1 (1 :+ 2) (1 :+ 3)False
Eq1 SCCDefined in containers-0.7 · Data.GraphEq1 IntMapDefined in containers-0.7 · Data.IntMap.InternalEq1 SeqDefined in containers-0.7 · Data.Sequence.InternalEq1 SetDefined in containers-0.7 · Data.Set.InternalEq1 TreeDefined in containers-0.7 · Data.TreeEq1 NonEmptyDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 IdentityDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 DownDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 Par1Defined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 MaybeDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 SoloDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 HashedDefined in hashable-1.4.7.0 · Data.Hashable.ClassEq1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.ArrayEq1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArrayEq1 HashSetDefined in unordered-containers-0.2.21 · Data.HashSet.InternalEq1 VectorDefined in vector-0.13.2.0 · Data.VectorEq1 VectorDefined in vector-0.13.2.0 · Data.Vector.StrictEq1 []Defined in base-4.20.2.0 · Data.Functor.ClassesEq1 ProxyDefined in base-4.20.2.0 · Data.Functor.ClassesEq1 U1Defined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UAddrDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UCharDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UDoubleDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UFloatDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UIntDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 UWordDefined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 V1Defined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 f => Eq1 (Ap f)Defined in free-5.2 · Control.Applicative.FreeEq1 f => Eq1 (Cofree f)Defined in free-5.2 · Control.Comonad.CofreeEq1 f => Eq1 (Free f)Defined in free-5.2 · Control.Monad.FreeEq1 f => Eq1 (Free f)Defined in free-5.2 · Control.Monad.Free.ApEq1 f => Eq1 (Coyoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.CoyonedaEq1 f => Eq1 (Yoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.YonedaEq1 f => Eq1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.LiftEq1 m => Eq1 (IterT m)Defined in free-5.2 · Control.Monad.Trans.IterEq1 m => Eq1 (MaybeT m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.MaybeEq1 w => Eq1 (CoiterT w)Defined in free-5.2 · Control.Comonad.Trans.CoiterEq a => Eq1 (Either a)Defined in base-4.20.2.0 · Data.Functor.ClassesEq a => Eq1 (Tuple2 a)Defined in base-4.20.2.0 · Data.Functor.ClassesEq k => Eq1 (Map k)Defined in containers-0.7 · Data.Map.InternalEq 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.InternalEq1 (Tagged s)Defined in tagged-0.8.9 · Data.TaggedEq1 (Bundle Id v)Defined in vector-0.13.2.0 · Data.Vector.Fusion.Bundle · orphanEq1 (bi a) => Eq1 (Biap bi a)Defined in bifunctors-5.6.2 · Data.Bifunctor.BiapEq1 f => Eq1 (Rec1 f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 f => Eq1 (Backwards f)Defined in transformers-0.6.1.1 · Control.Applicative.BackwardsEq1 f => Eq1 (IdentityT f)Defined in transformers-0.6.1.1 · Control.Monad.Trans.IdentityEq1 f => Eq1 (Reverse f)Defined in transformers-0.6.1.1 · Data.Functor.ReverseEq2 p => Eq1 (Fix p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FixEq2 p => Eq1 (Join p)Defined in bifunctors-5.6.2 · Data.Bifunctor.JoinEq a => Eq1 (Const a)Defined in base-4.20.2.0 · Data.Functor.ClassesEq a => Eq1 (Constant a)Defined in transformers-0.6.1.1 · Data.Functor.Constant(Eq1 f, Eq1 m) => Eq1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free(Eq1 f, Eq1 m) => Eq1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Eq1 f, Eq a) => Eq1 (CofreeF f a)Defined in free-5.2 · Control.Comonad.Trans.Cofree(Eq1 f, Eq a) => Eq1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free(Eq1 f, Eq a) => Eq1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Eq1 f, Eq e) => Eq1 (ExceptT e f)Defined in selective-0.7.0.1 · Control.Selective.Trans.Except(Functor f, Monad m, Eq1 f, Eq1 m) => Eq1 (FT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Church(Generic1 f, Eq1 (Rep1 f)) => Eq1 (Generically1 f)Defined in base-4.20.2.0 · Data.Functor.Classes(Eq a, Eq b) => Eq1 (Tuple3 a b)Defined in base-4.20.2.0 · Data.Functor.Classes(Eq e, Eq1 m) => Eq1 (ExceptT e m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Except(Eq w, Eq1 m) => Eq1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.Lazy(Eq w, Eq1 m) => Eq1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.StrictEq c => Eq1 (K1 i c)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Eq1 f, Eq1 g) => Eq1 (Product f g)Defined in base-4.20.2.0 · Data.Functor.Product(Eq1 f, Eq1 g) => Eq1 (Sum f g)Defined in base-4.20.2.0 · Data.Functor.Sum(Eq1 f, Eq1 g) => Eq1 (f :*: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Eq1 f, Eq1 g) => Eq1 (f :+: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Eq a, Eq b, Eq c) => Eq1 (Tuple4 a b c)Defined in base-4.20.2.0 · Data.Functor.ClassesEq1 f => Eq1 (M1 i c f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanEq1 g => Eq1 (Joker g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Joker(Eq1 f, Eq1 g) => Eq1 (Compose f g)Defined in base-4.20.2.0 · Data.Functor.Compose(Eq1 f, Eq1 g) => Eq1 (f :.: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Eq1 f, Eq a) => Eq1 (Clown f a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Clown(Eq2 p, Eq a) => Eq1 (Flip p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Flip(Eq2 p, Eq a) => Eq1 (WrappedBifunctor p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Eq2 f, Eq2 g, Eq a) => Eq1 (Product f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Eq2 f, Eq2 g, Eq a) => Eq1 (Sum f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Eq1 f, Eq2 p, Eq a) => Eq1 (Tannen f p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Eq2 p, Eq1 f, Eq1 g, Eq a) => Eq1 (Biff p f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
Lifting of the Eq class to binary type constructors.
Methods
liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> f a c -> f b d -> BoolLift equality tests through the type constructor.
The function will usually be applied to equality functions, but the more general type ensures that the implementation uses them to compare elements of the first container with elements of the second.
Instances21Eq2, …
Eq2 MapDefined in containers-0.7 · Data.Map.InternalEq2 EitherDefined in base-4.20.2.0 · Data.Functor.ClassesEq2 Tuple2Defined in base-4.20.2.0 · Data.Functor.ClassesEq2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.InternalEq1 f => Eq2 (CofreeF f)Defined in free-5.2 · Control.Comonad.Trans.CofreeEq1 f => Eq2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.FreeEq1 f => Eq2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.Free.ApEq2 ConstDefined in base-4.20.2.0 · Data.Functor.ClassesEq2 TaggedDefined in tagged-0.8.9 · Data.TaggedEq2 ConstantDefined in transformers-0.6.1.1 · Data.Functor.ConstantEq2 bi => Eq2 (Biap bi)Defined in bifunctors-5.6.2 · Data.Bifunctor.BiapEq a => Eq2 (Tuple3 a)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression eq2 ('x', True, "str") ('x', True, "str")True
(Eq a, Eq b) => Eq2 (Tuple4 a b)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression eq2 ('x', True, "str", 2) ('x', True, "str", 2 :: Int)True
Eq1 f => Eq2 (Clown f)Defined in bifunctors-5.6.2 · Data.Bifunctor.ClownEq1 g => Eq2 (Joker g)Defined in bifunctors-5.6.2 · Data.Bifunctor.JokerEq2 p => Eq2 (Flip p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FlipEq2 p => Eq2 (WrappedBifunctor p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Eq2 f, Eq2 g) => Eq2 (Product f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Eq2 f, Eq2 g) => Eq2 (Sum f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Eq1 f, Eq2 p) => Eq2 (Tannen f p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Eq2 p, Eq1 f, Eq1 g) => Eq2 (Biff p f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
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.
Methods
liftCompare :: (a -> b -> Ordering) -> f a -> f b -> OrderingLift a compare function through the type constructor.
The function will usually be applied to a comparison function, but the more general type ensures that the implementation uses it to compare elements of the first container with elements of the second.
Instances81Ord1, …
Ord1 IntMapDefined in containers-0.7 · Data.IntMap.InternalOrd1 SeqDefined in containers-0.7 · Data.Sequence.InternalOrd1 SetDefined in containers-0.7 · Data.Set.InternalOrd1 TreeDefined in containers-0.7 · Data.TreeOrd1 NonEmptyDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 IdentityDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 DownDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 Par1Defined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 MaybeDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 SoloDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 HashedDefined in hashable-1.4.7.0 · Data.Hashable.ClassOrd1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.ArrayOrd1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArrayOrd1 HashSetDefined in unordered-containers-0.2.21 · Data.HashSet.InternalOrd1 VectorDefined in vector-0.13.2.0 · Data.VectorOrd1 VectorDefined in vector-0.13.2.0 · Data.Vector.StrictOrd1 []Defined in base-4.20.2.0 · Data.Functor.ClassesOrd1 ProxyDefined in base-4.20.2.0 · Data.Functor.ClassesOrd1 U1Defined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UAddrDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UCharDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UDoubleDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UFloatDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UIntDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 UWordDefined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 V1Defined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 f => Ord1 (Ap f)Defined in free-5.2 · Control.Applicative.FreeOrd1 f => Ord1 (Cofree f)Defined in free-5.2 · Control.Comonad.CofreeOrd1 f => Ord1 (Free f)Defined in free-5.2 · Control.Monad.FreeOrd1 f => Ord1 (Free f)Defined in free-5.2 · Control.Monad.Free.ApOrd1 f => Ord1 (Coyoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.CoyonedaOrd1 f => Ord1 (Yoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.YonedaOrd1 f => Ord1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.LiftOrd1 m => Ord1 (IterT m)Defined in free-5.2 · Control.Monad.Trans.IterOrd1 m => Ord1 (MaybeT m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.MaybeOrd1 w => Ord1 (CoiterT w)Defined in free-5.2 · Control.Comonad.Trans.CoiterOrd a => Ord1 (Either a)Defined in base-4.20.2.0 · Data.Functor.ClassesOrd a => Ord1 (Tuple2 a)Defined in base-4.20.2.0 · Data.Functor.ClassesOrd k => Ord1 (Map k)Defined in containers-0.7 · Data.Map.InternalOrd 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.InternalOrd1 (Tagged s)Defined in tagged-0.8.9 · Data.TaggedOrd1 (Bundle Id v)Defined in vector-0.13.2.0 · Data.Vector.Fusion.Bundle · orphanOrd1 (bi a) => Ord1 (Biap bi a)Defined in bifunctors-5.6.2 · Data.Bifunctor.BiapOrd1 f => Ord1 (Rec1 f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 f => Ord1 (Backwards f)Defined in transformers-0.6.1.1 · Control.Applicative.BackwardsOrd1 f => Ord1 (IdentityT f)Defined in transformers-0.6.1.1 · Control.Monad.Trans.IdentityOrd1 f => Ord1 (Reverse f)Defined in transformers-0.6.1.1 · Data.Functor.ReverseOrd2 p => Ord1 (Fix p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FixOrd2 p => Ord1 (Join p)Defined in bifunctors-5.6.2 · Data.Bifunctor.JoinOrd a => Ord1 (Const a)Defined in base-4.20.2.0 · Data.Functor.ClassesOrd a => Ord1 (Constant a)Defined in transformers-0.6.1.1 · Data.Functor.Constant(Ord1 f, Ord1 m) => Ord1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free(Ord1 f, Ord1 m) => Ord1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Ord1 f, Ord a) => Ord1 (CofreeF f a)Defined in free-5.2 · Control.Comonad.Trans.Cofree(Ord1 f, Ord a) => Ord1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free(Ord1 f, Ord a) => Ord1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Ord1 f, Ord e) => Ord1 (ExceptT e f)Defined in selective-0.7.0.1 · Control.Selective.Trans.Except(Functor f, Monad m, Ord1 f, Ord1 m) => Ord1 (FT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Church(Generic1 f, Ord1 (Rep1 f)) => Ord1 (Generically1 f)Defined in base-4.20.2.0 · Data.Functor.Classes(Ord a, Ord b) => Ord1 (Tuple3 a b)Defined in base-4.20.2.0 · Data.Functor.Classes(Ord e, Ord1 m) => Ord1 (ExceptT e m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Except(Ord w, Ord1 m) => Ord1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.Lazy(Ord w, Ord1 m) => Ord1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.StrictOrd c => Ord1 (K1 i c)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Ord1 f, Ord1 g) => Ord1 (Product f g)Defined in base-4.20.2.0 · Data.Functor.Product(Ord1 f, Ord1 g) => Ord1 (Sum f g)Defined in base-4.20.2.0 · Data.Functor.Sum(Ord1 f, Ord1 g) => Ord1 (f :*: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Ord1 f, Ord1 g) => Ord1 (f :+: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Ord a, Ord b, Ord c) => Ord1 (Tuple4 a b c)Defined in base-4.20.2.0 · Data.Functor.ClassesOrd1 f => Ord1 (M1 i c f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanOrd1 g => Ord1 (Joker g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Joker(Ord1 f, Ord1 g) => Ord1 (Compose f g)Defined in base-4.20.2.0 · Data.Functor.Compose(Ord1 f, Ord1 g) => Ord1 (f :.: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Ord1 f, Ord a) => Ord1 (Clown f a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Clown(Ord2 p, Ord a) => Ord1 (Flip p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Flip(Ord2 p, Ord a) => Ord1 (WrappedBifunctor p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Ord2 f, Ord2 g, Ord a) => Ord1 (Product f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Ord2 f, Ord2 g, Ord a) => Ord1 (Sum f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Ord1 f, Ord2 p, Ord a) => Ord1 (Tannen f p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Ord2 p, Ord1 f, Ord1 g, Ord a) => Ord1 (Biff p f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
Lifting of the Ord class to binary type constructors.
Methods
liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> f a c -> f b d -> OrderingLift compare functions through the type constructor.
The function will usually be applied to comparison functions, but the more general type ensures that the implementation uses them to compare elements of the first container with elements of the second.
Instances21Ord2, …
Ord2 MapDefined in containers-0.7 · Data.Map.InternalOrd2 EitherDefined in base-4.20.2.0 · Data.Functor.ClassesOrd2 Tuple2Defined in base-4.20.2.0 · Data.Functor.ClassesOrd2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.InternalOrd1 f => Ord2 (CofreeF f)Defined in free-5.2 · Control.Comonad.Trans.CofreeOrd1 f => Ord2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.FreeOrd1 f => Ord2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.Free.ApOrd2 ConstDefined in base-4.20.2.0 · Data.Functor.ClassesOrd2 TaggedDefined in tagged-0.8.9 · Data.TaggedOrd2 ConstantDefined in transformers-0.6.1.1 · Data.Functor.ConstantOrd2 bi => Ord2 (Biap bi)Defined in bifunctors-5.6.2 · Data.Bifunctor.BiapOrd a => Ord2 (Tuple3 a)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression compare2 ('x', True, "aaa") ('x', True, "zzz")LT
(Ord a, Ord b) => Ord2 (Tuple4 a b)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression compare2 ('x', True, "str", 2) ('x', True, "str", 3 :: Int)LT
Ord1 f => Ord2 (Clown f)Defined in bifunctors-5.6.2 · Data.Bifunctor.ClownOrd1 g => Ord2 (Joker g)Defined in bifunctors-5.6.2 · Data.Bifunctor.JokerOrd2 p => Ord2 (Flip p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FlipOrd2 p => Ord2 (WrappedBifunctor p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Ord2 f, Ord2 g) => Ord2 (Product f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Ord2 f, Ord2 g) => Ord2 (Sum f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Ord1 f, Ord2 p) => Ord2 (Tannen f p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Ord2 p, Ord1 f, Ord1 g) => Ord2 (Biff p f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
Lifting of the Read class to unary type constructors.
Any instance should be subject to the following laws that canonicity is preserved:
liftReadsPrec readsPrec readList = readsPrec
liftReadList readsPrec readList = readList
liftReadPrec readPrec readListPrec = readPrec
liftReadListPrec readPrec readListPrec = readListPrec
This class therefore represents the generalization of Read 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.
Both liftReadsPrec and liftReadPrec exist to match the interface provided in the Read type class, but it is recommended to implement Read1 instances using liftReadPrec as opposed to liftReadsPrec, since the former is more efficient than the latter. For example:
instance Read1 T where
liftReadPrec = ...
liftReadListPrec = liftReadListPrecDefault
For more information, refer to the documentation for the Read class.
Methods
liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (f a)liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [f a]liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (f a)readPrec function for an application of the type constructor based on readPrec and readListPrec functions for the argument type.
liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [f a]readListPrec function for an application of the type constructor based on readPrec and readListPrec functions for the argument type.
The default definition uses liftReadList. Instances that define liftReadPrec should also define liftReadListPrec as liftReadListPrecDefault.
Instances69Read1, …
Read1 ComplexDefined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression readPrec_to_S readPrec1 0 "(2 % 3) :+ (3 % 4)" :: [(Complex Rational, String)][(2 % 3 :+ 3 % 4,"")]
Read1 SCCDefined in containers-0.7 · Data.GraphRead1 IntMapDefined in containers-0.7 · Data.IntMap.InternalRead1 SeqDefined in containers-0.7 · Data.Sequence.InternalRead1 TreeDefined in containers-0.7 · Data.TreeRead1 NonEmptyDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 IdentityDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 DownDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 Par1Defined in base-orphans-0.9.3 · Data.Orphans · orphanRead1 MaybeDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 SoloDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.ArrayRead1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArrayRead1 VectorDefined in vector-0.13.2.0 · Data.VectorRead1 VectorDefined in vector-0.13.2.0 · Data.Vector.StrictRead1 []Defined in base-4.20.2.0 · Data.Functor.ClassesRead1 ProxyDefined in base-4.20.2.0 · Data.Functor.ClassesRead1 U1Defined in base-orphans-0.9.3 · Data.Orphans · orphanRead1 V1Defined in base-orphans-0.9.3 · Data.Orphans · orphanRead1 f => Read1 (Cofree f)Defined in free-5.2 · Control.Comonad.CofreeRead1 f => Read1 (Free f)Defined in free-5.2 · Control.Monad.FreeRead1 f => Read1 (Free f)Defined in free-5.2 · Control.Monad.Free.ApRead1 f => Read1 (Coyoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.CoyonedaRead1 f => Read1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.LiftRead1 m => Read1 (IterT m)Defined in free-5.2 · Control.Monad.Trans.IterRead1 m => Read1 (MaybeT m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.MaybeRead1 w => Read1 (CoiterT w)Defined in free-5.2 · Control.Comonad.Trans.CoiterRead a => Read1 (Either a)Defined in base-4.20.2.0 · Data.Functor.ClassesRead a => Read1 (Tuple2 a)Defined in base-4.20.2.0 · Data.Functor.Classes(Read1 f, Functor f) => Read1 (Yoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.Yoneda(Ord k, Read k) => Read1 (Map k)Defined in containers-0.7 · Data.Map.Internal(Hashable k, Read k) => Read1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal(GRead1 NonV4 (Rep1 f), Generic1 f) => Read1 (FunctorClassesDefault f)Defined in transformers-compat-0.7.2 · Data.Functor.Classes.Generic.InternalRead1 (Tagged s)Defined in tagged-0.8.9 · Data.TaggedRead1 f => Read1 (Rec1 f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanRead1 f => Read1 (Backwards f)Defined in transformers-0.6.1.1 · Control.Applicative.BackwardsRead1 f => Read1 (IdentityT f)Defined in transformers-0.6.1.1 · Control.Monad.Trans.IdentityRead1 f => Read1 (Reverse f)Defined in transformers-0.6.1.1 · Data.Functor.ReverseRead2 p => Read1 (Fix p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FixRead2 p => Read1 (Join p)Defined in bifunctors-5.6.2 · Data.Bifunctor.JoinRead a => Read1 (Const a)Defined in base-4.20.2.0 · Data.Functor.ClassesRead a => Read1 (Constant a)Defined in transformers-0.6.1.1 · Data.Functor.Constant(Read1 f, Read1 m) => Read1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free(Read1 f, Read1 m) => Read1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Read1 f, Read a) => Read1 (CofreeF f a)Defined in free-5.2 · Control.Comonad.Trans.Cofree(Read1 f, Read a) => Read1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free(Read1 f, Read a) => Read1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Read1 f, Read e) => Read1 (ExceptT e f)Defined in selective-0.7.0.1 · Control.Selective.Trans.Except(Read a, Read b) => Read1 (Tuple3 a b)Defined in base-4.20.2.0 · Data.Functor.Classes(Read e, Read1 m) => Read1 (ExceptT e m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Except(Read w, Read1 m) => Read1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.Lazy(Read w, Read1 m) => Read1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.StrictRead c => Read1 (K1 i c)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Read1 f, Read1 g) => Read1 (Product f g)Defined in base-4.20.2.0 · Data.Functor.Product(Read1 f, Read1 g) => Read1 (Sum f g)Defined in base-4.20.2.0 · Data.Functor.Sum(Read1 f, Read1 g) => Read1 (f :*: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Read1 f, Read1 g) => Read1 (f :+: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Read a, Read b, Read c) => Read1 (Tuple4 a b c)Defined in base-4.20.2.0 · Data.Functor.ClassesRead1 f => Read1 (M1 i c f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanRead1 g => Read1 (Joker g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Joker(Read1 f, Read1 g) => Read1 (Compose f g)Defined in base-4.20.2.0 · Data.Functor.Compose(Read1 f, Read1 g) => Read1 (f :.: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Read1 f, Read a) => Read1 (Clown f a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Clown(Read2 p, Read a) => Read1 (Flip p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Flip(Read2 p, Read a) => Read1 (WrappedBifunctor p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Read2 f, Read2 g, Read a) => Read1 (Product f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Read2 f, Read2 g, Read a) => Read1 (Sum f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Read1 f, Read2 p, Read a) => Read1 (Tannen f p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Read2 p, Read1 f, Read1 g, Read a) => Read1 (Biff p f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
Lifting of the Read class to binary type constructors.
Both liftReadsPrec2 and liftReadPrec2 exist to match the interface provided in the Read type class, but it is recommended to implement Read2 instances using liftReadPrec2 as opposed to liftReadsPrec2, since the former is more efficient than the latter. For example:
instance Read2 T where
liftReadPrec2 = ...
liftReadListPrec2 = liftReadListPrec2Default
For more information, refer to the documentation for the Read class.
Methods
liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (f a b)liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [f a b]liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (f a b)readPrec function for an application of the type constructor based on readPrec and readListPrec functions for the argument types.
liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [f a b]readListPrec function for an application of the type constructor based on readPrec and readListPrec functions for the argument types.
The default definition uses liftReadList2. Instances that define liftReadPrec2 should also define liftReadListPrec2 as liftReadListPrec2Default.
Instances18Read2, …
Read2 EitherDefined in base-4.20.2.0 · Data.Functor.ClassesRead2 Tuple2Defined in base-4.20.2.0 · Data.Functor.ClassesRead1 f => Read2 (CofreeF f)Defined in free-5.2 · Control.Comonad.Trans.CofreeRead1 f => Read2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.FreeRead1 f => Read2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.Free.ApRead2 ConstDefined in base-4.20.2.0 · Data.Functor.ClassesRead2 TaggedDefined in tagged-0.8.9 · Data.TaggedRead2 ConstantDefined in transformers-0.6.1.1 · Data.Functor.ConstantRead a => Read2 (Tuple3 a)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression readPrec_to_S readPrec2 0 "('x', True, 2)" :: [((Char, Bool, Int), String)][(('x',True,2),"")]
(Read a, Read b) => Read2 (Tuple4 a b)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression readPrec_to_S readPrec2 0 "('x', True, 2, 4.5)" :: [((Char, Bool, Int, Double), String)][(('x',True,2,4.5),"")]
Read1 f => Read2 (Clown f)Defined in bifunctors-5.6.2 · Data.Bifunctor.ClownRead1 g => Read2 (Joker g)Defined in bifunctors-5.6.2 · Data.Bifunctor.JokerRead2 p => Read2 (Flip p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FlipRead2 p => Read2 (WrappedBifunctor p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Read2 f, Read2 g) => Read2 (Product f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Read2 f, Read2 g) => Read2 (Sum f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Read1 f, Read2 p) => Read2 (Tannen f p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Read2 p, Read1 f, Read1 g) => Read2 (Biff p f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
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.
Methods
Instances78Show1, …
Show1 ComplexDefined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression showsPrec1 0 (2 :+ 3) """2 :+ 3"
Show1 SCCDefined in containers-0.7 · Data.GraphShow1 IntMapDefined in containers-0.7 · Data.IntMap.InternalShow1 SeqDefined in containers-0.7 · Data.Sequence.InternalShow1 SetDefined in containers-0.7 · Data.Set.InternalShow1 TreeDefined in containers-0.7 · Data.TreeShow1 NonEmptyDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 IdentityDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 DownDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 Par1Defined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 MaybeDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 SoloDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 HashedDefined in hashable-1.4.7.0 · Data.Hashable.ClassShow1 ArrayDefined in primitive-0.9.1.0 · Data.Primitive.ArrayShow1 SmallArrayDefined in primitive-0.9.1.0 · Data.Primitive.SmallArrayShow1 HashSetDefined in unordered-containers-0.2.21 · Data.HashSet.InternalShow1 VectorDefined in vector-0.13.2.0 · Data.VectorShow1 VectorDefined in vector-0.13.2.0 · Data.Vector.StrictShow1 []Defined in base-4.20.2.0 · Data.Functor.ClassesShow1 ProxyDefined in base-4.20.2.0 · Data.Functor.ClassesShow1 U1Defined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UAddrDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UCharDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UDoubleDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UFloatDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UIntDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 UWordDefined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 V1Defined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 f => Show1 (Cofree f)Defined in free-5.2 · Control.Comonad.CofreeShow1 f => Show1 (Free f)Defined in free-5.2 · Control.Monad.FreeShow1 f => Show1 (Free f)Defined in free-5.2 · Control.Monad.Free.ApShow1 f => Show1 (Yoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.YonedaShow1 f => Show1 (Lift f)Defined in transformers-0.6.1.1 · Control.Applicative.LiftShow1 m => Show1 (IterT m)Defined in free-5.2 · Control.Monad.Trans.IterShow1 m => Show1 (MaybeT m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.MaybeShow1 w => Show1 (CoiterT w)Defined in free-5.2 · Control.Comonad.Trans.CoiterShow a => Show1 (Either a)Defined in base-4.20.2.0 · Data.Functor.ClassesShow a => Show1 (Tuple2 a)Defined in base-4.20.2.0 · Data.Functor.ClassesShow k => Show1 (Map k)Defined in containers-0.7 · Data.Map.InternalShow k => Show1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal(Functor f, Show1 f) => Show1 (Coyoneda f)Defined in kan-extensions-5.2.7 · Data.Functor.Coyoneda(GShow1 NonV4 (Rep1 f), Generic1 f) => Show1 (FunctorClassesDefault f)Defined in transformers-compat-0.7.2 · Data.Functor.Classes.Generic.InternalShow1 (Tagged s)Defined in tagged-0.8.9 · Data.TaggedShow1 f => Show1 (Rec1 f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 f => Show1 (Backwards f)Defined in transformers-0.6.1.1 · Control.Applicative.BackwardsShow1 f => Show1 (IdentityT f)Defined in transformers-0.6.1.1 · Control.Monad.Trans.IdentityShow1 f => Show1 (Reverse f)Defined in transformers-0.6.1.1 · Data.Functor.ReverseShow2 p => Show1 (Fix p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FixShow2 p => Show1 (Join p)Defined in bifunctors-5.6.2 · Data.Bifunctor.JoinShow a => Show1 (Const a)Defined in base-4.20.2.0 · Data.Functor.ClassesShow a => Show1 (Constant a)Defined in transformers-0.6.1.1 · Data.Functor.Constant(Show1 f, Show1 m) => Show1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free(Show1 f, Show1 m) => Show1 (FreeT f m)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Show1 f, Show a) => Show1 (CofreeF f a)Defined in free-5.2 · Control.Comonad.Trans.Cofree(Show1 f, Show a) => Show1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free(Show1 f, Show a) => Show1 (FreeF f a)Defined in free-5.2 · Control.Monad.Trans.Free.Ap(Show1 f, Show e) => Show1 (ExceptT e f)Defined in selective-0.7.0.1 · Control.Selective.Trans.Except(Show a, Show b) => Show1 (Tuple3 a b)Defined in base-4.20.2.0 · Data.Functor.Classes(Show e, Show1 m) => Show1 (ExceptT e m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Except(Show w, Show1 m) => Show1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.Lazy(Show w, Show1 m) => Show1 (WriterT w m)Defined in transformers-0.6.1.1 · Control.Monad.Trans.Writer.StrictShow c => Show1 (K1 i c)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Show1 f, Show1 g) => Show1 (Product f g)Defined in base-4.20.2.0 · Data.Functor.Product(Show1 f, Show1 g) => Show1 (Sum f g)Defined in base-4.20.2.0 · Data.Functor.Sum(Show1 f, Show1 g) => Show1 (f :*: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Show1 f, Show1 g) => Show1 (f :+: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Show a, Show b, Show c) => Show1 (Tuple4 a b c)Defined in base-4.20.2.0 · Data.Functor.ClassesShow1 f => Show1 (M1 i c f)Defined in base-orphans-0.9.3 · Data.Orphans · orphanShow1 g => Show1 (Joker g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Joker(Show1 f, Show1 g) => Show1 (Compose f g)Defined in base-4.20.2.0 · Data.Functor.Compose(Show1 f, Show1 g) => Show1 (f :.: g)Defined in base-orphans-0.9.3 · Data.Orphans · orphan(Show1 f, Show a) => Show1 (Clown f a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Clown(Show2 p, Show a) => Show1 (Flip p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Flip(Show2 p, Show a) => Show1 (WrappedBifunctor p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Show2 f, Show2 g, Show a) => Show1 (Product f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Show2 f, Show2 g, Show a) => Show1 (Sum f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Show1 f, Show2 p, Show a) => Show1 (Tannen f p a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Show2 p, Show1 f, Show1 g, Show a) => Show1 (Biff p f g a)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff
Lifting of the Show class to binary type constructors.
Methods
Instances20Show2, …
Show2 MapDefined in containers-0.7 · Data.Map.InternalShow2 EitherDefined in base-4.20.2.0 · Data.Functor.ClassesShow2 Tuple2Defined in base-4.20.2.0 · Data.Functor.ClassesShow2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.InternalShow1 f => Show2 (CofreeF f)Defined in free-5.2 · Control.Comonad.Trans.CofreeShow1 f => Show2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.FreeShow1 f => Show2 (FreeF f)Defined in free-5.2 · Control.Monad.Trans.Free.ApShow2 ConstDefined in base-4.20.2.0 · Data.Functor.ClassesShow2 TaggedDefined in tagged-0.8.9 · Data.TaggedShow2 ConstantDefined in transformers-0.6.1.1 · Data.Functor.ConstantShow a => Show2 (Tuple3 a)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression showsPrec2 0 ('x', True, 2 :: Int) """('x',True,2)"
(Show a, Show b) => Show2 (Tuple4 a b)Defined in base-4.20.2.0 · Data.Functor.ClassesExample1 expression showsPrec2 0 ('x', True, 2 :: Int, 4.5 :: Double) """('x',True,2,4.5)"
Show1 f => Show2 (Clown f)Defined in bifunctors-5.6.2 · Data.Bifunctor.ClownShow1 g => Show2 (Joker g)Defined in bifunctors-5.6.2 · Data.Bifunctor.JokerShow2 p => Show2 (Flip p)Defined in bifunctors-5.6.2 · Data.Bifunctor.FlipShow2 p => Show2 (WrappedBifunctor p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Wrapped(Show2 f, Show2 g) => Show2 (Product f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Product(Show2 f, Show2 g) => Show2 (Sum f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Sum(Show1 f, Show2 p) => Show2 (Tannen f p)Defined in bifunctors-5.6.2 · Data.Bifunctor.Tannen(Show2 p, Show1 f, Show1 g) => Show2 (Biff p f g)Defined in bifunctors-5.6.2 · Data.Bifunctor.Biff