summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2010-12-24 00:52:54 (GMT)
committerRaymond Hettinger <python@rcn.com>2010-12-24 00:52:54 (GMT)
commit6518f5e78060f0d1cbc44b3034427fe0300fb062 (patch)
treec5f343a05700f3fe055a9aac884aed992d26c412
parent83961245b4db5d50a533e6f20d9472175d18d5e3 (diff)
downloadcpython-6518f5e78060f0d1cbc44b3034427fe0300fb062.zip
cpython-6518f5e78060f0d1cbc44b3034427fe0300fb062.tar.gz
cpython-6518f5e78060f0d1cbc44b3034427fe0300fb062.tar.bz2
Fix docs and comment for r87454.
-rw-r--r--Doc/library/unittest.rst2
-rw-r--r--Lib/unittest/case.py2
2 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/unittest.rst b/Doc/library/unittest.rst
index 9c0f1a1..9e30908 100644
--- a/Doc/library/unittest.rst
+++ b/Doc/library/unittest.rst
@@ -1160,7 +1160,7 @@ Test cases
Duplicate elements are *not* ignored when comparing *actual* and
*expected*. It verifies if each element has the same count in both
sequences. Equivalent to:
- ``assertEqual(Counter(iter(actual)), Counter(iter(expected)))``
+ ``assertEqual(Counter(list(actual)), Counter(list(expected)))``
but works with sequences of unhashable objects as well.
.. versionadded:: 3.2
diff --git a/Lib/unittest/case.py b/Lib/unittest/case.py
index 68e53a5..ad5fe61 100644
--- a/Lib/unittest/case.py
+++ b/Lib/unittest/case.py
@@ -1021,7 +1021,7 @@ class TestCase(object):
actual = collections.Counter(actual_seq)
expected = collections.Counter(expected_seq)
except TypeError:
- # Unsortable items (example: set(), complex(), ...)
+ # Handle case with unhashable elements
missing, unexpected = unorderable_list_difference(expected_seq, actual_seq)
else:
if actual == expected: