Module

Data.Typelevel.Num.Sets

#Nat

class Nat n  where

Members

toInt :: n -> Int

Instances

Nat D0
Nat D1
Nat D2
Nat D3
Nat D4
Nat D5
Nat D6
Nat D7
Nat D8
Nat D9
(Pos x) => Nat (NumCons x D0)
(Pos x) => Nat (NumCons x D1)
(Pos x) => Nat (NumCons x D2)
(Pos x) => Nat (NumCons x D3)
(Pos x) => Nat (NumCons x D4)
(Pos x) => Nat (NumCons x D5)
(Pos x) => Nat (NumCons x D6)
(Pos x) => Nat (NumCons x D7)
(Pos x) => Nat (NumCons x D8)
(Pos x) => Nat (NumCons x D9)

#toInt'

toInt' :: forall n. Nat n => Proxy n -> Int

Sugar for toInt, providing a more intuitive type

#Pos

class (Nat n) <= Pos n

Instances

Pos D1
Pos D2
Pos D3
Pos D4
Pos D5
Pos D6
Pos D7
Pos D8
Pos D9
(Pos x) => Pos (NumCons x D0)
(Pos x) => Pos (NumCons x D1)
(Pos x) => Pos (NumCons x D2)
(Pos x) => Pos (NumCons x D3)
(Pos x) => Pos (NumCons x D4)
(Pos x) => Pos (NumCons x D5)
(Pos x) => Pos (NumCons x D6)
(Pos x) => Pos (NumCons x D7)
(Pos x) => Pos (NumCons x D8)
(Pos x) => Pos (NumCons x D9)

#subLastDec

subLastDec :: forall x d. Nat (x :* d) => Nat x => x :* d -> Int

#div10Dec

div10Dec :: forall x d. Nat (x :* d) => x :* d -> x

#reifyInt

reifyInt :: forall r. Int -> (forall n. Nat n => n -> r) -> r

#reifyIntP

reifyIntP :: forall r. Int -> (forall n. Pos n => n -> r) -> r

Modules