mirror of
https://github.com/python/cpython.git
synced 2025-08-04 00:48:58 +00:00
convert usage of fail* to assert*
This commit is contained in:
parent
be96cf608f
commit
5c8da86f3a
268 changed files with 5017 additions and 5017 deletions
|
@ -9,7 +9,7 @@ class DictTest(unittest.TestCase):
|
|||
def test_constructor(self):
|
||||
# calling built-in types without argument must return empty
|
||||
self.assertEqual(dict(), {})
|
||||
self.assert_(dict() is not {})
|
||||
self.assertTrue(dict() is not {})
|
||||
|
||||
def test_literal_constructor(self):
|
||||
# check literal constructor for different sized dicts (to exercise the BUILD_MAP oparg
|
||||
|
@ -23,18 +23,18 @@ class DictTest(unittest.TestCase):
|
|||
self.assertEqual(eval(dictliteral), dict(items))
|
||||
|
||||
def test_bool(self):
|
||||
self.assert_(not {})
|
||||
self.assert_({1: 2})
|
||||
self.assert_(bool({}) is False)
|
||||
self.assert_(bool({1: 2}) is True)
|
||||
self.assertTrue(not {})
|
||||
self.assertTrue({1: 2})
|
||||
self.assertTrue(bool({}) is False)
|
||||
self.assertTrue(bool({1: 2}) is True)
|
||||
|
||||
def test_keys(self):
|
||||
d = {}
|
||||
self.assertEqual(d.keys(), [])
|
||||
d = {'a': 1, 'b': 2}
|
||||
k = d.keys()
|
||||
self.assert_(d.has_key('a'))
|
||||
self.assert_(d.has_key('b'))
|
||||
self.assertTrue(d.has_key('a'))
|
||||
self.assertTrue(d.has_key('b'))
|
||||
|
||||
self.assertRaises(TypeError, d.keys, None)
|
||||
|
||||
|
@ -57,7 +57,7 @@ class DictTest(unittest.TestCase):
|
|||
|
||||
def test_has_key(self):
|
||||
d = {}
|
||||
self.assert_(not d.has_key('a'))
|
||||
self.assertTrue(not d.has_key('a'))
|
||||
d = {'a': 1, 'b': 2}
|
||||
k = d.keys()
|
||||
k.sort()
|
||||
|
@ -67,12 +67,12 @@ class DictTest(unittest.TestCase):
|
|||
|
||||
def test_contains(self):
|
||||
d = {}
|
||||
self.assert_(not ('a' in d))
|
||||
self.assert_('a' not in d)
|
||||
self.assertTrue(not ('a' in d))
|
||||
self.assertTrue('a' not in d)
|
||||
d = {'a': 1, 'b': 2}
|
||||
self.assert_('a' in d)
|
||||
self.assert_('b' in d)
|
||||
self.assert_('c' not in d)
|
||||
self.assertTrue('a' in d)
|
||||
self.assertTrue('b' in d)
|
||||
self.assertTrue('c' not in d)
|
||||
|
||||
self.assertRaises(TypeError, d.__contains__)
|
||||
|
||||
|
@ -206,7 +206,7 @@ class DictTest(unittest.TestCase):
|
|||
def test_fromkeys(self):
|
||||
self.assertEqual(dict.fromkeys('abc'), {'a':None, 'b':None, 'c':None})
|
||||
d = {}
|
||||
self.assert_(not(d.fromkeys('abc') is d))
|
||||
self.assertTrue(not(d.fromkeys('abc') is d))
|
||||
self.assertEqual(d.fromkeys('abc'), {'a':None, 'b':None, 'c':None})
|
||||
self.assertEqual(d.fromkeys((4,5),0), {4:0, 5:0})
|
||||
self.assertEqual(d.fromkeys([]), {})
|
||||
|
@ -217,14 +217,14 @@ class DictTest(unittest.TestCase):
|
|||
class dictlike(dict): pass
|
||||
self.assertEqual(dictlike.fromkeys('a'), {'a':None})
|
||||
self.assertEqual(dictlike().fromkeys('a'), {'a':None})
|
||||
self.assert_(type(dictlike.fromkeys('a')) is dictlike)
|
||||
self.assert_(type(dictlike().fromkeys('a')) is dictlike)
|
||||
self.assertTrue(type(dictlike.fromkeys('a')) is dictlike)
|
||||
self.assertTrue(type(dictlike().fromkeys('a')) is dictlike)
|
||||
class mydict(dict):
|
||||
def __new__(cls):
|
||||
return UserDict.UserDict()
|
||||
ud = mydict.fromkeys('ab')
|
||||
self.assertEqual(ud, {'a':None, 'b':None})
|
||||
self.assert_(isinstance(ud, UserDict.UserDict))
|
||||
self.assertTrue(isinstance(ud, UserDict.UserDict))
|
||||
self.assertRaises(TypeError, dict.fromkeys)
|
||||
|
||||
class Exc(Exception): pass
|
||||
|
@ -261,10 +261,10 @@ class DictTest(unittest.TestCase):
|
|||
|
||||
def test_get(self):
|
||||
d = {}
|
||||
self.assert_(d.get('c') is None)
|
||||
self.assertTrue(d.get('c') is None)
|
||||
self.assertEqual(d.get('c', 3), 3)
|
||||
d = {'a' : 1, 'b' : 2}
|
||||
self.assert_(d.get('c') is None)
|
||||
self.assertTrue(d.get('c') is None)
|
||||
self.assertEqual(d.get('c', 3), 3)
|
||||
self.assertEqual(d.get('a'), 1)
|
||||
self.assertEqual(d.get('a', 3), 1)
|
||||
|
@ -274,9 +274,9 @@ class DictTest(unittest.TestCase):
|
|||
def test_setdefault(self):
|
||||
# dict.setdefault()
|
||||
d = {}
|
||||
self.assert_(d.setdefault('key0') is None)
|
||||
self.assertTrue(d.setdefault('key0') is None)
|
||||
d.setdefault('key0', [])
|
||||
self.assert_(d.setdefault('key0') is None)
|
||||
self.assertTrue(d.setdefault('key0') is None)
|
||||
d.setdefault('key', []).append(3)
|
||||
self.assertEqual(d['key'][0], 3)
|
||||
d.setdefault('key', []).append(4)
|
||||
|
@ -318,9 +318,9 @@ class DictTest(unittest.TestCase):
|
|||
self.assertEqual(va, int(ka))
|
||||
kb, vb = tb = b.popitem()
|
||||
self.assertEqual(vb, int(kb))
|
||||
self.assert_(not(copymode < 0 and ta != tb))
|
||||
self.assert_(not a)
|
||||
self.assert_(not b)
|
||||
self.assertTrue(not(copymode < 0 and ta != tb))
|
||||
self.assertTrue(not a)
|
||||
self.assertTrue(not b)
|
||||
|
||||
d = {}
|
||||
self.assertRaises(KeyError, d.popitem)
|
||||
|
@ -395,8 +395,8 @@ class DictTest(unittest.TestCase):
|
|||
self.assertRaises(Exc, repr, d)
|
||||
|
||||
def test_le(self):
|
||||
self.assert_(not ({} < {}))
|
||||
self.assert_(not ({1: 2} < {1L: 2L}))
|
||||
self.assertTrue(not ({} < {}))
|
||||
self.assertTrue(not ({1: 2} < {1L: 2L}))
|
||||
|
||||
class Exc(Exception): pass
|
||||
|
||||
|
@ -430,8 +430,8 @@ class DictTest(unittest.TestCase):
|
|||
d = D({1: 2, 3: 4})
|
||||
self.assertEqual(d[1], 2)
|
||||
self.assertEqual(d[3], 4)
|
||||
self.assert_(2 not in d)
|
||||
self.assert_(2 not in d.keys())
|
||||
self.assertTrue(2 not in d)
|
||||
self.assertTrue(2 not in d.keys())
|
||||
self.assertEqual(d[2], 42)
|
||||
class E(dict):
|
||||
def __missing__(self, key):
|
||||
|
@ -567,7 +567,7 @@ class DictTest(unittest.TestCase):
|
|||
obj.x = i(container)
|
||||
del obj, container
|
||||
gc.collect()
|
||||
self.assert_(ref() is None, "Cycle was not collected")
|
||||
self.assertTrue(ref() is None, "Cycle was not collected")
|
||||
|
||||
def _not_tracked(self, t):
|
||||
# Nested containers can take several collections to untrack
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue