[Python-checkins] python/dist/src/Doc/lib libcollections.tex, 1.9, 1.10 libitertools.tex, 1.29, 1.30

[rhettinger at users.sourceforge.net]

Update of /cvsroot/python/python/dist/src/Doc/lib
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv24214/Doc/lib

Modified Files:
	libcollections.tex libitertools.tex 
Log Message:
Minor wording and spacing nits.

Index: libcollections.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/lib/libcollections.tex,v
retrieving revision 1.9
retrieving revision 1.10
diff -C2 -d -r1.9 -r1.10
*** libcollections.tex	12 May 2004 20:55:56 -0000	1.9
--- libcollections.tex	12 Jun 2004 07:59:40 -0000	1.10
***************
*** 136,145 ****
  
  The \method{rotate()} method provides a way to implement \class{deque}
! slicing and deletion:
! 
! This pure python implementation of \code{del d[n]} shows how to use the
! \method{rotate()} method as a building block for implementing a variety
! of class{deque} operations:
! 
  \begin{verbatim}
  def delete_nth(d, n):
--- 136,143 ----
  
  The \method{rotate()} method provides a way to implement \class{deque}
! slicing and deletion.  For example, a pure python implementation of
! \code{del d[n]} relies on the \method{rotate()} method to position
! elements to be popped:
!     
  \begin{verbatim}
  def delete_nth(d, n):
***************
*** 189,195 ****
  
  Multi-pass data reduction algorithms can be succinctly expressed and
! efficiently coded by extracting elements using multiple calls to
! \method{popleft()}, applying the reduction function, and using
! \method{append()} for adding the result back to the queue.
  
  For example, building a balanced binary tree of nested lists entails
--- 187,193 ----
  
  Multi-pass data reduction algorithms can be succinctly expressed and
! efficiently coded by extracting elements with multiple calls to
! \method{popleft()}, applying the reduction function, and calling
! \method{append()} to add the result back to the queue.
  
  For example, building a balanced binary tree of nested lists entails

Index: libitertools.tex
===================================================================
RCS file: /cvsroot/python/python/dist/src/Doc/lib/libitertools.tex,v
retrieving revision 1.29
retrieving revision 1.30
diff -C2 -d -r1.29 -r1.30
*** libitertools.tex	1 May 2004 08:31:36 -0000	1.29
--- libitertools.tex	12 Jun 2004 07:59:40 -0000	1.30
***************
*** 477,481 ****
  
      Useful for emulating the behavior of the built-in map() function.
- 
      """
      return chain(seq, repeat(None))
--- 477,480 ----
***************
*** 495,499 ****
      
      Example:  repeatfunc(random.random)
-     
      """
      if times is None:
--- 494,497 ----