diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-03-10 07:59:13 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-03-10 07:59:13 (GMT) |
| commit | d674e17e961e0f466678106861627ce3d03840ca (patch) | |
| tree | 0267d1ca96ba451a0caa3a8438c4116b6fd36825 | |
| parent | 7d1cd6947d15f16a63b244a34ca7a28bef4a5214 (diff) | |
| download | cpython-d674e17e961e0f466678106861627ce3d03840ca.zip cpython-d674e17e961e0f466678106861627ce3d03840ca.tar.gz cpython-d674e17e961e0f466678106861627ce3d03840ca.tar.bz2 | |
SF patch 499062: Minor typo in test_generators.py.
There's no actual patch there. It's an objection that Guido's example
doesn't actually generator "leaves", so change the comment that says
it does.
| -rw-r--r-- | Lib/test/test_generators.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/test/test_generators.py b/Lib/test/test_generators.py index 2c319e5..155a83c 100644 --- a/Lib/test/test_generators.py +++ b/Lib/test/test_generators.py @@ -259,7 +259,7 @@ Guido's binary tree example. >>> # Show it off: create a tree. >>> t = tree("ABCDEFGHIJKLMNOPQRSTUVWXYZ") - >>> # A recursive generator that generates Tree leaves in in-order. + >>> # A recursive generator that generates Tree labels in in-order. >>> def inorder(t): ... if t: ... for x in inorder(t.left): |