[3.12] Make the iter_except() recipe more compact. (gh-116132) (gh0116133)

diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst
index f265e046afc85ab91f3def9db75ce7c36710c240..2e6d5eeb12d288f3bbdc0327b2c489f135a9d9d0 100644 (file)
--- a/Doc/library/itertools.rst
+++ b/Doc/library/itertools.rst
@@ -975,28 +975,10 @@ which incur interpreter overhead.
        """ Call a function repeatedly until an exception is raised.
 
        Converts a call-until-exception interface to an iterator interface.
-       Like builtins.iter(func, sentinel) but uses an exception instead
-       of a sentinel to end the loop.
-
-       Priority queue iterator:
-           iter_except(functools.partial(heappop, h), IndexError)
-
-       Non-blocking dictionary iterator:
-           iter_except(d.popitem, KeyError)
-
-       Non-blocking deque iterator:
-           iter_except(d.popleft, IndexError)
-
-       Non-blocking iterator over a producer Queue:
-           iter_except(q.get_nowait, Queue.Empty)
-
-       Non-blocking set iterator:
-           iter_except(s.pop, KeyError)
-
        """
+       # iter_except(d.popitem, KeyError) --> non-blocking dictionary iterator
        try:
            if first is not None:
-               # For database APIs needing an initial call to db.first()
                yield first()
            while True:
                yield func()
@@ -1004,7 +986,6 @@ which incur interpreter overhead.
            pass
 
 
-
 The following recipes have a more mathematical flavor:
 
 .. testcode::