{-# LANGUAGE OverloadedLists, OverloadedStrings, QuasiQuotes, TemplateHaskell #-}
module Text.Numerals.Languages.German (
german
, ordinize'
, negativeWord', zeroWord', oneWord'
, lowWords', midWords', highWords'
, merge'
) where
import Data.Bool(bool)
import Data.Text(Text, isSuffixOf, pack, toLower, toTitle)
import Data.Vector(Vector)
import Text.Numerals.Algorithm(HighNumberAlgorithm(LongScale), NumeralsAlgorithm, numeralsAlgorithm, valueSplit')
import Text.Numerals.Algorithm.Template(ordinizeFromDict)
import Text.Numerals.Class(FreeMergerFunction)
import Text.Numerals.Internal(_mergeWith, _mergeWithSpace, _million, _showIntegral)
import Text.RE.TDFA.Text(RE, SearchReplace, (*=~/), ed)
$(pure (ordinizeFromDict "_ordinize'" [
("eins", "ers")
, ("drei", "drit")
, ("acht", "ach")
, ("sieben", "sieb")
, ("ig", "igs")
, ("ert", "erts")
, ("end", "ends")
, ("ion", "ions")
, ("nen", "ns")
, ("rde", "rds")
, ("rden", "rds")
] 'id))
german :: NumeralsAlgorithm
german = numeralsAlgorithm negativeWord' zeroWord' oneWord' lowWords' midWords' (valueSplit' toTitle highWords') merge' ordinize' shortOrdinal'
negativeWord' :: Text
negativeWord' = "minus"
zeroWord' :: Text
zeroWord' = "null"
oneWord' :: Text
oneWord' = "eins"
lowWords' :: Vector Text
lowWords' = [
"zwei"
, "drei"
, "vier"
, "fünf"
, "sechs"
, "sieben"
, "acht"
, "neun"
, "zehn"
, "elf"
, "zwölf"
, "dreizehn"
, "vierzehn"
, "fünfzehn"
, "sechzehn"
, "siebzehn"
, "achtzehn"
, "neunzehn"
, "zwanzig"
]
midWords' :: [(Integer, Text)]
midWords' = [
(1000, "tausend")
, (100, "hundert")
, (90, "neunzig")
, (80, "achtzig")
, (70, "siebzig")
, (60, "sechzig")
, (50, "fünfzig")
, (40, "vierzig")
, (30, "dreißig")
]
merge' :: FreeMergerFunction
merge' 1 100 = const ("ein" <>)
merge' 1 1000 = const ("ein" <>)
merge' 1 r | r < _million = const id
merge' 1 r = const (_merge' 1 r "eine")
merge' l r = _merge' l r
_pluralize :: Text -> Text
_pluralize t
| "e" `isSuffixOf` t = t <> "n"
| otherwise = t <> "en"
_merge' :: FreeMergerFunction
_merge' l r
| r > l && r >= _million = (. bool id _pluralize (l > 1)) . _mergeWithSpace
| r > l = (<>)
_merge' l 1 | 10 < l && l < 100 = const . ("einund" <> )
_merge' l r
| r < 10 && 10 < l && l < 100 = flip (_mergeWith "und")
| l >= _million = _mergeWithSpace
| otherwise = (<>)
_ordinalSuffixRe :: SearchReplace RE Text
_ordinalSuffixRe = [ed|(eine)? ([a-z]+(illion|illiard)ste)$///${2}|]
ordinize' :: Text -> Text
ordinize' = postprocess . (<> "te") . _ordinize' . toLower
where postprocess "eintausendste" = "tausendste"
postprocess "einhundertste" = "hundertste"
postprocess t = t *=~/ _ordinalSuffixRe
highWords' :: HighNumberAlgorithm
highWords' = LongScale "illion" "illiard"
shortOrdinal' :: Integral i
=> i
-> Text
shortOrdinal' = pack . (`_showIntegral` ".")