[Python-checkins] CVS: python/dist/src/Doc/ref ref1.tex,1.11,1.12 ref3.tex,1.45,1.46 ref6.tex,1.26,1.27 ref7.tex,1.19,1.20

[Thomas Wouters]

Update of /cvsroot/python/python/dist/src/Doc/ref
In directory slayer.i.sourceforge.net:/tmp/cvs-serv27163/Doc/ref

Modified Files:
	ref1.tex ref3.tex ref6.tex ref7.tex 
Log Message:

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.



Index: ref1.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/ref/ref1.tex,v
retrieving revision 1.11
retrieving revision 1.12
diff -C2 -r1.11 -r1.12
*** ref1.tex	1999/11/10 16:13:25	1.11
--- ref1.tex	2000/07/16 19:05:38	1.12
***************
*** 14,18 ****
  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,
  maybe you could volunteer your time --- or invent a cloning machine
  :-).
--- 14,18 ----
  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 definition of the language,
  maybe you could volunteer your time --- or invent a cloning machine
  :-).

Index: ref3.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/ref/ref3.tex,v
retrieving revision 1.45
retrieving revision 1.46
diff -C2 -r1.45 -r1.46
*** ref3.tex	2000/07/13 04:57:58	1.45
--- ref3.tex	2000/07/16 19:05:38	1.46
***************
*** 218,222 ****
  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
  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}]}.
--- 218,222 ----
  The built-in function \function{len()}\bifuncindex{len} returns the
  number of items of a sequence.
! 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}]}.
***************
*** 311,315 ****
  subscription and slicing notations can be used as the target of
  assignment and \keyword{del} (delete) statements.
! \obindex{mutable sequece}
  \obindex{mutable}
  \indexii{assignment}{statement}
--- 311,315 ----
  subscription and slicing notations can be used as the target of
  assignment and \keyword{del} (delete) statements.
! \obindex{mutable sequence}
  \obindex{mutable}
  \indexii{assignment}{statement}
***************
*** 701,705 ****
  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
  the interpreter); \member{co_stacksize} is the required stack size
  (including local variables); \member{co_flags} is an integer encoding
--- 701,705 ----
  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 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
***************
*** 816,821 ****
  \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
  \code{None} if omitted. These attributes can have any type.
  \withsubitem{(slice object attribute)}{
--- 816,821 ----
  \function{slice()}\bifuncindex{slice} function.
  
! 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)}{

Index: ref6.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/ref/ref6.tex,v
retrieving revision 1.26
retrieving revision 1.27
diff -C2 -r1.26 -r1.27
*** ref6.tex	2000/07/06 00:50:42	1.26
--- ref6.tex	2000/07/16 19:05:38	1.27
***************
*** 432,436 ****
  \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
  laziness and will eventually be lifted.}
  It continues with the next cycle of the nearest enclosing loop.
--- 432,436 ----
  \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 implementor's
  laziness and will eventually be lifted.}
  It continues with the next cycle of the nearest enclosing loop.

Index: ref7.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/ref/ref7.tex,v
retrieving revision 1.19
retrieving revision 1.20
diff -C2 -r1.19 -r1.20
*** ref7.tex	2000/04/03 04:41:18	1.19
--- ref7.tex	2000/07/16 19:05:38	1.20
***************
*** 212,216 ****
  
  If the evaluation of an expression in the header of an except clause
! raises an exception, the original search for a handler is cancelled
  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
--- 212,216 ----
  
  If the evaluation of an expression in the header of an except clause
! 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