Dive into Python 的我的翻译------Chapter 15. Refactoring IV [15.2. Handling changing requirements II]

Example 15.6. Modifying test cases for new requirements (romantest71.py)

• + - code
  
  • import roman71
    import unittest
    class KnownValues(unittest.TestCase):
    knownValues = ( (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'),            ----------------------------------------------1
    (4500, 'MMMMD'),
    (4888, 'MMMMDCCCLXXXVIII'),
    (4999, 'MMMMCMXCIX'))
    def testToRomanKnownValues(self):
    """toRoman should give known result with known input"""
    for integer, numeral in self.knownValues:
    result = roman71.toRoman(integer)
    self.assertEqual(numeral, result)
    def testFromRomanKnownValues(self):
    """fromRoman should give known result with known input"""
    for integer, numeral in self.knownValues:
    result = roman71.fromRoman(numeral)
    self.assertEqual(integer, result)
    class ToRomanBadInput(unittest.TestCase):
    def testTooLarge(self):
    """toRoman should fail with large input"""
    self.assertRaises(roman71.OutOfRangeError, roman71.toRoman, 5000)-----------2
    def testZero(self):
    """toRoman should fail with 0 input"""
    self.assertRaises(roman71.OutOfRangeError, roman71.toRoman, 0)
    def testNegative(self):
    """toRoman should fail with negative input"""
    self.assertRaises(roman71.OutOfRangeError, roman71.toRoman, ?1)
    def testNonInteger(self):
    """toRoman should fail with non?integer input"""
    self.assertRaises(roman71.NotIntegerError, roman71.toRoman, 0.5)
    class FromRomanBadInput(unittest.TestCase):
    def testTooManyRepeatedNumerals(self):
    """fromRoman should fail with too many repeated numerals"""
    for s in ('MMMMM', 'DD', 'CCCC', 'LL', 'XXXX', 'VV', 'IIII'):  --------------3
    self.assertRaises(roman71.InvalidRomanNumeralError, roman71.fromRoman, s)
    def testRepeatedPairs(self):
    """fromRoman should fail with repeated pairs of numerals"""
    for s in ('CMCM', 'CDCD', 'XCXC', 'XLXL', 'IXIX', 'IVIV'):
    self.assertRaises(roman71.InvalidRomanNumeralError, roman71.fromRoman, s)
    def testMalformedAntecedent(self):
    """fromRoman should fail with malformed antecedents"""
    for s in ('IIMXCC', 'VX', 'DCM', 'CMM', 'IXIV',
    'MCMC', 'XCX', 'IVI', 'LM', 'LD', 'LC'):
    self.assertRaises(roman71.InvalidRomanNumeralError, roman71.fromRoman, s)
    def testBlank(self):
    """fromRoman should fail with blank string"""
    self.assertRaises(roman71.InvalidRomanNumeralError, roman71.fromRoman, "")
    class SanityCheck(unittest.TestCase):
    def testSanity(self):
    """fromRoman(toRoman(n))==n for all n"""
    for integer in range(1, 5000):    --------------------------------------------4
    numeral = roman71.toRoman(integer)
    result = roman71.fromRoman(numeral)
    self.assertEqual(integer, result)
    class CaseCheck(unittest.TestCase):
    def testToRomanCase(self):
    """toRoman should always return uppercase"""
    for integer in range(1, 5000):
    numeral = roman71.toRoman(integer)
    self.assertEqual(numeral, numeral.upper())
    def testFromRomanCase(self):
    """fromRoman should only accept uppercase input"""
    for integer in range(1, 5000):
    numeral = roman71.toRoman(integer)
    roman71.fromRoman(numeral.upper())
    self.assertRaises(roman71.InvalidRomanNumeralError,
    roman71.fromRoman, numeral.lower())
    if __name__ == "__main__":
    unittest.main()
    
  1.The existing known values don't change (they're all still reasonable values to test), but you need to add a few more in the 4000 range. Here I've included 4000 (the shortest), 4500 (the second shortest), 4888 (the longest), and 4999 (the largest).
  [pope译]
  当前知道值并没有改变(它们仍然是合理的测试值)，但你需要在4000的行后添加更多的测试数据。这里我加入了4000(最小值)，4500(第二小的值)，4888（较大值），4999(最大值)
  2.The definition of "large input" has changed. This test used to call toRoman with 4000 and expect an error; now that 4000-4999 are good values, you need to bump this up to 5000
  [pope译]
  定义"最大输入"的改变.这个测试使用的4000调用toRoman并且预期一个错误抛出，现在4000～4999都是正常值，你需要修改为5000
  3.The definition of "too many repeated numerals" has also changed. This test used to call fromRoman with 'MMMM' and expect an error; now that MMMM is considered a valid Roman numeral, you need to bump this up to 'MMMMM'.
  [pope译] "过多重复字符"的定义也需要改变。这个测试使用"MMMM"调用fromRoman 并且 预期一个错误抛出，现在MMMM被认为是一个有效个罗马字符，你需要跟新它为'MMMMM'.
  4.The sanity check and case checks loop through every number in the range, from 1 to 3999. Since the range has now expanded, these for loops need to be updated as well to go up to 4999.
  [pope译]
  完整性测试{santiy check}用例通过检查范围中的1～3999的每个数字。由于这个范围限制扩展了，循环上限要跟新到4999.
  Now your test cases are up to date with the new requirements, but your code is not, so you expect several of the test cases to fail.
  [pope译]
  现在你的测试用例跟新需求的新数据，但你的代码没有更新，所以执行测试测试用例有失败的。