summaryrefslogtreecommitdiff
path: root/tests/fixtures_regress
diff options
context:
space:
mode:
authorRamiro Morales <cramm0@gmail.com>2014-05-11 20:39:00 -0300
committerRamiro Morales <cramm0@gmail.com>2014-05-11 20:39:00 -0300
commit9762ba26304dd927d69fc5446df2e83dc22aa2e3 (patch)
treeb4636e3442d0bb28acad635f8de658c42d3670d6 /tests/fixtures_regress
parenta75324c6544d728d3bd8f678b1b8021fdff18332 (diff)
downloaddjango-9762ba26304dd927d69fc5446df2e83dc22aa2e3.tar.gz
Unneeded, Python 3 incompatible code in a75324c6 tests.
Diffstat (limited to 'tests/fixtures_regress')
-rw-r--r--tests/fixtures_regress/tests.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/tests/fixtures_regress/tests.py b/tests/fixtures_regress/tests.py
index e9aca4252b..c8a2d7bbea 100644
--- a/tests/fixtures_regress/tests.py
+++ b/tests/fixtures_regress/tests.py
@@ -768,8 +768,8 @@ class M2MNaturalKeyFixtureTests(TestCase):
# The dependency sorting should not result in an error, and the
# through model should have dependencies to the other models and as
# such come last in the list.
- self.assertEqual(sorted(sorted_deps[:3]), sorted([A, B, C]))
- self.assertEqual(sorted(sorted_deps[3:]), sorted([AtoB, BtoC, CtoA]))
+ self.assertEqual(sorted_deps[:3], [A, B, C])
+ self.assertEqual(sorted_deps[3:], [AtoB, BtoC, CtoA])
def test_dependency_sorting_m2m_complex_circular_2(self):
"""
@@ -789,7 +789,7 @@ class M2MNaturalKeyFixtureTests(TestCase):
self.fail("Serialization dependency solving algorithm isn't "
"capable of handling circular M2M setups with "
"intermediate models plus natural key dependency hints.")
- self.assertEqual(sorted(sorted_deps[:2]), sorted([M2MComplexCircular2A, M2MComplexCircular2B]))
+ self.assertEqual(sorted_deps[:2], [M2MComplexCircular2A, M2MComplexCircular2B])
self.assertEqual(sorted_deps[2:], [M2MCircular2ThroughAB])
def test_dump_and_load_m2m_simple(self):