More of Rob W. W. Hooft's spelling fixes. The only ones left now are the
distutils patches, which I'll leave to the distutils maintainers.
Tip: review the patch like this:
grep "^[\!+-] " <patchfile>
To get a quick and easy way to review the actual changes. Most of the
changes are single-line ones, anyway.
diff --git a/Doc/ref/ref1.tex b/Doc/ref/ref1.tex
index c35f157..37fbad7 100644
--- a/Doc/ref/ref1.tex
+++ b/Doc/ref/ref1.tex
@@ -13,7 +13,7 @@
On the other hand, if you are using
Python and wonder what the precise rules about a particular area of
the language are, you should definitely be able to find them here.
-If you would like to see a more formal definitition of the language,
+If you would like to see a more formal definition of the language,
maybe you could volunteer your time --- or invent a cloning machine
:-).
diff --git a/Doc/ref/ref3.tex b/Doc/ref/ref3.tex
index 4895c9b..cdf5e62 100644
--- a/Doc/ref/ref3.tex
+++ b/Doc/ref/ref3.tex
@@ -217,7 +217,7 @@
These represent finite ordered sets indexed by natural numbers.
The built-in function \function{len()}\bifuncindex{len} returns the
number of items of a sequence.
-When the lenth of a sequence is \var{n}, the
+When the length of a sequence is \var{n}, the
index set contains the numbers 0, 1, \ldots, \var{n}-1. Item
\var{i} of sequence \var{a} is selected by \code{\var{a}[\var{i}]}.
\obindex{sequence}
@@ -310,7 +310,7 @@
Mutable sequences can be changed after they are created. The
subscription and slicing notations can be used as the target of
assignment and \keyword{del} (delete) statements.
-\obindex{mutable sequece}
+\obindex{mutable sequence}
\obindex{mutable}
\indexii{assignment}{statement}
\index{delete}
@@ -700,7 +700,7 @@
the bytecode; \member{co_filename} is the filename from which the code
was compiled; \member{co_firstlineno} is the first line number of the
function; \member{co_lnotab} is a string encoding the mapping from
-byte code offsets to line numbers (for detais see the source code of
+byte code offsets to line numbers (for details see the source code of
the interpreter); \member{co_stacksize} is the required stack size
(including local variables); \member{co_flags} is an integer encoding
a number of flags for the interpreter.
@@ -815,8 +815,8 @@
k:l]}, or \code{a[..., i:j])}. They are also created by the built-in
\function{slice()}\bifuncindex{slice} function.
-Special read-only attributes: \member{start} is the lowerbound;
-\member{stop} is the upperbound; \member{step} is the step value; each is
+Special read-only attributes: \member{start} is the lower bound;
+\member{stop} is the upper bound; \member{step} is the step value; each is
\code{None} if omitted. These attributes can have any type.
\withsubitem{(slice object attribute)}{
\ttindex{start}
diff --git a/Doc/ref/ref6.tex b/Doc/ref/ref6.tex
index e2552be..dc50c27 100644
--- a/Doc/ref/ref6.tex
+++ b/Doc/ref/ref6.tex
@@ -431,7 +431,7 @@
\keyword{while} loop, but not nested in a function or class definition or
\keyword{try} statement within that loop.\footnote{It may
occur within an \keyword{except} or \keyword{else} clause. The
-restriction on occurring in the \keyword{try} clause is implementer's
+restriction on occurring in the \keyword{try} clause is implementor's
laziness and will eventually be lifted.}
It continues with the next cycle of the nearest enclosing loop.
\stindex{for}
diff --git a/Doc/ref/ref7.tex b/Doc/ref/ref7.tex
index 097bbcd..6356cd8 100644
--- a/Doc/ref/ref7.tex
+++ b/Doc/ref/ref7.tex
@@ -211,7 +211,7 @@
handler continues in the surrounding code and on the invocation stack.
If the evaluation of an expression in the header of an except clause
-raises an exception, the original search for a handler is cancelled
+raises an exception, the original search for a handler is canceled
and a search starts for the new exception in the surrounding code and
on the call stack (it is treated as if the entire \keyword{try} statement
raised the exception).
diff --git a/Doc/tut/tut.tex b/Doc/tut/tut.tex
index 5baf03c..fd09c07 100644
--- a/Doc/tut/tut.tex
+++ b/Doc/tut/tut.tex
@@ -741,7 +741,7 @@
Starting with Python 2.0 a new data type for storing text data is
available to the programmer: the Unicode object. It can be used to
store and manipulate Unicode data (see \url{http://www.unicode.org})
-and intergrates well with the existing string objects providing
+and integrates well with the existing string objects providing
auto-conversions where necessary.
Unicode has the advantage of providing one ordinal for every character
@@ -798,7 +798,7 @@
e.g. in regular expressions.
Apart from these standard encodings, Python provides a whole set of
-other ways of creating Unicod strings on the basis of a known
+other ways of creating Unicode strings on the basis of a known
encoding.
The builtin \function{unicode()}\bifuncindex{unicode} provides access
@@ -807,7 +807,7 @@
\emph{Latin-1}, \emph{ASCII}, \emph{UTF-8} and \emph{UTF-16}. The latter two
are variable length encodings which permit to store Unicode characters
in 8 or 16 bits. Python uses UTF-8 as default encoding. This becomes
-noticable when printing Unicode strings or writing them to files.
+noticeable when printing Unicode strings or writing them to files.
\begin{verbatim}
>>> u"äöü"
@@ -3019,7 +3019,7 @@
When an exception occurs, it may have an associated value, also known as
-the exceptions's \emph{argument}.
+the exception's \emph{argument}.
The presence and type of the argument depend on the exception type.
For exception types which have an argument, the except clause may
specify a variable after the exception name (or list) to receive the