traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Minor wording and spacing nits.

This commit is contained in:
Raymond Hettinger 2004-06-12 07:59:40 +00:00
parent 34809170e5
commit 2e6694086f
2 changed files with 7 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Doc/lib/libcollections.tex
View File

@ -135,11 +135,9 @@ deque(['c', 'b', 'a'])
This section shows various approaches to working with deques. This section shows various approaches to working with deques.
The \method{rotate()} method provides a way to implement \class{deque} The \method{rotate()} method provides a way to implement \class{deque}
slicing and deletion: slicing and deletion. For example, a pure python implementation of
\code{del d[n]} relies on the \method{rotate()} method to position
This pure python implementation of \code{del d[n]} shows how to use the elements to be popped:
\method{rotate()} method as a building block for implementing a variety
of class{deque} operations:
\begin{verbatim} \begin{verbatim}
def delete_nth(d, n): def delete_nth(d, n):
@ -188,9 +186,9 @@ h
Multi-pass data reduction algorithms can be succinctly expressed and Multi-pass data reduction algorithms can be succinctly expressed and
efficiently coded by extracting elements using multiple calls to efficiently coded by extracting elements with multiple calls to
\method{popleft()}, applying the reduction function, and using \method{popleft()}, applying the reduction function, and calling
\method{append()} for adding the result back to the queue. \method{append()} to add the result back to the queue.
For example, building a balanced binary tree of nested lists entails For example, building a balanced binary tree of nested lists entails
reducing two adjacent nodes into one by grouping them in a list: reducing two adjacent nodes into one by grouping them in a list:

2
Doc/lib/libitertools.tex
View File

@ -476,7 +476,6 @@ def padnone(seq):
"""Returns the sequence elements and then returns None indefinitely. """Returns the sequence elements and then returns None indefinitely.
Useful for emulating the behavior of the built-in map() function. Useful for emulating the behavior of the built-in map() function.
""" """
return chain(seq, repeat(None)) return chain(seq, repeat(None))
@ -494,7 +493,6 @@ def repeatfunc(func, times=None, *args):
"""Repeat calls to func with specified arguments. """Repeat calls to func with specified arguments.
Example: repeatfunc(random.random) Example: repeatfunc(random.random)
""" """
if times is None: if times is None:
return starmap(func, repeat(args)) return starmap(func, repeat(args))