Module

Data.Functor.Product.Nested

Package
purescript-functors
Repository
purescript/purescript-functors

#Product1 Source

type Product1 :: forall k. (k -> Type) -> k -> Typetype Product1 a = T2 a (Const Unit)

#Product2 Source

type Product2 :: forall k. (k -> Type) -> (k -> Type) -> k -> Typetype Product2 a b = T3 a b (Const Unit)

#Product3 Source

type Product3 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product3 a b c = T4 a b c (Const Unit)

#Product4 Source

type Product4 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product4 a b c d = T5 a b c d (Const Unit)

#Product5 Source

type Product5 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product5 a b c d e = T6 a b c d e (Const Unit)

#Product6 Source

type Product6 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product6 a b c d e f = T7 a b c d e f (Const Unit)

#Product7 Source

type Product7 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product7 a b c d e f g = T8 a b c d e f g (Const Unit)

#Product8 Source

type Product8 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product8 a b c d e f g h = T9 a b c d e f g h (Const Unit)

#Product9 Source

type Product9 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product9 a b c d e f g h i = T10 a b c d e f g h i (Const Unit)

#Product10 Source

type Product10 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype Product10 a b c d e f g h i j = T11 a b c d e f g h i j (Const Unit)

#T2 Source

type T2 :: forall k. (k -> Type) -> (k -> Type) -> k -> Typetype T2 a z = Product a z

#T3 Source

type T3 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T3 a b z = Product a (T2 b z)

#T4 Source

type T4 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T4 a b c z = Product a (T3 b c z)

#T5 Source

type T5 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T5 a b c d z = Product a (T4 b c d z)

#T6 Source

type T6 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T6 a b c d e z = Product a (T5 b c d e z)

#T7 Source

type T7 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T7 a b c d e f z = Product a (T6 b c d e f z)

#T8 Source

type T8 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T8 a b c d e f g z = Product a (T7 b c d e f g z)

#T9 Source

type T9 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T9 a b c d e f g h z = Product a (T8 b c d e f g h z)

#T10 Source

type T10 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T10 a b c d e f g h i z = Product a (T9 b c d e f g h i z)

#T11 Source

type T11 :: forall k. (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> (k -> Type) -> k -> Typetype T11 a b c d e f g h i j z = Product a (T10 b c d e f g h i j z)

#(</\>) Source

Operator alias for Data.Functor.Product.product (right-associative / precedence 6)

#type (</\>) Source

Operator alias for Data.Functor.Product.Product (right-associative / precedence 6)

#product1 Source

product1 :: forall a. a ~> (Product1 a)

#product2 Source

product2 :: forall a b x. a x -> b x -> Product2 a b x

#product3 Source

product3 :: forall a b c x. a x -> b x -> c x -> Product3 a b c x

#product4 Source

product4 :: forall a b c d x. a x -> b x -> c x -> d x -> Product4 a b c d x

#product5 Source

product5 :: forall a b c d e x. a x -> b x -> c x -> d x -> e x -> Product5 a b c d e x

#product6 Source

product6 :: forall a b c d e f x. a x -> b x -> c x -> d x -> e x -> f x -> Product6 a b c d e f x

#product7 Source

product7 :: forall a b c d e f g x. a x -> b x -> c x -> d x -> e x -> f x -> g x -> Product7 a b c d e f g x

#product8 Source

product8 :: forall a b c d e f g h x. a x -> b x -> c x -> d x -> e x -> f x -> g x -> h x -> Product8 a b c d e f g h x

#product9 Source

product9 :: forall a b c d e f g h i x. a x -> b x -> c x -> d x -> e x -> f x -> g x -> h x -> i x -> Product9 a b c d e f g h i x

#product10 Source

product10 :: forall a b c d e f g h i j x. a x -> b x -> c x -> d x -> e x -> f x -> g x -> h x -> i x -> j x -> Product10 a b c d e f g h i j x

#get1 Source

get1 :: forall a z. (T2 a z) ~> a

#get2 Source

get2 :: forall a b z. (T3 a b z) ~> b

#get3 Source

get3 :: forall a b c z. (T4 a b c z) ~> c

#get4 Source

get4 :: forall a b c d z. (T5 a b c d z) ~> d

#get5 Source

get5 :: forall a b c d e z. (T6 a b c d e z) ~> e

#get6 Source

get6 :: forall a b c d e f z. (T7 a b c d e f z) ~> f

#get7 Source

get7 :: forall a b c d e f g z. (T8 a b c d e f g z) ~> g

#get8 Source

get8 :: forall a b c d e f g h z. (T9 a b c d e f g h z) ~> h

#get9 Source

get9 :: forall a b c d e f g h i z. (T10 a b c d e f g h i z) ~> i

#get10 Source

get10 :: forall a b c d e f g h i j z. (T11 a b c d e f g h i j z) ~> j