mirror of
https://github.com/kennethreitz/dive-into-python3.git
synced 2026-06-05 23:10:17 +00:00
finished refactoring chapter
This commit is contained in:
Mark Pilgrim
@@ -0,0 +1,87 @@
|
||||
"""Convert to and from Roman numerals
|
||||
|
||||
This program is part of "Dive Into Python 3", a free Python book for
|
||||
experienced programmers. Visit http://diveintopython3.org/ for the
|
||||
latest version.
|
||||
"""
|
||||
|
||||
class OutOfRangeError(ValueError): pass
|
||||
class NotIntegerError(ValueError): pass
|
||||
class InvalidRomanNumeralError(ValueError): pass
|
||||
|
||||
roman_numeral_map = (('M', 1000),
|
||||
('CM', 900),
|
||||
('D', 500),
|
||||
('CD', 400),
|
||||
('C', 100),
|
||||
('XC', 90),
|
||||
('L', 50),
|
||||
('XL', 40),
|
||||
('X', 10),
|
||||
('IX', 9),
|
||||
('V', 5),
|
||||
('IV', 4),
|
||||
('I', 1))
|
||||
|
||||
to_roman_table = [ None ]
|
||||
from_roman_table = {}
|
||||
|
||||
def to_roman(n):
|
||||
"""convert integer to Roman numeral"""
|
||||
if not (0 < n < 5000):
|
||||
raise OutOfRangeError("number out of range (must be 1..4999)")
|
||||
if int(n) != n:
|
||||
raise NotIntegerError("non-integers can not be converted")
|
||||
return to_roman_table[n]
|
||||
|
||||
def from_roman(s):
|
||||
"""convert Roman numeral to integer"""
|
||||
if not isinstance(s, str):
|
||||
raise InvalidRomanNumeralError("Input must be a string")
|
||||
if not s:
|
||||
raise InvalidRomanNumeralError("Input can not be blank")
|
||||
if s not in from_roman_table:
|
||||
raise InvalidRomanNumeralError("Invalid Roman numeral: {0}".format(s))
|
||||
return from_roman_table[s]
|
||||
|
||||
def build_lookup_tables():
|
||||
def to_roman(n):
|
||||
result = ""
|
||||
for numeral, integer in roman_numeral_map:
|
||||
if n >= integer:
|
||||
result = numeral
|
||||
n -= integer
|
||||
break
|
||||
if n > 0:
|
||||
result += to_roman_table[n]
|
||||
return result
|
||||
|
||||
for integer in range(1, 5000):
|
||||
roman_numeral = to_roman(integer)
|
||||
to_roman_table.append(roman_numeral)
|
||||
from_roman_table[roman_numeral] = integer
|
||||
|
||||
build_lookup_tables()
|
||||
|
||||
# Copyright (c) 2009, Mark Pilgrim, All rights reserved.
|
||||
#
|
||||
# Redistribution and use in source and binary forms, with or without modification,
|
||||
# are permitted provided that the following conditions are met:
|
||||
#
|
||||
# * Redistributions of source code must retain the above copyright notice,
|
||||
# this list of conditions and the following disclaimer.
|
||||
# * Redistributions in binary form must reproduce the above copyright notice,
|
||||
# this list of conditions and the following disclaimer in the documentation
|
||||
# and/or other materials provided with the distribution.
|
||||
#
|
||||
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
|
||||
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||||
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
# POSSIBILITY OF SUCH DAMAGE.
|
||||
+2
-2
@@ -52,8 +52,8 @@ def to_roman(n):
|
||||
|
||||
def from_roman(s):
|
||||
"""convert Roman numeral to integer"""
|
||||
if not s:
|
||||
raise InvalidRomanNumeralError("Input can not be blank")
|
||||
if not isinstance(s, str):
|
||||
raise InvalidRomanNumeralError("Input must be a string")
|
||||
if not roman_numeral_pattern.search(s):
|
||||
raise InvalidRomanNumeralError("Invalid Roman numeral: {0}".format(s))
|
||||
|
||||
|
||||
@@ -0,0 +1,91 @@
|
||||
"""Convert to and from Roman numerals
|
||||
|
||||
This program is part of "Dive Into Python 3", a free Python book for
|
||||
experienced programmers. Visit http://diveintopython3.org/ for the
|
||||
latest version.
|
||||
"""
|
||||
import re
|
||||
|
||||
class OutOfRangeError(ValueError): pass
|
||||
class NotIntegerError(ValueError): pass
|
||||
class InvalidRomanNumeralError(ValueError): pass
|
||||
|
||||
roman_numeral_map = (('M', 1000),
|
||||
('CM', 900),
|
||||
('D', 500),
|
||||
('CD', 400),
|
||||
('C', 100),
|
||||
('XC', 90),
|
||||
('L', 50),
|
||||
('XL', 40),
|
||||
('X', 10),
|
||||
('IX', 9),
|
||||
('V', 5),
|
||||
('IV', 4),
|
||||
('I', 1))
|
||||
|
||||
roman_numeral_pattern = re.compile("""
|
||||
^ # beginning of string
|
||||
M{0,4} # thousands - 0 to 4 M's
|
||||
(CM|CD|D?C{0,3}) # hundreds - 900 (CM), 400 (CD), 0-300 (0 to 3 C's),
|
||||
# or 500-800 (D, followed by 0 to 3 C's)
|
||||
(XC|XL|L?X{0,3}) # tens - 90 (XC), 40 (XL), 0-30 (0 to 3 X's),
|
||||
# or 50-80 (L, followed by 0 to 3 X's)
|
||||
(IX|IV|V?I{0,3}) # ones - 9 (IX), 4 (IV), 0-3 (0 to 3 I's),
|
||||
# or 5-8 (V, followed by 0 to 3 I's)
|
||||
$ # end of string
|
||||
""", re.VERBOSE)
|
||||
|
||||
def to_roman(n):
|
||||
"""convert integer to Roman numeral"""
|
||||
if not (0 < n < 5000):
|
||||
raise OutOfRangeError("number out of range (must be 0..4999)")
|
||||
if not isinstance(n, int):
|
||||
raise NotIntegerError("non-integers can not be converted")
|
||||
|
||||
result = ""
|
||||
for numeral, integer in roman_numeral_map:
|
||||
while n >= integer:
|
||||
result += numeral
|
||||
n -= integer
|
||||
return result
|
||||
|
||||
def from_roman(s):
|
||||
"""convert Roman numeral to integer"""
|
||||
if not isinstance(s, str):
|
||||
raise InvalidRomanNumeralError("Input must be a string")
|
||||
if not s:
|
||||
raise InvalidRomanNumeralError("Input can not be blank")
|
||||
if not roman_numeral_pattern.search(s):
|
||||
raise InvalidRomanNumeralError("Invalid Roman numeral: {0}".format(s))
|
||||
|
||||
result = 0
|
||||
index = 0
|
||||
for numeral, integer in roman_numeral_map:
|
||||
while s[index : index + len(numeral)] == numeral:
|
||||
result += integer
|
||||
index += len(numeral)
|
||||
return result
|
||||
|
||||
# Copyright (c) 2009, Mark Pilgrim, All rights reserved.
|
||||
#
|
||||
# Redistribution and use in source and binary forms, with or without modification,
|
||||
# are permitted provided that the following conditions are met:
|
||||
#
|
||||
# * Redistributions of source code must retain the above copyright notice,
|
||||
# this list of conditions and the following disclaimer.
|
||||
# * Redistributions in binary form must reproduce the above copyright notice,
|
||||
# this list of conditions and the following disclaimer in the documentation
|
||||
# and/or other materials provided with the distribution.
|
||||
#
|
||||
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
|
||||
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||||
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
# POSSIBILITY OF SUCH DAMAGE.
|
||||
@@ -0,0 +1,159 @@
|
||||
"""Unit test for roman1.py
|
||||
|
||||
This program is part of "Dive Into Python 3", a free Python book for
|
||||
experienced programmers. Visit http://diveintopython3.org/ for the
|
||||
latest version.
|
||||
"""
|
||||
|
||||
import roman10
|
||||
import unittest
|
||||
|
||||
class KnownValues(unittest.TestCase):
|
||||
known_values = ( (1, 'I'),
|
||||
(2, 'II'),
|
||||
(3, 'III'),
|
||||
(4, 'IV'),
|
||||
(5, 'V'),
|
||||
(6, 'VI'),
|
||||
(7, 'VII'),
|
||||
(8, 'VIII'),
|
||||
(9, 'IX'),
|
||||
(10, 'X'),
|
||||
(50, 'L'),
|
||||
(100, 'C'),
|
||||
(500, 'D'),
|
||||
(1000, 'M'),
|
||||
(31, 'XXXI'),
|
||||
(148, 'CXLVIII'),
|
||||
(294, 'CCXCIV'),
|
||||
(312, 'CCCXII'),
|
||||
(421, 'CDXXI'),
|
||||
(528, 'DXXVIII'),
|
||||
(621, 'DCXXI'),
|
||||
(782, 'DCCLXXXII'),
|
||||
(870, 'DCCCLXX'),
|
||||
(941, 'CMXLI'),
|
||||
(1043, 'MXLIII'),
|
||||
(1110, 'MCX'),
|
||||
(1226, 'MCCXXVI'),
|
||||
(1301, 'MCCCI'),
|
||||
(1485, 'MCDLXXXV'),
|
||||
(1509, 'MDIX'),
|
||||
(1607, 'MDCVII'),
|
||||
(1754, 'MDCCLIV'),
|
||||
(1832, 'MDCCCXXXII'),
|
||||
(1993, 'MCMXCIII'),
|
||||
(2074, 'MMLXXIV'),
|
||||
(2152, 'MMCLII'),
|
||||
(2212, 'MMCCXII'),
|
||||
(2343, 'MMCCCXLIII'),
|
||||
(2499, 'MMCDXCIX'),
|
||||
(2574, 'MMDLXXIV'),
|
||||
(2646, 'MMDCXLVI'),
|
||||
(2723, 'MMDCCXXIII'),
|
||||
(2892, 'MMDCCCXCII'),
|
||||
(2975, 'MMCMLXXV'),
|
||||
(3051, 'MMMLI'),
|
||||
(3185, 'MMMCLXXXV'),
|
||||
(3250, 'MMMCCL'),
|
||||
(3313, 'MMMCCCXIII'),
|
||||
(3408, 'MMMCDVIII'),
|
||||
(3501, 'MMMDI'),
|
||||
(3610, 'MMMDCX'),
|
||||
(3743, 'MMMDCCXLIII'),
|
||||
(3844, 'MMMDCCCXLIV'),
|
||||
(3888, 'MMMDCCCLXXXVIII'),
|
||||
(3940, 'MMMCMXL'),
|
||||
(3999, 'MMMCMXCIX'),
|
||||
(4000, 'MMMM'),
|
||||
(4500, 'MMMMD'),
|
||||
(4888, 'MMMMDCCCLXXXVIII'),
|
||||
(4999, 'MMMMCMXCIX'))
|
||||
|
||||
def test_to_roman_known_values(self):
|
||||
"""to_roman should give known result with known input"""
|
||||
for integer, numeral in self.known_values:
|
||||
result = roman10.to_roman(integer)
|
||||
self.assertEqual(numeral, result)
|
||||
|
||||
def test_from_roman_known_values(self):
|
||||
"""from_roman should give known result with known input"""
|
||||
for integer, numeral in self.known_values:
|
||||
result = roman10.from_roman(numeral)
|
||||
self.assertEqual(integer, result)
|
||||
|
||||
class ToRomanBadInput(unittest.TestCase):
|
||||
def test_too_large(self):
|
||||
"""to_roman should fail with large input"""
|
||||
self.assertRaises(roman10.OutOfRangeError, roman10.to_roman, 5000)
|
||||
|
||||
def test_zero(self):
|
||||
"""to_roman should fail with 0 input"""
|
||||
self.assertRaises(roman10.OutOfRangeError, roman10.to_roman, 0)
|
||||
|
||||
def test_negative(self):
|
||||
"""to_roman should fail with negative input"""
|
||||
self.assertRaises(roman10.OutOfRangeError, roman10.to_roman, -1)
|
||||
|
||||
def test_non_integer(self):
|
||||
"""to_roman should fail with non-integer input"""
|
||||
self.assertRaises(roman10.NotIntegerError, roman10.to_roman, 0.5)
|
||||
|
||||
class FromRomanBadInput(unittest.TestCase):
|
||||
def test_too_many_repeated_numerals(self):
|
||||
"""from_roman should fail with too many repeated numerals"""
|
||||
for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
self.assertRaises(roman10.InvalidRomanNumeralError, roman10.from_roman, s)
|
||||
|
||||
def test_repeated_pairs(self):
|
||||
"""from_roman should fail with repeated pairs of numerals"""
|
||||
for s in ('CMCM', 'CDCD', 'XCXC', 'XLXL', 'IXIX', 'IVIV'):
|
||||
self.assertRaises(roman10.InvalidRomanNumeralError, roman10.from_roman, s)
|
||||
|
||||
def test_malformed_antecedents(self):
|
||||
"""from_roman should fail with malformed antecedents"""
|
||||
for s in ('IIMXCC', 'VX', 'DCM', 'CMM', 'IXIV',
|
||||
'MCMC', 'XCX', 'IVI', 'LM', 'LD', 'LC'):
|
||||
self.assertRaises(roman10.InvalidRomanNumeralError, roman10.from_roman, s)
|
||||
|
||||
def test_blank(self):
|
||||
"""from_roman should fail with blank string"""
|
||||
self.assertRaises(roman10.InvalidRomanNumeralError, roman10.from_roman, "")
|
||||
|
||||
def test_non_string(self):
|
||||
"""from_roman should fail with non-string input"""
|
||||
self.assertRaises(roman10.InvalidRomanNumeralError, roman10.from_roman, 1)
|
||||
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 5000):
|
||||
numeral = roman10.to_roman(integer)
|
||||
result = roman10.from_roman(numeral)
|
||||
self.assertEqual(integer, result)
|
||||
|
||||
if __name__ == "__main__":
|
||||
unittest.main()
|
||||
|
||||
# Copyright (c) 2009, Mark Pilgrim, All rights reserved.
|
||||
#
|
||||
# Redistribution and use in source and binary forms, with or without modification,
|
||||
# are permitted provided that the following conditions are met:
|
||||
#
|
||||
# * Redistributions of source code must retain the above copyright notice,
|
||||
# this list of conditions and the following disclaimer.
|
||||
# * Redistributions in binary form must reproduce the above copyright notice,
|
||||
# this list of conditions and the following disclaimer in the documentation
|
||||
# and/or other materials provided with the distribution.
|
||||
#
|
||||
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
|
||||
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||||
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
# POSSIBILITY OF SUCH DAMAGE.
|
||||
@@ -95,8 +95,8 @@ class ToRomanBadInput(unittest.TestCase):
|
||||
"""to_roman should fail with non-integer input"""
|
||||
self.assertRaises(roman5.NotIntegerError, roman5.to_roman, 0.5)
|
||||
|
||||
class SanityCheck(unittest.TestCase):
|
||||
def testSanity(self):
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 4000):
|
||||
numeral = roman5.to_roman(integer)
|
||||
|
||||
@@ -98,7 +98,7 @@ class ToRomanBadInput(unittest.TestCase):
|
||||
class FromRomanBadInput(unittest.TestCase):
|
||||
def test_too_many_repeated_numerals(self):
|
||||
"""from_roman should fail with too many repeated numerals"""
|
||||
for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
for s in ('MMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
self.assertRaises(roman6.InvalidRomanNumeralError, roman6.from_roman, s)
|
||||
|
||||
def test_repeated_pairs(self):
|
||||
@@ -112,8 +112,8 @@ class FromRomanBadInput(unittest.TestCase):
|
||||
'MCMC', 'XCX', 'IVI', 'LM', 'LD', 'LC'):
|
||||
self.assertRaises(roman6.InvalidRomanNumeralError, roman6.from_roman, s)
|
||||
|
||||
class SanityCheck(unittest.TestCase):
|
||||
def testSanity(self):
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 4000):
|
||||
numeral = roman6.to_roman(integer)
|
||||
|
||||
@@ -98,7 +98,7 @@ class ToRomanBadInput(unittest.TestCase):
|
||||
class FromRomanBadInput(unittest.TestCase):
|
||||
def test_too_many_repeated_numerals(self):
|
||||
"""from_roman should fail with too many repeated numerals"""
|
||||
for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
for s in ('MMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
self.assertRaises(roman7.InvalidRomanNumeralError, roman7.from_roman, s)
|
||||
|
||||
def test_repeated_pairs(self):
|
||||
@@ -112,12 +112,12 @@ class FromRomanBadInput(unittest.TestCase):
|
||||
'MCMC', 'XCX', 'IVI', 'LM', 'LD', 'LC'):
|
||||
self.assertRaises(roman7.InvalidRomanNumeralError, roman7.from_roman, s)
|
||||
|
||||
def test_blank(self):
|
||||
"""from_roman should fail with blank string"""
|
||||
self.assertRaises(roman7.InvalidRomanNumeralError, roman7.from_roman, "")
|
||||
def test_non_string(self):
|
||||
"""from_roman should fail with non-string input"""
|
||||
self.assertRaises(roman7.InvalidRomanNumeralError, roman7.from_roman, 1)
|
||||
|
||||
class SanityCheck(unittest.TestCase):
|
||||
def testSanity(self):
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 4000):
|
||||
numeral = roman7.to_roman(integer)
|
||||
|
||||
@@ -98,7 +98,7 @@ class ToRomanBadInput(unittest.TestCase):
|
||||
class FromRomanBadInput(unittest.TestCase):
|
||||
def test_too_many_repeated_numerals(self):
|
||||
"""from_roman should fail with too many repeated numerals"""
|
||||
for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
for s in ('MMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
self.assertRaises(roman8.InvalidRomanNumeralError, roman8.from_roman, s)
|
||||
|
||||
def test_repeated_pairs(self):
|
||||
@@ -120,8 +120,8 @@ class FromRomanBadInput(unittest.TestCase):
|
||||
"""from_roman should fail with non-string input"""
|
||||
self.assertRaises(roman8.InvalidRomanNumeralError, roman8.from_roman, 1)
|
||||
|
||||
class SanityCheck(unittest.TestCase):
|
||||
def testSanity(self):
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 4000):
|
||||
numeral = roman8.to_roman(integer)
|
||||
|
||||
@@ -0,0 +1,159 @@
|
||||
"""Unit test for roman1.py
|
||||
|
||||
This program is part of "Dive Into Python 3", a free Python book for
|
||||
experienced programmers. Visit http://diveintopython3.org/ for the
|
||||
latest version.
|
||||
"""
|
||||
|
||||
import roman9
|
||||
import unittest
|
||||
|
||||
class KnownValues(unittest.TestCase):
|
||||
known_values = ( (1, 'I'),
|
||||
(2, 'II'),
|
||||
(3, 'III'),
|
||||
(4, 'IV'),
|
||||
(5, 'V'),
|
||||
(6, 'VI'),
|
||||
(7, 'VII'),
|
||||
(8, 'VIII'),
|
||||
(9, 'IX'),
|
||||
(10, 'X'),
|
||||
(50, 'L'),
|
||||
(100, 'C'),
|
||||
(500, 'D'),
|
||||
(1000, 'M'),
|
||||
(31, 'XXXI'),
|
||||
(148, 'CXLVIII'),
|
||||
(294, 'CCXCIV'),
|
||||
(312, 'CCCXII'),
|
||||
(421, 'CDXXI'),
|
||||
(528, 'DXXVIII'),
|
||||
(621, 'DCXXI'),
|
||||
(782, 'DCCLXXXII'),
|
||||
(870, 'DCCCLXX'),
|
||||
(941, 'CMXLI'),
|
||||
(1043, 'MXLIII'),
|
||||
(1110, 'MCX'),
|
||||
(1226, 'MCCXXVI'),
|
||||
(1301, 'MCCCI'),
|
||||
(1485, 'MCDLXXXV'),
|
||||
(1509, 'MDIX'),
|
||||
(1607, 'MDCVII'),
|
||||
(1754, 'MDCCLIV'),
|
||||
(1832, 'MDCCCXXXII'),
|
||||
(1993, 'MCMXCIII'),
|
||||
(2074, 'MMLXXIV'),
|
||||
(2152, 'MMCLII'),
|
||||
(2212, 'MMCCXII'),
|
||||
(2343, 'MMCCCXLIII'),
|
||||
(2499, 'MMCDXCIX'),
|
||||
(2574, 'MMDLXXIV'),
|
||||
(2646, 'MMDCXLVI'),
|
||||
(2723, 'MMDCCXXIII'),
|
||||
(2892, 'MMDCCCXCII'),
|
||||
(2975, 'MMCMLXXV'),
|
||||
(3051, 'MMMLI'),
|
||||
(3185, 'MMMCLXXXV'),
|
||||
(3250, 'MMMCCL'),
|
||||
(3313, 'MMMCCCXIII'),
|
||||
(3408, 'MMMCDVIII'),
|
||||
(3501, 'MMMDI'),
|
||||
(3610, 'MMMDCX'),
|
||||
(3743, 'MMMDCCXLIII'),
|
||||
(3844, 'MMMDCCCXLIV'),
|
||||
(3888, 'MMMDCCCLXXXVIII'),
|
||||
(3940, 'MMMCMXL'),
|
||||
(3999, 'MMMCMXCIX'),
|
||||
(4000, 'MMMM'),
|
||||
(4500, 'MMMMD'),
|
||||
(4888, 'MMMMDCCCLXXXVIII'),
|
||||
(4999, 'MMMMCMXCIX'))
|
||||
|
||||
def test_to_roman_known_values(self):
|
||||
"""to_roman should give known result with known input"""
|
||||
for integer, numeral in self.known_values:
|
||||
result = roman9.to_roman(integer)
|
||||
self.assertEqual(numeral, result)
|
||||
|
||||
def test_from_roman_known_values(self):
|
||||
"""from_roman should give known result with known input"""
|
||||
for integer, numeral in self.known_values:
|
||||
result = roman9.from_roman(numeral)
|
||||
self.assertEqual(integer, result)
|
||||
|
||||
class ToRomanBadInput(unittest.TestCase):
|
||||
def test_too_large(self):
|
||||
"""to_roman should fail with large input"""
|
||||
self.assertRaises(roman9.OutOfRangeError, roman9.to_roman, 5000)
|
||||
|
||||
def test_zero(self):
|
||||
"""to_roman should fail with 0 input"""
|
||||
self.assertRaises(roman9.OutOfRangeError, roman9.to_roman, 0)
|
||||
|
||||
def test_negative(self):
|
||||
"""to_roman should fail with negative input"""
|
||||
self.assertRaises(roman9.OutOfRangeError, roman9.to_roman, -1)
|
||||
|
||||
def test_non_integer(self):
|
||||
"""to_roman should fail with non-integer input"""
|
||||
self.assertRaises(roman9.NotIntegerError, roman9.to_roman, 0.5)
|
||||
|
||||
class FromRomanBadInput(unittest.TestCase):
|
||||
def test_too_many_repeated_numerals(self):
|
||||
"""from_roman should fail with too many repeated numerals"""
|
||||
for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):
|
||||
self.assertRaises(roman9.InvalidRomanNumeralError, roman9.from_roman, s)
|
||||
|
||||
def test_repeated_pairs(self):
|
||||
"""from_roman should fail with repeated pairs of numerals"""
|
||||
for s in ('CMCM', 'CDCD', 'XCXC', 'XLXL', 'IXIX', 'IVIV'):
|
||||
self.assertRaises(roman9.InvalidRomanNumeralError, roman9.from_roman, s)
|
||||
|
||||
def test_malformed_antecedents(self):
|
||||
"""from_roman should fail with malformed antecedents"""
|
||||
for s in ('IIMXCC', 'VX', 'DCM', 'CMM', 'IXIV',
|
||||
'MCMC', 'XCX', 'IVI', 'LM', 'LD', 'LC'):
|
||||
self.assertRaises(roman9.InvalidRomanNumeralError, roman9.from_roman, s)
|
||||
|
||||
def test_blank(self):
|
||||
"""from_roman should fail with blank string"""
|
||||
self.assertRaises(roman9.InvalidRomanNumeralError, roman9.from_roman, "")
|
||||
|
||||
def test_non_string(self):
|
||||
"""from_roman should fail with non-string input"""
|
||||
self.assertRaises(roman9.InvalidRomanNumeralError, roman9.from_roman, 1)
|
||||
|
||||
class RoundtripCheck(unittest.TestCase):
|
||||
def test_roundtrip(self):
|
||||
"""from_roman(to_roman(n))==n for all n"""
|
||||
for integer in range(1, 5000):
|
||||
numeral = roman9.to_roman(integer)
|
||||
result = roman9.from_roman(numeral)
|
||||
self.assertEqual(integer, result)
|
||||
|
||||
if __name__ == "__main__":
|
||||
unittest.main()
|
||||
|
||||
# Copyright (c) 2009, Mark Pilgrim, All rights reserved.
|
||||
#
|
||||
# Redistribution and use in source and binary forms, with or without modification,
|
||||
# are permitted provided that the following conditions are met:
|
||||
#
|
||||
# * Redistributions of source code must retain the above copyright notice,
|
||||
# this list of conditions and the following disclaimer.
|
||||
# * Redistributions in binary form must reproduce the above copyright notice,
|
||||
# this list of conditions and the following disclaimer in the documentation
|
||||
# and/or other materials provided with the distribution.
|
||||
#
|
||||
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS'
|
||||
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||||
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
# POSSIBILITY OF SUCH DAMAGE.
|
||||
Reference in New Issue
Block a user