[pypy-commit] pypy default: Update module docstring
arigo
noreply at buildbot.pypy.org
Thu Oct 8 09:36:46 CEST 2015
Author: Armin Rigo <arigo at tunes.org>
Branch:
Changeset: r80034:b58e5dc31dac
Date: 2015-10-08 09:19 +0200
http://bitbucket.org/pypy/pypy/changeset/b58e5dc31dac/
Log: Update module docstring
diff --git a/pypy/module/itertools/__init__.py b/pypy/module/itertools/__init__.py
--- a/pypy/module/itertools/__init__.py
+++ b/pypy/module/itertools/__init__.py
@@ -10,7 +10,6 @@
repeat(elem [,n]) --> elem, elem, elem, ... endlessly or up to n times
Iterators terminating on the shortest input sequence:
- izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
ifilter(pred, seq) --> elements of seq where pred(elem) is True
ifilterfalse(pred, seq) --> elements of seq where pred(elem) is False
islice(seq, [start,] stop [, step]) --> elements from
@@ -22,6 +21,14 @@
takewhile(pred, seq) --> seq[0], seq[1], until pred fails
dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails
groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v)
+ izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
+ izip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
+
+ Combinatoric generators:
+ product(p, q, ... [repeat=1]) --> cartesian product
+ permutations(p[, r])
+ combinations(p, r)
+ combinations_with_replacement(p, r)
"""
interpleveldefs = {
More information about the pypy-commit
mailing list