Mercurial > cpython-lru_cache-weakref

changeset 19975:4e445a3e07c6 legacy-trunk

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Enable two checks for comparing a complex to a complex subtype instance. Split a string comparison test in two halves, replacing "a==b==a" with separate tests for a==b and b==a. (Reason: while experimenting, this test failed, and I wanted to know if it was the first or the second == operator that failed.)
author Guido van Rossum <guido@python.org>
date Wed, 19 Sep 2001 01:16:16 +0000
parents 8edc44bd0ac7
children da00188d5270
files Lib/test/test_descr.py
diffstat 1 files changed, 4 insertions(+), 3 deletions(-) [+]
line wrap: on
line diff
--- a/Lib/test/test_descr.py	Wed Sep 19 01:13:10 2001 +0000
+++ b/Lib/test/test_descr.py	Wed Sep 19 01:16:16 2001 +0000
@@ -1492,12 +1492,12 @@
     verify(repr(a) == "4j-3")
     base = complex(-3, 4)
     verify(base.__class__ is complex)
-    #XXX verify(a == base)
+    verify(a == base)
     verify(complex(a) == base)
     verify(complex(a).__class__ is complex)
     a = madcomplex(a)  # just trying another form of the constructor
     verify(repr(a) == "4j-3")
-    #XXX verify(a == base)
+    verify(a == base)
     verify(complex(a) == base)
     verify(complex(a).__class__ is complex)
     verify(hash(a) == hash(base))
@@ -1821,7 +1821,8 @@
         def __hash__(self):
             return self.hashcode
 
-    verify('aBc' == cistr('ABC') == 'abc')
+    verify(cistr('ABC') == 'abc')
+    verify('aBc' == cistr('ABC'))
     verify(str(cistr('ABC')) == 'ABC')
 
     d = {cistr('one'): 1, cistr('two'): 2, cistr('tHree'): 3}