Use more appropriate sets-strategy for map's keys

That way there won't be excess collapsing keys.

diff --git a/pyac/tests/test_map.py b/pyac/tests/test_map.py
index 89c41b45f2598d09ce12e6a3e50be5aae033a03efd6a3c380bc6132944dad02f..caf27186d485e99d8d067b76a3886a606413559d601a6c64c73fdef7edf2576f 100644 (file)
--- a/pyac/tests/test_map.py
+++ b/pyac/tests/test_map.py
@@ -2,7 +2,7 @@ from unittest import TestCase
 
 from hypothesis import given
 from hypothesis.strategies import dictionaries
-from hypothesis.strategies import lists
+from hypothesis.strategies import sets
 
 from pyac import DecodeError
 from pyac import dumps
@@ -55,12 +55,12 @@ class TestMap(TestCase):
         self.assertEqual(decoded, test_map)
         self.assertSequenceEqual(tail, junk)
 
-    @given(lists(mapkey_st, max_size=4), junk_st)
+    @given(sets(mapkey_st, max_size=4), junk_st)
     def test_decode_to_set(self, keys, junk):
         test_map = {key: None for key in keys}
         encoded = dumps(test_map) + junk
         decoded, tail = loads(encoded, sets=True)
-        self.assertEqual(decoded, set(keys))
+        self.assertSetEqual(decoded, keys)
         self.assertSequenceEqual(tail, junk)
 
     def test_map_throws_when_decoding_unsorted_keys(self):