diff options
author | Raymond Hettinger <python@rcn.com> | 2009-01-29 03:41:55 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2009-01-29 03:41:55 (GMT) |
commit | 3522a58665b538953f640ea6a57a6483bdc147cd (patch) | |
tree | 7168dd1553cc0e35ede138ed9dd7acbda0387831 | |
parent | 32b5bb65f8dab46de166a6055b136b5e2116b48f (diff) | |
download | cpython-3522a58665b538953f640ea6a57a6483bdc147cd.zip cpython-3522a58665b538953f640ea6a57a6483bdc147cd.tar.gz cpython-3522a58665b538953f640ea6a57a6483bdc147cd.tar.bz2 |
Update itertools.__doc__ to include all tools.
-rw-r--r-- | Modules/itertoolsmodule.c | 15 |
1 files changed, 11 insertions, 4 deletions
diff --git a/Modules/itertoolsmodule.c b/Modules/itertoolsmodule.c index f9d2ee8..00f9893 100644 --- a/Modules/itertoolsmodule.c +++ b/Modules/itertoolsmodule.c @@ -3400,16 +3400,23 @@ cycle(p) --> p0, p1, ... plast, p0, p1, ...\n\ repeat(elem [,n]) --> elem, elem, elem, ... endlessly or up to n times\n\ \n\ Iterators terminating on the shortest input sequence:\n\ -zip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... \n\ +chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ... \n\ +compress(data, selectors) --> (d[0] if s[0]), (d[1] if s[1]), ...\n\ +dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails\n\ +groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v)\n\ filterfalse(pred, seq) --> elements of seq where pred(elem) is False\n\ islice(seq, [start,] stop [, step]) --> elements from\n\ seq[start:stop:step]\n\ starmap(fun, seq) --> fun(*seq[0]), fun(*seq[1]), ...\n\ tee(it, n=2) --> (it1, it2 , ... itn) splits one iterator into n\n\ -chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ... \n\ takewhile(pred, seq) --> seq[0], seq[1], until pred fails\n\ -dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails\n\ -groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v)\n\ +zip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... \n\ ++\n\ ++Combinatoric generators:\n\ ++product(p, q, ... [repeat=1]) --> cartesian product\n\ ++permutations(p[, r])\n\ ++combinations(p[, r])\n\ ++combinations_with_replacement(p[, r])\n\ "); |