mirror of
https://github.com/python/cpython.git
synced 2025-08-04 08:59:19 +00:00
SF bug 1065388: calendar day/month name lookup too slow
__getitem__() methods: compute only the new spellings needed to satisfy the given indexing object. This is purely an optimization (it should have no effect on visible semantics).
This commit is contained in:
parent
fba7369824
commit
bbc0d4409c
3 changed files with 35 additions and 16 deletions
|
@ -37,10 +37,9 @@ class CalendarTestCase(unittest.TestCase):
|
|||
self.assertEqual(len(value), 7)
|
||||
self.assertEqual(len(value[:]), 7)
|
||||
# ensure they're all unique
|
||||
d = {}
|
||||
for v in value:
|
||||
d[v] = 1
|
||||
self.assertEqual(len(d), 7)
|
||||
self.assertEqual(len(set(value)), 7)
|
||||
# verify it "acts like a sequence" in two forms of iteration
|
||||
self.assertEqual(value[::-1], list(reversed(value)))
|
||||
|
||||
def test_months(self):
|
||||
for attr in "month_name", "month_abbr":
|
||||
|
@ -49,10 +48,9 @@ class CalendarTestCase(unittest.TestCase):
|
|||
self.assertEqual(len(value[:]), 13)
|
||||
self.assertEqual(value[0], "")
|
||||
# ensure they're all unique
|
||||
d = {}
|
||||
for v in value:
|
||||
d[v] = 1
|
||||
self.assertEqual(len(d), 13)
|
||||
self.assertEqual(len(set(value)), 13)
|
||||
# verify it "acts like a sequence" in two forms of iteration
|
||||
self.assertEqual(value[::-1], list(reversed(value)))
|
||||
|
||||
|
||||
class MonthCalendarTestCase(unittest.TestCase):
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue