diff options
| author | Raymond Hettinger <python@rcn.com> | 2009-01-29 03:48:02 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2009-01-29 03:48:02 (GMT) |
| commit | 811f3dc174db9f1898b9cbe59fce243e082a3eb9 (patch) | |
| tree | 98ad698014a686db61627a8f24a7d2d1633422d6 | |
| parent | 3522a58665b538953f640ea6a57a6483bdc147cd (diff) | |
| download | cpython-811f3dc174db9f1898b9cbe59fce243e082a3eb9.zip cpython-811f3dc174db9f1898b9cbe59fce243e082a3eb9.tar.gz cpython-811f3dc174db9f1898b9cbe59fce243e082a3eb9.tar.bz2 | |
Fix typo.
| -rw-r--r-- | Modules/itertoolsmodule.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/Modules/itertoolsmodule.c b/Modules/itertoolsmodule.c index 00f9893..ac3941d 100644 --- a/Modules/itertoolsmodule.c +++ b/Modules/itertoolsmodule.c @@ -3411,12 +3411,12 @@ starmap(fun, seq) --> fun(*seq[0]), fun(*seq[1]), ...\n\ tee(it, n=2) --> (it1, it2 , ... itn) splits one iterator into n\n\ takewhile(pred, seq) --> seq[0], seq[1], until pred fails\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\ +\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\ "); |