Simplify test

pablogsal · pablogsal · commit 618a7913ea4d · 2020-01-18T05:35:43.000Z
diff --git a/Doc/library/functools.rst b/Doc/library/functools.rst
@@ -679,7 +679,7 @@ The :mod:`functools` module defines the following functions:
                   yield from node_group
                   self.done(*node_group)
 
-      The particular order that is returned may depend on the particular order in
+      The particular order that is returned may depend on the specific order in
       which the items were inserted in the graph. For example:
 
       .. doctest::
diff --git a/Lib/functools.py b/Lib/functools.py
@@ -415,7 +415,7 @@ def _find_cycle(self):
     def static_order(self):
         """Returns an iterable of nodes in a topological order.
 
-        The particular order that is returned may depend on the particular
+        The particular order that is returned may depend on the specific
         order in which the items were inserted in the graph.
 
         Using this method does not require to call "prepare" or "done". If any
diff --git a/Lib/test/test_functools.py b/Lib/test/test_functools.py
@@ -1384,9 +1384,8 @@ def get_groups(ts):
             ts.prepare()
             while ts.is_active():
                 nodes = ts.get_ready()
-                for node in nodes:
-                    ts.done(node)
-                yield nodes
+                ts.done(*nodes)
+                yield set(nodes)
 
         ts = functools.TopologicalSorter()
         ts.add(3, 2, 1)
@@ -1402,10 +1401,7 @@ def get_groups(ts):
         ts2.add(6, 7)
         ts2.add(4, 5)
 
-        self.assertEqual(
-                list(map(set, get_groups(ts))),
-                list(map(set, get_groups(ts2)))
-        )
+        self.assertEqual(list(get_groups(ts)), list(get_groups(ts2)))
 
     def test_static_order_does_not_change_with_the_hash_seed(self):
         def check_order_with_hash_seed(seed):
