summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorAndrew M. Kuchling <amk@amk.ca>2001-07-17 18:25:01 (GMT)
committerAndrew M. Kuchling <amk@amk.ca>2001-07-17 18:25:01 (GMT)
commitc32cc7c11dfde9e464760052f8e8a6688d3c67f5 (patch)
tree810478219415704b3ecc7be49da7ddf9dd7b1100
parent55a78992daed1005d537697ac344703d8dbf3f5e (diff)
downloadcpython-c32cc7c11dfde9e464760052f8e8a6688d3c67f5.zip
cpython-c32cc7c11dfde9e464760052f8e8a6688d3c67f5.tar.gz
cpython-c32cc7c11dfde9e464760052f8e8a6688d3c67f5.tar.bz2
Delete sentence fragment (noted by Fred Bremmer)
-rw-r--r--Doc/whatsnew/whatsnew22.tex10
1 files changed, 5 insertions, 5 deletions
diff --git a/Doc/whatsnew/whatsnew22.tex b/Doc/whatsnew/whatsnew22.tex
index 2ea43e0..7d2a867 100644
--- a/Doc/whatsnew/whatsnew22.tex
+++ b/Doc/whatsnew/whatsnew22.tex
@@ -268,10 +268,10 @@ own class and storing all the local variables of the generator as
instance variables. For example, returning a list of integers could
be done by setting \code{self.count} to 0, and having the
\method{next()} method increment \code{self.count} and return it.
-because it would be easy to write a Python class. However, for a
-moderately complicated generator, writing a corresponding class would
-be much messier. \file{Lib/test/test_generators.py} contains a number
-of more interesting examples. The simplest one implements an in-order
+However, for a moderately complicated generator, writing a
+corresponding class would be much messier.
+\file{Lib/test/test_generators.py} contains a number of more
+interesting examples. The simplest one implements an in-order
traversal of a tree using generators recursively.
\begin{verbatim}
@@ -640,6 +640,6 @@ slot, or raise an exception if that's \NULL.
The author would like to thank the following people for offering
suggestions and corrections to various drafts of this article: Fred
-L. Drake, Jr., Tim Peters, Neil Schemenauer.
+Bremmer, Fred L. Drake, Jr., Tim Peters, Neil Schemenauer.
\end{document}