Safe Haskell	Safe
Language	Haskell2010

Longboi

Documentation

data Nat Source #

Constructors

Z
S Nat

Instances

Eq Nat Source #
Methods (==) :: Nat -> Nat -> Bool # (/=) :: Nat -> Nat -> Bool #
Show Nat Source #
Methods showsPrec :: Int -> Nat -> ShowS # show :: Nat -> String # showList :: [Nat] -> ShowS #

type family (n :: Nat) + (m :: Nat) :: Nat where ... infixl 6 Source #

Equations

Z + m = m
(S n) + m = S (n + m)

type family (n :: Nat) * (m :: Nat) :: Nat where ... infixl 7 Source #

Equations

Z * m = Z
(S n) * m = (n * m) + m

type family (n :: Nat) - (m :: Nat) :: Nat where ... infixl 6 Source #

Equations

Z - m = Z
(S n) - Z = S n
(S n) - m = S (n - m)

type family Min (n :: Nat) (m :: Nat) :: Nat where ... Source #

Equations

Min Z Z = Z
Min Z (S m) = Z
Min (S n) Z = Z
Min (S n) (S m) = S (Min n m)

type family Max (n :: Nat) (m :: Nat) :: Nat where ... Source #

Equations

Max Z Z = Z
Max Z (S m) = S m
Max (S n) Z = S n
Max (S n) (S m) = S (Max n m)

data Longboi a (n :: Nat) where Source #

Constructors

Nil :: Longboi a Z
Cons :: a -> Longboi a n -> Longboi a (S n)

Instances

Eq a => Eq (Longboi a n) Source #
Methods (==) :: Longboi a n -> Longboi a n -> Bool # (/=) :: Longboi a n -> Longboi a n -> Bool #

type family Length (xs :: Longboi a (n :: Nat)) :: Nat where ... Source #

Equations

Length Nil = Z
Length (Cons x xs) = S Z + Length xs

type family Contains (xs :: Longboi a (n :: Nat)) (elem :: a) :: Bool where ... Source #

Equations

Contains Nil _ = False
Contains (Cons x xs) x = True
Contains (Cons x xs) y = Contains xs y

(++) :: Longboi a n -> Longboi a m -> Longboi a (n + m) infixr 5 Source #

type family Append (xs :: Longboi a (n :: Nat)) (ys :: Longboi a (m :: Nat)) :: Longboi a (n + m) where ... Source #

Equations

Append (Cons x xs) ys = Cons x (Append xs ys)
Append Nil ys = ys

type family Head (xs :: Longboi a (n :: Nat)) :: a where ... Source #

Equations

Head (Cons x _) = x

type family Last (xs :: Longboi a (n :: Nat)) :: a where ... Source #

Equations

Last (Cons x Nil) = x
Last (Cons x xs) = Last xs

type family Tail (xs :: Longboi a (S n :: Nat)) :: Longboi a (n :: Nat) where ... Source #

Equations

Tail (Cons _ xs) = xs

type family Init (xs :: Longboi a (S n :: Nat)) :: Longboi a (n :: Nat) where ... Source #

Equations

Init (Cons _ Nil) = Nil
Init (Cons x xs) = Cons x (Init xs)

type family Null (xs :: Longboi a (n :: Nat)) :: Bool where ... Source #

Equations

Null Nil = True
Null _ = False

type family VMap (f :: a -> b) (xs :: Longboi a (n :: Nat)) :: Longboi b (n :: Nat) where ... Source #

Equations

VMap _ Nil = Nil
VMap f (Cons x xs) = Cons (f x) (VMap f xs)

type family Foldl (f :: a -> b -> a) (x :: a) (ys :: Longboi b (n :: Nat)) :: a where ... Source #

Equations

Foldl _ x Nil = x
Foldl f y (Cons x xs) = Foldl f (f y x) xs

type family Foldr (f :: a -> b -> b) (x :: b) (ys :: Longboi a (n :: Nat)) :: b where ... Source #

Equations

Foldr _ y Nil = y
Foldr f y (Cons x xs) = f x (Foldr f y xs)

type family ZipWithSame (f :: a -> b -> c) (xs :: Longboi a (n :: Nat)) (ys :: Longboi a (n :: Nat)) :: Longboi c (n :: Nat) where ... Source #

Equations

ZipWithSame _ Nil Nil = Nil
ZipWithSame f (Cons a as) (Cons b bs) = Cons (f a b) (ZipWithSame f as bs)

type family ZipWith (f :: a -> b -> c) (xs :: Longboi a (n :: Nat)) (ys :: Longboi a (m :: Nat)) :: Longboi c (Min n m) where ... Source #

Equations

ZipWith _ Nil Nil = Nil
ZipWith _ Nil (Cons _ _) = Nil
ZipWith _ (Cons _ _) Nil = Nil
ZipWith f (Cons a as) (Cons b bs) = Cons (f a b) (ZipWith f as bs)

head :: Longboi a (S n) -> a Source #

last :: Longboi a n -> a Source #

tail :: Longboi a (S n) -> Longboi a n Source #

init :: Longboi a (S n) -> Longboi a n Source #

uncons :: Longboi a (S n) -> (a, Longboi a n) Source #

null :: Longboi a n -> Bool Source #

vmap :: (a -> b) -> Longboi a n -> Longboi b n Source #

foldl :: (a -> b -> a) -> a -> Longboi b n -> a Source #

foldr :: (a -> b -> b) -> b -> Longboi a n -> b Source #

toList :: Longboi a n -> [a] Source #

zipWithSame :: (a -> b -> c) -> Longboi a n -> Longboi b n -> Longboi c n Source #

zipWith :: (a -> b -> c) -> Longboi a n -> Longboi b m -> Longboi c (Min n m) Source #