Module

Type.Data.List

Package: purescript-typelevel-lists
Repository: PureFunctor/purescript-typelevel-lists

Type-level heterogenous list of kinds for PureScript

#Cons' Source

data Cons' :: forall k. k -> List' k -> List' k

Prepends an item to a List', creating a new List'.

Instances

IsMember x (Cons' x xs) True
(IsMember x ys r) => IsMember x (Cons' y ys) r
(Concat xs ys zs) => Concat (Cons' x xs) ys (Cons' x zs)
IsEmpty (Cons' x xs) False
(Init' z zs ws) => Init' y (Cons' z zs) (Cons' y ws)
(Init' x xs ys) => Init (Cons' x xs) ys
Last (Cons' x Nil') x
(Last xs ys) => Last (Cons' x xs) ys
(SumInt n P1 m, Length' xs m r) => Length' (Cons' x xs) n r
(SumInt n N1 m, Take m xs ys) => Take n (Cons' x xs) (Cons' x ys)
(SumInt n N1 m, Drop m xs ys) => Drop n (Cons' x xs) ys
(Zip xs ys zs) => Zip (Cons' x xs) (Cons' y ys) (Cons' (Tuple x y) zs)
(Map f xs ys) => Map f (Cons' x xs) (Cons' (f x) ys)
(Fold f (f z x) xs r) => Fold f z (Cons' x xs) r
Foldr f z (Cons' x Nil') (f x z)
(Foldr f z xs r) => Foldr f z (Cons' x xs) (f x r)

#List' Source

data List' :: forall k. k -> Typedata List' k

Represents a type-level list.

#ListProxy Source

data ListProxy :: forall k. List' k -> Typedata ListProxy l

A value-level proxy for List'

Constructors

ListProxy

#Nil' Source

data Nil' :: forall k. List' k

Represents an empty List'.

Instances

IsMember x Nil' False
Concat Nil' ys ys
IsEmpty Nil' True
Init' xs Nil' Nil'
Last (Cons' x Nil') x
Length' Nil' n n
Take P0 xs Nil'
Take n Nil' Nil'
Drop n Nil' Nil'
Zip Nil' y Nil'
Zip x Nil' Nil'
Map f Nil' Nil'
Fold f z Nil' z
Foldr f z Nil' z
Foldr f z (Cons' x Nil') (f x z)

#type (:>) Source

Operator alias for Type.Data.List.Cons' (right-associative / precedence 1)

#Concat Source

class Concat :: forall k. List' k -> List' k -> List' k -> Constraintclass Concat xs ys zs | xs ys -> zs where

Concatenates two List's together.

Members

concat :: forall lproxy. lproxy xs -> lproxy ys -> lproxy zs

Instances

Concat Nil' ys ys
(Concat xs ys zs) => Concat (Cons' x xs) ys (Cons' x zs)

#Drop Source

class Drop :: forall k. Int -> List' k -> List' k -> Constraintclass Drop n xs ys | n xs -> ys where

Drops an n amount of items from a List'.

Members

drop :: forall lproxy iproxy. iproxy n -> lproxy xs -> lproxy ys

Instances

Drop P0 xs xs
Drop n Nil' Nil'
(SumInt n N1 m, Drop m xs ys) => Drop n (Cons' x xs) ys

#Fold Source

class Fold :: forall k. (k -> k -> k) -> k -> List' k -> k -> Constraintclass Fold f z xs r | f z xs -> r where

Folds a List' into a singular value, left-associative.

Members

fold :: forall fproxy kproxy lproxy. fproxy f -> kproxy z -> lproxy xs -> kproxy r

Instances

Fold f z Nil' z
(Fold f (f z x) xs r) => Fold f z (Cons' x xs) r

#Foldr Source

class Foldr :: forall k. (k -> k -> k) -> k -> List' k -> k -> Constraintclass Foldr f z xs r | f z xs -> r where

Folds a List' into a singular value, right-associative.

Members

foldr :: forall fproxy kproxy lproxy. fproxy f -> kproxy z -> lproxy xs -> kproxy r

Instances

Foldr f z Nil' z
Foldr f z (Cons' x Nil') (f x z)
(Foldr f z xs r) => Foldr f z (Cons' x xs) (f x r)

#Init Source

class Init :: forall k. List' k -> List' k -> Constraintclass Init xs ys | xs -> ys where

Takes the init items of a List'.

Members

init :: forall lproxy. lproxy xs -> lproxy ys

Instances

(Init' x xs ys) => Init (Cons' x xs) ys

#Init' Source

class Init' :: forall k. k -> List' k -> List' k -> Constraintclass Init' xs ys zs | xs ys -> zs

Internal type class that acts as an accumulator.

Instances

Init' xs Nil' Nil'
(Init' z zs ws) => Init' y (Cons' z zs) (Cons' y ws)

#IsEmpty Source

class IsEmpty :: forall k. List' k -> Boolean -> Constraintclass IsEmpty xs r | xs -> r where

Determines whether List' is empty.

Members

isEmpty :: forall lproxy. lproxy xs -> Boolean

Instances

IsEmpty Nil' True
IsEmpty (Cons' x xs) False

#IsMember Source

class IsMember :: forall k. k -> List' k -> Boolean -> Constraintclass IsMember x xs r | x xs -> r where

Performs membership testing given an item and a List'.

Members

isMember :: forall lproxy. Proxy x -> lproxy xs -> Boolean

Instances

IsMember x Nil' False
IsMember x (Cons' x xs) True
(IsMember x ys r) => IsMember x (Cons' y ys) r

#Last Source

class Last :: forall k. List' k -> k -> Constraintclass Last xs x | xs -> x where

Returns the last item of a List'.

Members

last :: forall lproxy. lproxy xs -> Proxy x

Instances

Last (Cons' x Nil') x
(Last xs ys) => Last (Cons' x xs) ys

#Length Source

class Length :: forall k. List' k -> Int -> Constraintclass Length xs r | xs -> r where

Computes the length of a List' as a Type.Data.Peano.Int

Members

length :: forall lproxy iproxy. lproxy xs -> iproxy r

Instances

(Length' xs P0 r) => Length xs r

#Length' Source

class Length' :: forall k. List' k -> Int -> Int -> Constraintclass Length' xs n r | xs n -> r

Internal type that acts as an accumulator

Instances

Length' Nil' n n
(SumInt n P1 m, Length' xs m r) => Length' (Cons' x xs) n r

#Map Source

class Map :: forall k l. (k -> l) -> List' k -> List' l -> Constraintclass Map f xs ys | f xs -> ys where

Maps a type constructor to a List'.

Members

map :: forall fproxy kproxy lproxy. fproxy f -> kproxy xs -> lproxy ys

Instances

Map f Nil' Nil'
(Map f xs ys) => Map f (Cons' x xs) (Cons' (f x) ys)

#Take Source

class Take :: forall k. Int -> List' k -> List' k -> Constraintclass Take n xs ys | n xs -> ys where

Takes an n amount of items from a List'.

Members

take :: forall lproxy iproxy. iproxy n -> lproxy xs -> lproxy ys

Instances

Take P0 xs Nil'
Take n Nil' Nil'
(SumInt n N1 m, Take m xs ys) => Take n (Cons' x xs) (Cons' x ys)

#Zip Source

class Zip :: forall k. List' k -> List' k -> List' k -> Constraintclass Zip x y z | x y -> z where

Zips together two List's.

Members

zip :: forall lproxy. lproxy x -> lproxy y -> lproxy z

Instances

Zip Nil' y Nil'
Zip x Nil' Nil'
(Zip xs ys zs) => Zip (Cons' x xs) (Cons' y ys) (Cons' (Tuple x y) zs)

Modules: Type.Data.List