summaryrefslogtreecommitdiffstats
path: root/Doc/ref
diff options
context:
space:
mode:
authorThomas Wouters <thomas@python.org>2000-07-16 19:05:38 (GMT)
committerThomas Wouters <thomas@python.org>2000-07-16 19:05:38 (GMT)
commitf9b526dbfd9d10f105c96bde76c39232472beb64 (patch)
tree848a306383b6f2cc8a826214d9fee36e28ef32c0 /Doc/ref
parentf8316638afb2eff261c3854ee6e02b9bc47d0955 (diff)
downloadcpython-f9b526dbfd9d10f105c96bde76c39232472beb64.zip
cpython-f9b526dbfd9d10f105c96bde76c39232472beb64.tar.gz
cpython-f9b526dbfd9d10f105c96bde76c39232472beb64.tar.bz2
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.
Diffstat (limited to 'Doc/ref')
-rw-r--r--Doc/ref/ref1.tex2
-rw-r--r--Doc/ref/ref3.tex10
-rw-r--r--Doc/ref/ref6.tex2
-rw-r--r--Doc/ref/ref7.tex2
4 files changed, 8 insertions, 8 deletions
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 @@ fact you would probably end up implementing quite a different language.
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 @@ and \code{z.imag}.
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 @@ parentheses.
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 @@ bytecode; \member{co_names} is a tuple containing the names used by
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 @@ or ellipses separated by commas, e.g., \code{a[i:j:step]}, \code{a[i:j,
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 @@ continue_stmt: "continue"
\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 @@ If no except clause matches the exception, the search for an exception
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).