Modulerecursion-schemes-5.2.3Haskell2010

Data.Functor.Base

Base Functors for standard types not already expressed as a fixed point.

4 types

Packagerecursion-schemes-5.2.3
Exports4
LanguageHaskell2010
LicenceBSD-2-Clause
SourceBase.hs

datadata ListF a b

Base functor of [].

Constructors

Nil
Cons a b

Instances22Bifoldable, Bifunctor, Bitraversable, Eq2, Ord2, Read2, …

Bifoldable ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bifunctor ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bitraversable ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq2 ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord2 ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Read2 ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Show2 ListFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic1 (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Functor (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Foldable (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Traversable (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq a => Eq1 (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord a => Ord1 (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Read a => Read1 (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Show a => Show1 (ListF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Eq a, Eq b) => Eq (ListF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Ord a, Ord b) => Ord (ListF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Read a, Read b) => Read (ListF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Show a, Show b) => Show (ListF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic (ListF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep (ListF a b) = D1 ('MetaData "ListF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "Nil" 'PrefixI 'False) U1 :+: C1 ('MetaCons "Cons" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep1 (ListF a) = D1 ('MetaData "ListF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "Nil" 'PrefixI 'False) U1 :+: C1 ('MetaCons "Cons" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1))Defined in recursion-schemes-5.2.3 · Data.Functor.Base

datadata NonEmptyF a b

Base Functor for Data.List.NonEmpty

Constructors

NonEmptyF
- head :: a
- tail :: Maybe b

Instances22Bifoldable, Bifunctor, Bitraversable, Eq2, Ord2, Read2, …

Bifoldable NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bifunctor NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bitraversable NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq2 NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord2 NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Read2 NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Show2 NonEmptyFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic1 (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Functor (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Foldable (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Traversable (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq a => Eq1 (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord a => Ord1 (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Read a => Read1 (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Show a => Show1 (NonEmptyF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Eq a, Eq b) => Eq (NonEmptyF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Ord a, Ord b) => Ord (NonEmptyF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Read a, Read b) => Read (NonEmptyF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Show a, Show b) => Show (NonEmptyF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic (NonEmptyF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep (NonEmptyF a b) = D1 ('MetaData "NonEmptyF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "NonEmptyF" 'PrefixI 'True) (S1 ('MetaSel ('Just "head") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "tail") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe b))))Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep1 (NonEmptyF a) = D1 ('MetaData "NonEmptyF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "NonEmptyF" 'PrefixI 'True) (S1 ('MetaSel ('Just "head") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "tail") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 Maybe)))Defined in recursion-schemes-5.2.3 · Data.Functor.Base

datadata TreeF a b

Base functor for Tree.

Constructors

NodeF a (ForestF a b)

Instances22Bifoldable, Bifunctor, Bitraversable, Eq2, Ord2, Read2, …

Bifoldable TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bifunctor TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Bitraversable TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq2 TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord2 TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Read2 TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Show2 TreeFDefined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic1 (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Functor (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Foldable (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Traversable (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Eq a => Eq1 (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Ord a => Ord1 (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Read a => Read1 (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Show a => Show1 (TreeF a)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Eq a, Eq b) => Eq (TreeF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Ord a, Ord b) => Ord (TreeF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Read a, Read b) => Read (TreeF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
(Show a, Show b) => Show (TreeF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
Generic (TreeF a b)Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep (TreeF a b) = D1 ('MetaData "TreeF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "NodeF" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForestF a b))))Defined in recursion-schemes-5.2.3 · Data.Functor.Base
type Rep1 (TreeF a) = D1 ('MetaData "TreeF" "Data.Functor.Base" "recursion-schemes-5.2.3-Er6QjlkhARDA4qPR4dOJv" 'False) (C1 ('MetaCons "NodeF" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 [])))Defined in recursion-schemes-5.2.3 · Data.Functor.Base

typetype ForestF a b = [b]