Author: georg.brandl
Date: Fri Jan 25 00:34:34 2008
New Revision: 60267
Modified:
python/branches/py3k/Doc/library/itertools.rst
Log:
Fix merge glitch.
Modified: python/branches/py3k/Doc/library/itertools.rst
==============================================================================
--- python/branches/py3k/Doc/library/itertools.rst (original)
+++ python/branches/py3k/Doc/library/itertools.rst Fri Jan 25 00:34:34 2008
@@ -259,22 +259,9 @@
makes possible an idiom for clustering a data series into n-length groups
using ``izip(*[iter(s)]*n)``.
-<<<<<<< .working
- Note, when :func:`izip` is used with unequal length inputs, subsequent
- iteration over the longer iterables cannot reliably be continued after
- :func:`izip` terminates. Potentially, up to one entry will be missing from
- each of the left-over iterables. This occurs because a value is fetched from
- each iterator in- turn, but the process ends when one of the iterators
- terminates. This leaves the last fetched values in limbo (they cannot be
- returned in a final, incomplete tuple and they are cannot be pushed back
into
- the iterator for retrieval with ``next(it)``). In general, :func:`izip`
- should only be used with unequal length inputs when you don't care about
- trailing, unmatched values from the longer iterables.
-=======
:func:`izip` should only be used with unequal length inputs when you don't
care about trailing, unmatched values from the longer iterables. If those
values are important, use :func:`izip_longest` instead.
->>>>>>> .merge-right.r60208
.. function:: izip_longest(*iterables[, fillvalue])
_______________________________________________
Python-3000-checkins mailing list
Python-3000-checkins@python.org
http://mail.python.org/mailman/listinfo/python-3000-checkins
