module Text.Numeral.Language.NO
( cardinal
, struct
) where
import "base" Data.Function ( ($), const, fix )
import "base" Data.Maybe ( Maybe(Just) )
import "base" Data.Monoid ( Monoid )
import "base" Data.String ( IsString )
import "base" Prelude ( Integral )
import "base-unicode-symbols" Data.Function.Unicode ( (∘) )
import qualified "containers" Data.Map as M ( fromList, lookup )
import "numerals-base" Text.Numeral
import qualified "numerals-base" Text.Numeral.Exp.Classes as C
cardinal ∷ (Integral α, Monoid s, IsString s) ⇒ α → Maybe s
cardinal = cardinalRepr ∘ struct
struct ∷ (Integral α, C.Unknown β, C.Lit β, C.Neg β, C.Add β, C.Mul β) ⇒ α → β
struct = pos
$ fix
$ findRule ( 0, lit )
[ ( 13, add 10 L )
, ( 20, lit )
, ( 21, add 20 R )
, ( 30, mul 10 R L)
, (100, step 100 10 R L)
]
1000
cardinalRepr ∷ (Monoid s, IsString s) ⇒ Exp → Maybe s
cardinalRepr = render defaultRepr
{ reprValue = \n → M.lookup n syms
, reprAdd = Just $ \_ _ _ → ""
, reprMul = Just $ \_ _ _ → ""
, reprNeg = Just $ \_ _ → "minus "
}
where
syms =
M.fromList
[ (0, const "null")
, (1, const "en")
, (2, const "to")
, (3, ten "tre" "tret" "tret")
, (4, ten "fire" "fjor" "før")
, (5, const "fem")
, (6, const "seks")
, (7, ten "syv" "syt" "syt")
, (8, ten "åtte" "at" "åt")
, (9, ten "ni" "nit" "nit")
, (10, \c → case c of
CtxAdd {} → "ten"
_ → "ti"
)
, (11, const "elleve")
, (12, const "tolv")
, (20, const "tjue")
, (100, const "hundre")
, (1000, const "tusen")
]
ten n a m = \c → case c of
CtxAdd _ (Lit 10) _ → a
CtxMul {} → m
_ → n