[3.12] gh-116842: Improve test comment and fix a doctest (gh-116846) (gh-116847)

diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst
index e36ba8ecc471a5d157bbf4f7010fa0bb9d5831e5..09e04a39a18bef7937b45a77b19ea9592b0f9007 100644 (file)
--- a/Doc/library/itertools.rst
+++ b/Doc/library/itertools.rst
@@ -1405,7 +1405,7 @@ The following recipes have a more mathematical flavor:
     [1, 4]
 
     >>> # Verify faithfulness to type specific index() method behaviors.
-    >>> # For example, bytes and str perform subsequence searches
+    >>> # For example, bytes and str perform continuous-subsequence searches
     >>> # that do not match the general behavior specified
     >>> # in collections.abc.Sequence.index().
     >>> seq = 'abracadabra'
@@ -1556,7 +1556,7 @@ The following recipes have a more mathematical flavor:
     >>> list(roundrobin('abc', 'd', 'ef'))
     ['a', 'd', 'e', 'b', 'f', 'c']
     >>> ranges = [range(5, 1000), range(4, 3000), range(0), range(3, 2000), range(2, 5000), range(1, 3500)]
-    >>> collections.Counter(roundrobin(ranges)) == collections.Counter(ranges)
+    >>> collections.Counter(roundrobin(*ranges)) == collections.Counter(chain(*ranges))
     True
     >>> # Verify that the inputs are consumed lazily
     >>> input_iterators = list(map(iter, ['abcd', 'ef', '', 'ghijk', 'l', 'mnopqr']))