module Text.Numeral.Language.OJ
( 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.Add β, C.Mul β)
⇒ α → β
struct = checkPos
$ fix
$ findRule ( 1, lit )
[ ( 11, step 10 10 R L)
, ( 100, step 100 10 R L)
, (1000, step 1000 2 R L)
]
1999
cardinalRepr ∷ (Monoid s, IsString s) ⇒ Exp → Maybe s
cardinalRepr = render defaultRepr
{ reprValue = \n → M.lookup n syms
, reprAdd = Just $ \_ _ _ → " shaa "
, reprMul = Just $ \_ _ _ → ""
}
where
syms =
M.fromList
[ (0, const "kaagego" )
, (1, const "bezhik" )
, (2, const "niizh" )
, (3, forms "nswi" "nsim" "ns" )
, (4, forms "niiwin" "niim" "nii" )
, (5, forms "naanan" "naanmi" "naan" )
, (6, forms "ngodwaaswi" "ngodwaasmi" "ngodwaas" )
, (7, forms "niizhwaaswi" "niizhwaasmi" "niizhwaas")
, (8, forms "nshwaaswi" "nshwaasmi" "nshwaas" )
, (9, forms "zhaangswi" "zhaangsmi" "zhaangs" )
, (10, \c → case c of
CtxMul {} → "taana"
_ → "mdaaswi"
)
, (100, \c → case c of
CtxMul {} → "waak"
_ → "ngodwaak"
)
, (1000, const "mdaaswaak")
]
forms ∷ s → s → s → Ctx Exp → s
forms o t h = \c → case c of
CtxMul _ (Lit 10) _ → t
CtxMul _ (Lit 100) _ → h
_ → o