Generics.Kind.Examples

Documentation

data Tree a

Constructors

Branch (Tree a) (Tree a)

Leaf a

Instances

Functor Tree

Defined in Generics.Kind.Examples

Methods

fmap :: (a -> b) -> Tree a -> Tree b

(<$) :: a -> Tree b -> Tree a

Eq a => Eq (Tree a)

Defined in Generics.Kind.Examples

Methods

(==) :: Tree a -> Tree a -> Bool

(/=) :: Tree a -> Tree a -> Bool

Generic (Tree a)

Defined in Generics.Kind.Examples

Associated Types

type Rep (Tree a) :: Type -> Type

Methods

from :: Tree a -> Rep (Tree a) x

to :: Rep (Tree a) x -> Tree a

KFunctor Tree (Co ': ([] :: [Variance])) (a :&&: LoT0 :: LoT (Type -> Type)) (b :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

Methods

kfmap :: Mappings (Co ': []) (a :&&: LoT0) (b :&&: LoT0) -> (Tree :@@: (a :&&: LoT0)) -> Tree :@@: (b :&&: LoT0)

GenericK Tree (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

Associated Types

type RepK Tree :: LoT k -> Type

Methods

fromK :: (Tree :@@: (a :&&: LoT0)) -> RepK Tree (a :&&: LoT0)

toK :: RepK Tree (a :&&: LoT0) -> Tree :@@: (a :&&: LoT0)

Split (Tree a) Tree (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

type Rep (Tree a)

Defined in Generics.Kind.Examples

type Rep (Tree a) = D1 (MetaData "Tree" "Generics.Kind.Examples" "kind-generics-0.1.1.0-IvPjNtMPbphFMMCSNUud6G" False) (C1 (MetaCons "Branch" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Tree a)) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Tree a))) :+: C1 (MetaCons "Leaf" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))

type RepK Tree

Defined in Generics.Kind.Examples

type RepK Tree = (F (Tree :$: (V0 :: Atom (Type -> Type) Type)) :*: F (Tree :$: (V0 :: Atom (Type -> Type) Type))) :+: F (V0 :: Atom (Type -> Type) Type)

data WeirdTree a where

Constructors

WeirdBranch :: WeirdTree a -> WeirdTree a -> WeirdTree a

WeirdLeaf :: Show a => t -> a -> WeirdTree a

Instances

Show b => KFunctor WeirdTree (Co ': ([] :: [Variance])) (a :&&: LoT0 :: LoT (Type -> Type)) (b :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

Methods

kfmap :: Mappings (Co ': []) (a :&&: LoT0) (b :&&: LoT0) -> (WeirdTree :@@: (a :&&: LoT0)) -> WeirdTree :@@: (b :&&: LoT0)

GenericK WeirdTree (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

Associated Types

type RepK WeirdTree :: LoT k -> Type

Methods

fromK :: (WeirdTree :@@: (a :&&: LoT0)) -> RepK WeirdTree (a :&&: LoT0)

toK :: RepK WeirdTree (a :&&: LoT0) -> WeirdTree :@@: (a :&&: LoT0)

Split (WeirdTree a) WeirdTree (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

type RepK WeirdTree

Defined in Generics.Kind.Examples

type RepK WeirdTree = (F (WeirdTree :$: (V0 :: Atom (Type -> Type) Type)) :*: F (WeirdTree :$: (V0 :: Atom (Type -> Type) Type))) :+: E ((Show :$: (V1 :: Atom (Type -> Type -> Type) Type)) :=>: (F (V0 :: Atom (Type -> Type -> Type) Type) :*: F (V1 :: Atom (Type -> Type -> Type) Type)))

data WeirdTreeR a where

Constructors

WeirdBranchR :: WeirdTreeR a -> WeirdTreeR a -> WeirdTreeR a

WeirdLeafR :: (Show a, Typeable t, Eq t) => t -> a -> WeirdTreeR a

Instances

Eq a => Eq (WeirdTreeR a)

Defined in Generics.Kind.Examples

Methods

(==) :: WeirdTreeR a -> WeirdTreeR a -> Bool

(/=) :: WeirdTreeR a -> WeirdTreeR a -> Bool

GenericK WeirdTreeR (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

Associated Types

type RepK WeirdTreeR :: LoT k -> Type

Methods

fromK :: (WeirdTreeR :@@: (a :&&: LoT0)) -> RepK WeirdTreeR (a :&&: LoT0)

toK :: RepK WeirdTreeR (a :&&: LoT0) -> WeirdTreeR :@@: (a :&&: LoT0)

Split (WeirdTreeR a) WeirdTreeR (a :&&: LoT0 :: LoT (Type -> Type))

Defined in Generics.Kind.Examples

type RepK WeirdTreeR

Defined in Generics.Kind.Examples

type RepK WeirdTreeR = (F (WeirdTreeR :$: (V0 :: Atom (Type -> Type) Type)) :*: F (WeirdTreeR :$: (V0 :: Atom (Type -> Type) Type))) :+: ERefl ((Show :$: (V1 :: Atom (Type -> Type -> Type) Type)) :=>: ((Eq :$: (V0 :: Atom (Type -> Type -> Type) Type)) :=>: (F (V0 :: Atom (Type -> Type -> Type) Type) :*: F (V1 :: Atom (Type -> Type -> Type) Type))))

Orphan instances

KFunctor Maybe (Co ': ([] :: [Variance])) (a :&&: LoT0 :: LoT (Type -> Type)) (b :&&: LoT0 :: LoT (Type -> Type))

Methods

kfmap :: Mappings (Co ': []) (a :&&: LoT0) (b :&&: LoT0) -> (Maybe :@@: (a :&&: LoT0)) -> Maybe :@@: (b :&&: LoT0)

GenericK Maybe (a :&&: LoT0 :: LoT (Type -> Type))

Associated Types

type RepK Maybe :: LoT k -> Type

Methods

fromK :: (Maybe :@@: (a :&&: LoT0)) -> RepK Maybe (a :&&: LoT0)

toK :: RepK Maybe (a :&&: LoT0) -> Maybe :@@: (a :&&: LoT0)

Split (Maybe a) Maybe (a :&&: LoT0 :: LoT (Type -> Type))