mirror of
https://github.com/bblaz/num2words.git
synced 2025-12-05 22:32:25 +00:00
added swedish language including test cases
This commit is contained in:
Peter Nordstrom
committed by
Willem Van Onsem
Willem Van Onsem
parent
cb24e20785
commit
1b35e7fe58
@@ -22,7 +22,7 @@ from . import (lang_AR, lang_CZ, lang_DE, lang_DK, lang_EN, lang_EN_IN,
|
||||
lang_FR_BE, lang_FR_CH, lang_FR_DZ, lang_HE, lang_HU, lang_ID,
|
||||
lang_IT, lang_JA, lang_KN, lang_KO, lang_KZ, lang_LT, lang_LV,
|
||||
lang_NL, lang_NO, lang_PL, lang_PT, lang_PT_BR, lang_RO,
|
||||
lang_RU, lang_SL, lang_SR, lang_TE, lang_TH, lang_TR, lang_UK,
|
||||
lang_RU, lang_SL, lang_SR, lang_SV, lang_TE, lang_TH, lang_TR, lang_UK,
|
||||
lang_VI)
|
||||
|
||||
CONVERTER_CLASSES = {
|
||||
@@ -52,6 +52,7 @@ CONVERTER_CLASSES = {
|
||||
'ru': lang_RU.Num2Word_RU(),
|
||||
'sl': lang_SL.Num2Word_SL(),
|
||||
'sr': lang_SR.Num2Word_SR(),
|
||||
'sv': lang_SV.Num2Word_SV(),
|
||||
'no': lang_NO.Num2Word_NO(),
|
||||
'dk': lang_DK.Num2Word_DK(),
|
||||
'pt': lang_PT.Num2Word_PT(),
|
||||
|
||||
113
num2words/lang_SV.py
Normal file
113
num2words/lang_SV.py
Normal file
@@ -0,0 +1,113 @@
|
||||
# -*- coding: utf-8 -*-
|
||||
# Copyright (c) 2003, Taro Ogawa. All Rights Reserved.
|
||||
# Copyright (c) 2013, Savoir-faire Linux inc. All Rights Reserved.
|
||||
|
||||
# This library is free software; you can redistribute it and/or
|
||||
# modify it under the terms of the GNU Lesser General Public
|
||||
# License as published by the Free Software Foundation; either
|
||||
# version 2.1 of the License, or (at your option) any later version.
|
||||
# This library is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
# Lesser General Public License for more details.
|
||||
# You should have received a copy of the GNU Lesser General Public
|
||||
# License along with this library; if not, write to the Free Software
|
||||
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
||||
# MA 02110-1301 USA
|
||||
|
||||
from __future__ import division, print_function, unicode_literals
|
||||
|
||||
from . import lang_EU
|
||||
|
||||
|
||||
class Num2Word_SV(lang_EU.Num2Word_EU):
|
||||
GIGA_SUFFIX = "iljarder"
|
||||
MEGA_SUFFIX = "iljoner"
|
||||
|
||||
def set_high_numwords(self, high):
|
||||
cap = 3 + 6 * len(high)
|
||||
|
||||
for word, n in zip(high, range(cap, 3, -6)):
|
||||
if self.GIGA_SUFFIX:
|
||||
self.cards[10 ** n] = word + self.GIGA_SUFFIX
|
||||
|
||||
if self.MEGA_SUFFIX:
|
||||
self.cards[10 ** (n - 3)] = word + self.MEGA_SUFFIX
|
||||
|
||||
def setup(self):
|
||||
super(Num2Word_SV, self).setup()
|
||||
|
||||
self.negword = "minus "
|
||||
self.pointword = "komma"
|
||||
self.exclude_title = ["och", "komma", "minus"]
|
||||
|
||||
self.mid_numwords = [(1000, "tusen"), (100, "hundra"),
|
||||
(90, "nittio"), (80, "\åttio"), (70, "sjuttio"),
|
||||
(60, "sextio"), (50, "femtio"), (40, "förtio"),
|
||||
(30, "trettio")]
|
||||
self.low_numwords = ["tjugo", "nitton", "arton", "sjutton",
|
||||
"sexton", "femton", "fjorton", "tretton",
|
||||
"tolv", "elva", "tio", "nio", "åtta",
|
||||
"sju", "sex", "fem", "fyra", "tre", "två",
|
||||
"ett", "noll"]
|
||||
self.ords = {"noll": "nollte",
|
||||
"ett": "första",
|
||||
"två": "andra",
|
||||
"tre": "tredje",
|
||||
"fyra": "fjärde",
|
||||
"fem": "femte",
|
||||
"sex": "sjätte",
|
||||
"sju": "sjunde",
|
||||
"åtta": "åttonde",
|
||||
"nio": "nionde",
|
||||
"tio": "tionde",
|
||||
"elva": "elfte",
|
||||
"tolv": "tolfte",
|
||||
"tjugo": "tjugonde"}
|
||||
|
||||
def merge(self, lpair, rpair):
|
||||
ltext, lnum = lpair
|
||||
rtext, rnum = rpair
|
||||
if lnum == 1 and rnum < 100:
|
||||
return (rtext, rnum)
|
||||
elif 100 > lnum > rnum:
|
||||
return ("%s%s" % (ltext, rtext), lnum + rnum)
|
||||
elif lnum >= 100 > rnum:
|
||||
return ("%s%s" % (ltext, rtext), lnum + rnum)
|
||||
elif rnum >= 1000000 and lnum == 1:
|
||||
return ("%s %s" % ('en', rtext[:-2]), lnum + rnum)
|
||||
elif rnum >= 1000000 and lnum > 1:
|
||||
return ("%s %s" % (ltext, rtext), lnum + rnum)
|
||||
elif rnum > lnum:
|
||||
return ("%s%s" % (ltext, rtext), lnum * rnum)
|
||||
return ("%s %s" % (ltext, rtext), lnum + rnum)
|
||||
|
||||
def to_ordinal(self, value):
|
||||
self.verify_ordinal(value)
|
||||
outwords = self.to_cardinal(value).split(" ")
|
||||
lastwords = outwords[-1].split("-")
|
||||
lastword = lastwords[-1].lower()
|
||||
try:
|
||||
lastword = self.ords[lastword]
|
||||
except KeyError:
|
||||
if lastword[-2:] == "tio":
|
||||
lastword = lastword + "onde"
|
||||
else:
|
||||
lastword += "de"
|
||||
lastwords[-1] = self.title(lastword)
|
||||
outwords[-1] = "".join(lastwords)
|
||||
return " ".join(outwords)
|
||||
|
||||
def to_ordinal_num(self, value):
|
||||
self.verify_ordinal(value)
|
||||
return "%s%s" % (value, self.to_ordinal(value)[-2:])
|
||||
|
||||
def to_year(self, val, longval=True):
|
||||
if not (val // 100) % 10:
|
||||
return self.to_cardinal(val)
|
||||
return self.to_splitnum(val, hightxt="hundra", jointxt="och",
|
||||
longval=longval)
|
||||
|
||||
def to_currency(self, val, longval=True):
|
||||
return self.to_splitnum(val, hightxt="krone/r", lowtxt="öre/n",
|
||||
jointxt="och", longval=longval, cents=True)
|
||||
46
tests/test_sv.py
Normal file
46
tests/test_sv.py
Normal file
@@ -0,0 +1,46 @@
|
||||
# coding: utf-8
|
||||
# Copyright (c) 2003, Taro Ogawa. All Rights Reserved.
|
||||
# Copyright (c) 2013, Savoir-faire Linux inc. All Rights Reserved.
|
||||
|
||||
# This library is free software; you can redistribute it and/or
|
||||
# modify it under the terms of the GNU Lesser General Public
|
||||
# License as published by the Free Software Foundation; either
|
||||
# version 2.1 of the License, or (at your option) any later version.
|
||||
# This library is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
# Lesser General Public License for more details.
|
||||
# You should have received a copy of the GNU Lesser General Public
|
||||
# License along with this library; if not, write to the Free Software
|
||||
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
||||
# MA 02110-1301 USA
|
||||
|
||||
from __future__ import unicode_literals
|
||||
|
||||
from unittest import TestCase
|
||||
|
||||
from num2words import num2words
|
||||
|
||||
|
||||
class Num2WordsSVTest(TestCase):
|
||||
def test_ordinal(self):
|
||||
pass
|
||||
self.assertEqual(num2words(1, to="ordinal", lang="sv"), "första")
|
||||
self.assertEqual(num2words(5, to="ordinal", lang="sv"), "femte")
|
||||
self.assertEqual(num2words(32, to="ordinal", lang="sv"), "trettioandra")
|
||||
|
||||
|
||||
def test_cardinal(self):
|
||||
self.assertEqual(num2words(0, to="cardinal", lang="sv"), "noll")
|
||||
self.assertEqual(num2words(1, to="cardinal", lang="sv"), "ett")
|
||||
self.assertEqual(num2words(2, to="cardinal", lang="sv"), "två")
|
||||
self.assertEqual(num2words(5, to="cardinal", lang="sv"), "fem")
|
||||
self.assertEqual(num2words(8, to="cardinal", lang="sv"), "åtta")
|
||||
self.assertEqual(num2words(18, to="cardinal", lang="sv"), "arton")
|
||||
self.assertEqual(num2words(45, to="cardinal", lang="sv"), "förtiofem")
|
||||
self.assertEqual(num2words(1245, to="cardinal", lang="sv"), "etttusen tvåhundraförtiofem")
|
||||
self.assertEqual(num2words(4235, to="cardinal", lang="sv"), "fyratusen tvåhundratrettiofem")
|
||||
self.assertEqual(num2words(1004135, to="cardinal", lang="sv"), "en miljon fyratusen etthundratrettiofem")
|
||||
self.assertEqual(num2words(14004235000, to="cardinal", lang="sv"), "fjorton miljarder fyra miljoner tvåhundratrettiofemtusen")
|
||||
self.assertEqual(num2words(14004235, to="cardinal", lang="sv"), "fjorton miljoner fyratusen tvåhundratrettiofem")
|
||||
self.assertEqual(num2words(1.25, to="cardinal", lang="sv"), "ett komma två fem")
|
||||
Reference in New Issue
Block a user