shithub: MicroHs

ref: 766bc6f2cf7fe1d3413cad35d97db6f3f9b98492
dir: /lib/Data/Word.hs/

View raw version
-- Copyright 2023 Lennart Augustsson
-- See LICENSE file for full license.
module Data.Word(module Data.Word, Word) where
import Primitives
import Data.Bool_Type
import qualified Data.Char as C
import qualified Data.Int as I
import Data.List
import Text.String

infixl 6 +,-
infixl 7 *,`quot`,`rem`

-- Arithmetic
(+) :: Word -> Word -> Word
(+)  = primWordAdd
(-) :: Word -> Word -> Word
(-)  = primWordSub
(*) :: Word -> Word -> Word
(*)  = primWordMul
quot :: Word -> Word -> Word
quot = primWordQuot
rem :: Word -> Word -> Word
rem  = primWordRem

--------------------------------

infix 4 ==,/=,<,<=,>,>=

-- Comparison
(==) :: Word -> Word -> Bool
(==) = primWordEQ
(/=) :: Word -> Word -> Bool
(/=) = primWordNE

(<)  :: Word -> Word -> Bool
(<)  = primWordLT
(<=) :: Word -> Word -> Bool
(<=) = primWordLE
(>)  :: Word -> Word -> Bool
(>)  = primWordGT
(>=) :: Word -> Word -> Bool
(>=) = primWordGE

eqWord :: Word -> Word -> Bool
eqWord = (==)

intToWord :: Int -> Word
intToWord = primUnsafeCoerce

wordToInt :: Word -> Int
wordToInt = primUnsafeCoerce

--------------------------------

showWord :: Word -> C.String
showWord n =
  let
    c = C.chr ((I.+) (C.ord '0') (wordToInt (rem n (intToWord 10))))
  in  case n < intToWord 10 of
        False -> showWord (quot n (intToWord 10)) ++ [c]
        True  -> [c]