mirror of
https://github.com/python/cpython.git
synced 2025-08-04 00:48:58 +00:00
Fix docstrings for itertools combinatoric functions.
This commit is contained in:
parent
a7da1663ec
commit
36c3c027ad
2 changed files with 6 additions and 6 deletions
|
@ -2017,7 +2017,7 @@ empty:
|
|||
}
|
||||
|
||||
PyDoc_STRVAR(combinations_doc,
|
||||
"combinations(iterable[, r]) --> combinations object\n\
|
||||
"combinations(iterable, r) --> combinations object\n\
|
||||
\n\
|
||||
Return successive r-length combinations of elements in the iterable.\n\n\
|
||||
combinations(range(4), 3) --> (0,1,2), (0,1,3), (0,2,3), (1,2,3)");
|
||||
|
@ -2262,7 +2262,7 @@ empty:
|
|||
}
|
||||
|
||||
PyDoc_STRVAR(cwr_doc,
|
||||
"combinations_with_replacement(iterable[, r]) --> combinations_with_replacement object\n\
|
||||
"combinations_with_replacement(iterable, r) --> combinations_with_replacement object\n\
|
||||
\n\
|
||||
Return successive r-length combinations of elements in the iterable\n\
|
||||
allowing individual elements to have successive repeats.\n\
|
||||
|
@ -3494,8 +3494,8 @@ zip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... \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\
|
||||
combinations(p, r)\n\
|
||||
combinations_with_replacement(p, r)\n\
|
||||
");
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue