Type.Data.List

data List' k

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)

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)

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

class IsMember x xs r | x xs -> r where

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

class Concat xs ys zs | xs ys -> zs where

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)

class IsEmpty xs r | xs -> r where

Members

• isEmpty :: forall lproxy. lproxy xs -> Boolean

Instances

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

class Init xs ys | xs -> ys where

Members

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

Instances

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

class Init' xs ys zs | xs ys -> zs

Instances

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

class Last xs x | xs -> x where

Members

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

Instances

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

class Length xs r | xs -> r where

Members

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

Instances

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

class Length' xs n r | xs n -> r

Instances

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

class Take n xs ys | n xs -> ys where

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)

class Drop n xs ys | n xs -> ys where

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

class Zip x y z | x y -> z where

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)

class Map f xs ys | f xs -> ys where

Members

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

Instances

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

class Fold f z xs r | f z xs -> r where

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

class Foldr f z xs r | f z xs -> r where

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)

data ListProxy l

Constructors

• ListProxy